Sciweavers

COCO
2010
Springer
131views Algorithms» more  COCO 2010»
13 years 8 months ago
On the Matching Problem for Special Graph Classes
An even cycle in a graph is called nice by Lov
Thanh Minh Hoang
COCO
2010
Springer
168views Algorithms» more  COCO 2010»
13 years 12 months ago
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...
Iftach Haitner, Mohammad Mahmoody, David Xiao
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
14 years 25 days ago
Trade-Off Lower Bounds for Stack Machines
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
Matei David, Periklis A. Papakonstantinou
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
14 years 1 months ago
The Gaussian Surface Area and Noise Sensitivity of Degree-d Polynomial Threshold Functions
Abstract. We prove asymptotically optimal bounds on the Gaussian noise sensitivity of degree-d polynomial threshold functions. These bounds translate into optimal bounds on the Gau...
Daniel M. Kane
COCO
2010
Springer
186views Algorithms» more  COCO 2010»
14 years 2 months ago
Derandomized Parallel Repetition of Structured PCPs
A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof, and in return ...
Irit Dinur, Or Meir
COCO
2010
Springer
180views Algorithms» more  COCO 2010»
14 years 2 months ago
Completely Inapproximable Monotone and Antimonotone Parameterized Problems
We prove that weighted monotone/antimonotone circuit satisfiability has no fixed-parameter tractable approximation algorithm with any approximation ratio function ρ, unless FPT...
Dániel Marx
COCO
2010
Springer
129views Algorithms» more  COCO 2010»
14 years 2 months ago
On the Relative Strength of Pebbling and Resolution
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
Jakob Nordström
COCO
2010
Springer
148views Algorithms» more  COCO 2010»
14 years 2 months ago
Derandomizing from Random Strings
—In this paper we show that BPP is truth-table reducible to the set of Kolmogorov random strings RK . It was previously known that PSPACE, and hence BPP is Turingreducible to RK ...
Harry Buhrman, Lance Fortnow, Michal Koucký...
COCO
2010
Springer
198views Algorithms» more  COCO 2010»
14 years 2 months ago
Derandomized Parallel Repetition Theorems for Free Games
—Raz’s parallel repetition theorem [21] together with improvements of Holenstein [12] shows that for any two-prover one-round game with value at most 1 − (for ≤ 1/2), the v...
Ronen Shaltiel