2661 search results - page 98 / 533 » Quantum Complexity Classes |
141
Voted
ISAAC
2010
Springer
14 years 10 months ago
2010
Springer
We study line systems in metric spaces induced by graphs. A line is a subset of vertices defined by a relation of betweeness. We show that the class of all graphs having exactly k ...
131
click to vote
NIPS
2000
15 years 2 months ago
2000
Learning of a smooth but nonparametric probability density can be regularized using methods of Quantum Field Theory. We implement a field theoretic prior numerically, test its eff...
89
Voted
APAL
2006
15 years 27 days 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...
95
Voted
LOGCOM
2007
15 years 22 days ago
2007
Abstract. We describe a natural generalization of ordinary computation to a third-order setting and give a function calculus with nice properties and recursion-theoretic characteri...
127
click to vote
COCO
2008
Springer
15 years 2 months ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...