Subject
General Computer Science,Theoretical Computer Science
Reference16 articles.
1. V. Arvind, J.Köbler, M. Mundhenk, On bounded truth-table, conjunctive, and randomized reductions to sparse sets, in: Proc. 12th Conf. on the Foundations of Software Technology & Theoretical Computer Science, Lecture Notes in Computer Science, vol. 652, Springer, Berlin, 1992, pp. 140–151.
2. Structural complexity I/II, EATCS Monographs on Theoretical Computer Science;Balcázar,19881990
3. On isomorphisms and density of NP and other complete sets;Berman;SIAM J. Comput.,1977
4. SPARSE reduces conjunctively to Tally;Buhrman,1993
5. Random strings make hard instances;Buhrman,1994