364 search results - page 16 / 73 » Dimension Characterizations of Complexity Classes |
APAL
2006
13 years 7 months ago
2006
We investigate the question of whether one can characterize complexity classes (such as PSPACE or NEXP) in terms of efficient reducibility to the set of Kolmogorovrandom strings R...
CSR
2007
Springer
14 years 1 months ago
2007
Springer
We revisit a well studied linear algebraic problem, computing the rank and determinant of matrices, in order to obtain completeness results for small complexity classes. In partic...
CDC
2009
IEEE
13 years 10 months ago
2009
IEEE
— In this article, we investigate a new class of control problems called Ensemble Control, a notion coming from the study of complex spin dynamics in Nuclear Magnetic Resonance (...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Statistical query (SQ) learning model of Kearns is a natural restriction of the PAC learning model in which a learning algorithm is allowed to obtain estimates of statistical prop...
FOCS
1998
IEEE
13 years 11 months ago
1998
IEEE
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...