697 search results - page 3 / 140 » On the Theory of Average Case Complexity |
95
Voted
STACS
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. We compare classical and quantum query complexities of total Boolean functions. It is known that for worst-case complexity, the gap between quantum and classical can be a...
71
Voted
ECCC
2007
14 years 9 months ago
2007
Abstract. Motivated by a study of Zimand (22nd CCC, 2007), we consider the average-case complexity of property testing (focusing, for clarity, on testing properties of Boolean stri...
95
Voted
COCO
1995
Springer
15 years 1 months ago
1995
Springer
For the worst-case complexity measure, if P = NP, then P = OptP, i.e., all NP optimization problems are polynomial-time solvable. On the other hand, it is not clear whether a simi...
ISAAC
1995
Springer
15 years 1 months ago
1995
Springer
An extended abstract of this paper will be presented at the Sixth Annual International Symposium on Algorithms and Computation.
CC
2007
Springer
14 years 9 months ago
2007
Springer