MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "On the Theory of Average Case Complexity." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

35 documents found, showing 1 through 10. Next 10 →

ATOM

On the Theory of Average Case Complexity
by Shai Ben-david, Benny Chor, Oded Goldreich, Michael Luby — 1997 — Journal of Computer and System Sciences
…On the Theory of Average Case Complexity Shai Ben-David y Benny Chor Oded Goldreich z Dept…
Cited by 89 (6 self) – Add To MetaCart

On the Reduction Theory for Average Case Complexity
by Andreas Blass, Yuri Gurevich — 1991
…On the reduction theory for average case complexity 1 Andreas Blass 2 and Yuri Gurevich 3…
Add To MetaCart

Notes on Levin's Theory of Average-Case Complexity
by Oded Goldreich — 1997 — Electronic Colloquium on Computational Complexity
… Notes on Levin's Theory of Average-Case Complexity Oded Goldreich \Lambda Department…
Cited by 15 (1 self) – Add To MetaCart

Finding Hard Instances of the Satisfiability Problem: A Survey
by Stephen A. Cook, David G. Mitchell — 1997
… the performance of the most popular SAT algorithms on random problems, the theory of average case complexity…
Cited by 90 (1 self) – Add To MetaCart

Randomizing Reductions
by Of Search Problems, Andreas Blass, Yuri Gurevich — 1993 — SIAM Journal of Computing
… closes a gap in the foundations of the theory of average case complexity. First, we clarify the notion…
Add To MetaCart

The Average Length of Keys and Functional Dependencies in (Random) Databases
by J. Demetrovics, G. O. H. Katona, D. Miklos, O. Seleznjev, B. Thalheim — 1995
…. However, beliefs are related to average cases. The theory known so far considered worst case complexity…
Add To MetaCart

Matrix Transformation is Complete for the Average Case
by Andreas Blass, Yuri Gurevich, Andyuri Gurevich — 1995 — SIAM Journal on Computing
… Abstract In the theory of worst case complexity, NP completeness is used to establish that, for all…
Cited by 14 (1 self) – Add To MetaCart

Matrix Transformation
by Is Complete For, Andreas Blass, Yuri Gurevich — 1995 — SIAM Journal on Computing
… ‡ Abstract In the theory of worst case complexity, NP completeness is used to establish that, for all…
Add To MetaCart

Junta distributions and the average-case complexity of manipulating elections
by Ariel D. Procaccia, Jeffrey S. Rosenschein — 2006 — In AAMAS
… the existing theory of average-case complexity with some new concepts. In particular, we consider elections…
Cited by 38 (10 self) – Add To MetaCart

Randomizing Reductions Of Search Problems
by Andreas Blass, Yuri Gurevich — 1993 — SIAM Journal of Computing
…. This paper closes a gap in the foundations of the theory of average case complexity. First, we clarify…
Cited by 12 (2 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB