The relative complexity of NP search problems

The relative complexity of NP search problems (1997)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Paul Beame , Stephen Cook , Jeff Edmonds , Russell Impagliazzo , Toniann Pitassi

Citations:

54 - 6 self

BibTeX

@TECHREPORT{Beame97therelative,
    author = {Paul Beame and Stephen Cook and Jeff Edmonds and Russell Impagliazzo and Toniann Pitassi},
    title = {The relative complexity of NP search problems},
    institution = {},
    year = {1997}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

74	General oracle and oracle classes - Blum, Impagliazzo
34	Decision trees and downward closures - Impagliazzo, Naor - 1988
33	Mihalis Yannakakis. How easy is local search - Johnson, Papadimtriou - 1988
29	On graph-theoretic lemmata and complexity classes - Papadimitriou - 1990
24	L.: One-way functions, robustness, and nonisomorphism of NP-complete sets - Hartmanis, Hemachandra - 1987
4	bounds on Hilbert's Nullstellensatz and propositional proofs - Lower - 1994
4	Every prime has a succinct certi cate - Pratt - 1975
1	On ine cient proofs of existence and complexity classes - Papadimitriou - 1991
1	Scha er, and Mihalis Yannakakis. On the complexity of local search - Papadimitriou, Alejandro - 1990
1	ren Riis. Independence in Bounded Arithmetic - unknown authors - 1993