Limitations of the Upward Separation Technique (1990)

by Eric Allender
Citations:16 - 0 self

Documents Related by Co-Citation

51 On sparse sets – J Hartmanis - 1983
25 Defying upward and downward separation – L Hemaspaandra, S Jha - 1995
244 On the structure of polynomial time reducibility – Richard E Ladner - 1975
7 Downward translations of equality – E Allender, C Wilson - 1990
15 Upward Separation for FewP and Related Classes – Rajesh P. N. Rao, Jörg Rothe, Osamu Watanabe - 1994
45 Tally languages and complexity classes – R V Book - 1974
32 Two queries – Harry Buhrman, Lance Fortnow - 1999
53 P-printable sets – E Allender, R Rubinstein - 1986
184 The equivalence problem for regular expressions with squaring requires exponential space – A R Meyer, L J Stockmeyer - 1972
264 The polynomial-time hierarchy – Larry J Stockmeyer - 1976
23 A Downward Collapse Within The Polynomial Hierarchy – Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel - 1998
85 Relative complexity of checking and evaluating – L Valiant - 1976
14 What’s up with downward collapse: Using the easy-hard technique to link boolean and polynomial hierarchy collapses – Edith Hemaspaandra, Lane A. Hemaspa, Harald Hempel - 1998
160 On isomorphisms and density of NP and other complete sets – L Berman, J Hartmanis - 1977
50 On the power of parity polynomial time – Jin-Yi Cai, Lane Hemachandra - 1990
32 The complexity of decision versus search – Mihir Bellare, Shafi Goldwasser - 1994
51 The Boolean Hierarchy and the Polynomial Hierarchy: a Closer Connection – Richard Chang, Jim Kadin - 1993
31 On the boolean closure of NP – G Wechsung - 1985
67 The polynomial time hierarchy collapses if the boolean hierarchy collapses – Jim Kadin - 1988