2661 search results - page 109 / 533 » Quantum Complexity Classes |
115
click to vote
EJC
1998
15 years 2 months ago
1998
A hierarchy of classes of graphs is proposed which includes hypercubes, acyclic cubical complexes, median graphs, almost median graphs, premedian graphs and partial cubes. Structu...
116
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit...
123
click to vote
CIE
2008
Springer
15 years 5 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
140
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true d...
115
click to vote
CIARP
2005
Springer
15 years 8 months ago
2005
Springer
Tin Kam Ho and Ester Bernardò Mansilla in 2004 proposed to use data complexity measures to determine the domain of competition of the classifiers. They applied different classifie...