Limitations of the Upward Separation Technique (1990)

by Eric Allender
Citations:16 - 0 self

Documents Related by Co-Citation

50 Sparse sets – J Hartmanis, N Immerman, V Sewelson - 1985
24 Defying upward and downward separation – L Hemaspaandra, S Jha - 1995
241 On the structure of polynomial time reducibility – R Ladner - 1975
7 Downward translations of equality – E Allender, C Wilson - 1990
32 Two queries – Harry Buhrman, Lance Fortnow - 1999
45 Tally languages and complexity classes – R V BOOK - 1974
184 The equivalence problem for regular expressions with squaring requires exponential space – A R Meyer, L Stockmeyer - 1972
54 P-printable sets – E Allender, R Rubinstein - 1988
14 Upward Separation for FewP and Related Classes – Rajesh P. N. Rao, Jörg Rothe, Osamu Watanabe - 1994
23 A Downward Collapse Within The Polynomial Hierarchy – Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel - 1998
84 Relative complexity of checking and evaluation – L G 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
163 On isomorphism and density of NP and other complete sets – L Berman, J Hartmanis - 1977
267 The polynomial-time hierarchy – L Stockmeyer - 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
67 The polynomial time hierarchy collapses if the boolean hierarchy collapses – J Kadin - 1988
2352 Monotone Complexity – Michelangelo Grigni , Michael Sipser - 1990
3843 Introduction to Automata Theory, Languages and Computability – J Hopcroft, J Ullman, R Motwani - 2001