2661 search results - page 67 / 533 » Quantum Complexity Classes |
77
Voted
CIE
2006
Springer
15 years 4 months ago
2006
Springer
We introduce two hierarchies of unknown ordinal height. The hierarchies are induced by natural fragments of a calculus based on finite types and G
EUROCOLT
1997
Springer
15 years 4 months ago
1997
Springer
The approach of ordinal mind change complexity, introduced by Freivalds and Smith, uses (notations for) constructive ordinals to bound the number of mind changes made by a learnin...
91
Voted
FSTTCS
2008
Springer
15 years 1 months ago
2008
Springer
Two complexity results are shown for the output languages generated by compositions of macro tree transducers. They are in NSPACE(n) and hence are context-sensitive, and the class ...
85
Voted
CSR
2007
Springer
15 years 7 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...
139
click to vote
ECCC
2011
14 years 7 months ago
2011
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...