38 search results - page 1 / 8 » Worst-Case Versus Average Case Complexity of Ray-Shooting |
COMPUTING
1998
13 years 5 months ago
1998
ECRTS
2010
IEEE
13 years 5 months ago
2010
IEEE
STACS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
APPROX
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
We show that if an NP-complete problem has a non-adaptive self-corrector with respect to a samplable distribution then coNP is contained in NP/poly and the polynomial hierarchy co...