Inseparability and Strong Hypotheses for Disjoint NP Pairs.
- Published in:
- Theory of Computing Systems, 2012, v. 51, n. 2, p. 229, doi. 10.1007/s00224-011-9326-7
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 2012 AND VI 51 AND IP 2
Results: 7
1
2
Dispersion in Disks.
- Published in:
- Theory of Computing Systems, 2012, v. 51, n. 2, p. 125, doi. 10.1007/s00224-011-9331-x
- By:
- Publication type:
- Article
3
On Optimal Heuristic Randomized Semidecision Procedures, with Applications to Proof Complexity and Cryptography.
- Published in:
- Theory of Computing Systems, 2012, v. 51, n. 2, p. 179, doi. 10.1007/s00224-011-9354-3
- By:
- Publication type:
- Article
4
The Complexity of the List Homomorphism Problem for Graphs.
- Published in:
- Theory of Computing Systems, 2012, v. 51, n. 2, p. 143, doi. 10.1007/s00224-011-9333-8
- By:
- Publication type:
- Article
5
Representing Hyper-arithmetical Sets by Equations over Sets of Integers.
- Published in:
- Theory of Computing Systems, 2012, v. 51, n. 2, p. 196, doi. 10.1007/s00224-011-9352-5
- By:
- Publication type:
- Article
6
Collapsing and Separating Completeness Notions Under Average-Case and Worst-Case Hypotheses.
- Published in:
- Theory of Computing Systems, 2012, v. 51, n. 2, p. 248, doi. 10.1007/s00224-011-9365-0
- By:
- Publication type:
- Article
7
Theoretical Aspects of Computer Science.
- Published in:
- 2012
- By:
- Publication type:
- Editorial