2661 search results - page 155 / 533 » Quantum Complexity Classes |
147
click to vote
CADE
2012
Springer
13 years 5 months ago
2012
Springer
Abstract. Reachability and LTL model-checking problems for flat counter systems are known to be decidable but whereas the reachability problem can be shown in NP, the best known c...
108
click to vote
KES
1998
Springer
15 years 7 months ago
1998
Springer
Attractor systems are useful in neurodynamics,mainly in the modelingof associative memory. Thispaper presentsa complexity theory for continuous phase space dynamical systems with ...
105
Voted
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
Recently, Mikołaj Boja´nczyk introduced a class of max-regular languages, an extension of regular languages of infinite words preserving many of its usual properties. This new c...
123
click to vote
MP
2008
15 years 3 months ago
2008
In this paper we propose an accelerated version of the cubic regularization of Newton's method [6]. The original version, used for minimizing a convex function with Lipschitz...
114
Voted
TVCG
2010
15 years 1 months ago
2010
—We are interested in 3-dimensional images given as arrays of voxels with intensity values. Extending these values to a continuous function, we study the robustness of homology c...