CORR
2002
Springer
13 years 4 months ago
2002
Springer
Abstract. We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on...
ECCC
2007
13 years 4 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...
STACS
2000
Springer
13 years 8 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...
FSTTCS
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. We prove several results about the average-case complexity of problems in the Polynomial Hierarchy (PH). We give a connection among average-case, worst-case, and non-unif...
FSTTCS
1992
Springer
13 years 8 months ago
1992
Springer
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
CSL
2004
Springer
13 years 10 months ago
2004
Springer
By viewing random 3-SAT as a distributional problem, we go over some of the notions of average-case complexity that were considered in the literature. We note that for dense formul...
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 ...
INDOCRYPT
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. In MyCrypt 2005, Augot, Finiasz, and Sendrier proposed FSB, a family of cryptographic hash functions. The security claim of the FSB hashes is based on a coding theory pro...
APPROX
2007
Springer
13 years 10 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...
ICALP
2009
Springer
14 years 4 months ago
2009
Springer
Abstract We revisit the classical QuickSort and QuickSelect algorithms, under a complexity model that fully takes into account the elementary comparisons between symbols composing ...