395 search results - page 38 / 79 » Positive Versions of Polynomial Time |
111
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
The complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a r...
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
— This paper presents a sufficient condition that establishes closed loop stability for linear time invariant dynamical systems with transfer functions that are analytic in the ...
COCO
2004
Springer
15 years 1 months ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
ASP
2003
Springer
15 years 3 months ago
2003
Springer
Default logic is used to describe regular behavior and normal properties. We suggest to exploit the framework of default logic for detecting outliers - individuals who behave in a...
ACISP
2010
Springer
14 years 11 months ago
2010
Springer
We introduce a "generalized small inverse problem (GSIP)" and present an algorithm for solving this problem. GSIP is formulated as finding small solutions of f(x0, x1, . ...