COCO 2005 - PDF Preprint Papers

COCO 2005 Annual IEEE Conference on Computational Complexity

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed COCO-2005 Paper

click to vote

COCO
2005
Springer

153views Algorithms» more COCO 2005»

Average-Case Computations - Comparing AvgP, HP, and Nearly-P

13 years 10 months ago

Download www.thi.uni-hannover.de

We examine classes of distributional problems deﬁned in terms of polynomial-time decision algorithms with bounded error probability. The class AvgP [5] has been characterized in...

Arfst Nickelsen, Birgit Schelm

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	153	Average-Case Computations - Comparing AvgP, HP, and Nearly-P	claim
2	150	The Quantum Adversary Method and Classical Formula Size Lower Bounds	claim
3	141	Upper Bounds for Quantum Interactive Proofs with Competing Provers	claim
4	131	On the Hardness of Approximating Multicut and Sparsest-Cut	claim
5	130	Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates	claim
6	128	More on Noncommutative Polynomial Identity Testing	claim
7	124	Tolerant Versus Intolerant Testing for Boolean Properties	claim
8	123	If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances	claim
9	112	On Constructing Parallel Pseudorandom Generators from One-Way Functions	claim
10	110	Prior Entanglement, Message Compression and Privacy in Quantum Communication	claim
11	106	The Complexity of the Inertia and Some Closure Properties of GapL	claim
12	99	On the Complexity of Succinct Zero-Sum Games	claim
13	98	On the Hardness of Distinguishing Mixed-State Quantum Computations	claim
14	96	A Geometric Approach to Information-Theoretic Private Information Retrieval	claim
15	92	Monotone Circuits for Weighted Threshold Functions	claim
16	89	Computationally Private Randomizing Polynomials and Their Applications	claim
17	89	Hardness of Max 3SAT with No Mixed Clauses	claim
18	89	Better Time-Space Lower Bounds for SAT and Related Problems	claim
19	80	New Results on the Complexity of the Middle Bit of Multiplication	claim
20	79	Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy	claim
21	77	On the Sensitivity of Cyclically-Invariant Boolean Functions	claim
22	75	Topology Inside NC¹	claim
23	72	Toward a Model for Backtracking and Dynamic Programming	claim
24	68	Pseudorandomness for Approximate Counting and Sampling	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers