High Sets for NP

High Sets for NP (1997)

Cached

Download Links

[samy.informatik.hu-berlin.de]

Other Repositories/Bibliography

DBLP

by Johannes Köbler , Uwe Schöning

Venue:	In Advances in Algorithms, Languages, and Complexity
Citations:	4 - 2 self

BibTeX

@INPROCEEDINGS{Köbler97highsets,
    author = {Johannes Köbler and Uwe Schöning},
    title = {High Sets for NP},
    booktitle = {In Advances in Algorithms, Languages, and Complexity},
    year = {1997},
    pages = {139--156},
    publisher = {Kluwer Academic Publishers}
}

Bookmark

OpenURL

Abstract

this paper is a proof that NP-hard

Citations

8879	Computers and Intractability: A guide to the Theory of NP-Completeness - Garey, Johnson - 1979
637	The complexity of theorem-proving procedures - Cook
590	Universal classes of hash functions - CARTER, WEGMAN - 1979
212	Some connections between nonuniform and uniform complexity classes - Karp, Lipton - 1980
185	NP is as easy as detecting unique solutions - Valiant, Vazirani - 1986
136	A complexity theoretic approach to randomness - Sipser - 1983
87	Two theorems on random polynomial time - Adleman - 1978
72	Oracles and queries that are sufficient for exact learning - Bshouty, Cleve, et al. - 1996
57	Relativized circuit complexity - Wilson - 1985
56	New collapse consequences of NP having small circuits - Kobler, Watanabe - 1999
52	Relative to a random oracle A, P A 6= NP A 6= co-NP A with probability 1 - Bennett, Gill - 1981
33	Reducibility, randomness and intractability - Adleman, Manders - 1977
32	Lower bounds for the low hierarchy - Allender, Hemachandra
32	New NP-Hard and NP-Complete Polynomial and Integer Divisibility Problems,” Theoret - Plaisted - 1984
31	Sparse sets, lowness and highness - Balcázar, Book, et al. - 1986
27	On circuit-size complexity and the low hierarchy in NP - Ko, Schöning - 1985
26	Some observations on probabilistic algorithms and NPhard problems - KO - 1982
22	Strong nondeterministic polynomial-time reducibilities, Theoretical Computer Science 21 - Long - 1982
16	Probabilistic Quantifiers, Adversaries, and Complexity Classes: An Overview,” Proc. 1 st Structure in Complexity Theory Conference - Zachos - 1986
15	Some comments on functional self-reducibility and the NP hierarchy - Borodin, Demers - 1976
15	Complexity-theoretic aspects of interactive proof systems - Fortnow - 1989
15	A refinement of the low and high hierarchies - Long, Sheu - 1991
14	Recent directions in algorithmic research - Hopcroft - 1981
12	Polynomial time enumeration reducibility - Selman - 1978
11	Robustness of probabilistic computational complexity classes under definitional perturbations - Zachos - 1982
8	Connections between the complexity of unique satisfiability and the threshold behavior of randomized reductions - Chang, Kadin, et al. - 1991
8	oning, Complexity and Structure - Sch - 1986
8	A natural encoding scheme proved probabilistic polynomial complete. Theoretical Computer Science 24 - Vazirani, Vazirani - 1983
7	oning, Probabilistic complexity classes and lowness - Sch - 1989
6	Reductions that lie - Adleman, Manders - 1979
6	Strong nondeterministic Turing reduction—a technique for proving intractability - Chung, Ravikumar - 1989
6	Turing machines with few accepting computations and low sets for PP - obler, oning, et al. - 1992
5	Non-uniform proof systems: A new framework to describe non-uniform and probabilistic complexity classes - amper - 1991
5	Generalized lowness and highness and probabilistic complexity classes - Klapper - 1989
5	Complete divisibility problems for slowly utilized oracles - Plaisted - 1985
5	oning, A low and a high hierarchy within NP - Sch - 1983
4	Locating P/poly optimally in the extended low hierarchy - obler - 1994
3	If NP has polynomial-size circuits, then MA=AM - Arvind, Kobler, et al. - 1995
3	oning. On random reductions from sparse sets to tally sets - Sch - 1993
2	Self-reducibility structures and solutions of NP problems - azar - 1989
2	Lowness properties of sets in the exponential-time hierarchy - Book, Orponen, et al. - 1988
2	On the structure of low sets - obler - 1995
1	E-mail message on the TheoryNet - Gupta - 1995
1	oning. Robust oracle machines - Sch - 1988