165 search results - page 25 / 33 » Cryptographic Complexity Classes and Computational Intractab... |
87
Voted
JUCS
2010
14 years 10 months ago
2010
Abstract: This paper discusses three rectilinear (that is, axis-parallel) covering problems in d dimensions and their variants. The first problem is the Rectilinear Line Cover whe...
110
Voted
COCO
2005
Springer
15 years 5 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
87
Voted
CC
2007
Springer
14 years 11 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
82
Voted
FOCS
2005
IEEE
15 years 5 months ago
2005
IEEE
Barak et al. formalized the notion of obfuscation, and showed that there exist (contrived) classes of functions that cannot be obfuscated. In contrast, Canetti and Wee showed how ...
ICML
2005
IEEE
16 years 14 days ago
2005
IEEE
We introduce a family of kernels on discrete data structures within the general class of decomposition kernels. A weighted decomposition kernel (WDK) is computed by dividing objec...