Sciweavers

2 search results - page 1 / 1
» On the Power of Randomized Reductions and the Checkability o...
Sort
View
87
Voted
COCO
2010
Springer
125views Algorithms» more  COCO 2010»
15 years 4 months ago
On the Power of Randomized Reductions and the Checkability of SAT
Mohammad Mahmoody, David Xiao
FSTTCS
1992
Springer
15 years 4 months ago
On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets
In this paper we study the consequences of the existence of sparse hard sets for NP and other complexity classes under certain types of deterministic, randomized, and nondetermini...
Vikraman Arvind, Johannes Köbler, Martin Mund...