Author:
Hemaspaandra Lane A.,Thakur Mayur
Subject
General Computer Science,Theoretical Computer Science
Reference38 articles.
1. The space complexity of approximating the frequency moments;Alon;Journal of Computer and System Sciences,1999
2. Honest polynomial reducibilities, recursively enumerable sets, and the P=?NP problem;Ambos-Spies,1987
3. Separating NP-completeness notions under strong hypotheses;Ambos-Spies;Journal of Computer and System Sciences,2000
4. On isomorphisms and density of NP and other complete sets;Berman;SIAM Journal on Computing,1977
5. On the structure of complete sets;Buhrman,1994