polynomial-time samplable distribution

ECCC
2010

95views more ECCC 2010»

On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography

13 years 8 months ago

The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Kraj

Edward A. Hirsch, Dmitry Itsykson, Ivan Monakhov, ...

claim paper

Read More »

click to vote

APPROX
2007
Springer

104views Algorithms» more APPROX 2007»

Worst-Case to Average-Case Reductions Revisited

14 years 5 months ago

Download www.cs.tau.ac.il

Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to ﬁnd a polynomial-time samplable distribution (e.g., the uniform distribution) and...

Dan Gutfreund, Amnon Ta-Shma

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers