Sciweavers

32 search results - page 2 / 7
» Relativizing Small Complexity Classes and Their Theories
Sort
View
STOC
2009
ACM
106views Algorithms» more  STOC 2009»
14 years 5 months ago
An axiomatic approach to algebrization
Non-relativization of complexity issues can be interpreted as giving some evidence that these issues cannot be resolved by "black-box" techniques. In the early 1990'...
Russell Impagliazzo, Valentine Kabanets, Antonina ...
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
13 years 9 months ago
Quantum complexity theory
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
Ethan Bernstein, Umesh V. Vazirani
PREMI
2007
Springer
13 years 11 months ago
Rough Set Theory of Pattern Classification in the Brain
Humans effortlessly classify and recognize complex patterns even if their attributes are imprecise and often inconsistent. It is not clear how the brain processes uncertain visual ...
Andrzej W. Przybyszewski
COCO
1994
Springer
100views Algorithms» more  COCO 1994»
13 years 9 months ago
Relative to a Random Oracle, NP is Not Small
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...
Steven M. Kautz, Peter Bro Miltersen
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 5 months ago
The Complexity of Proving the Discrete Jordan Curve Theorem
The Jordan Curve Theorem (JCT) states that a simple closed curve divides the plane into exactly two connected regions. We formalize and prove the theorem in the context of grid gr...
Phuong Nguyen, Stephen Cook