Author:
Buhrman Harry,Spaan Edith,Torenvliet Leen
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference16 articles.
1. J. Balcázar, J. Díaz, and J. Gabarró,Structural Complexity I. Springer-Verlag, 1988.
2. J. Balcázar, J. Díaz, and J. Gabarró,Structural Complexity II. Springer-Verlag, 1990.
3. L. Berman, On the structure of complete sets: Almost everywhere complexity and infinitely often speedup.Proc. 17th IEEE Symposium on Foundations of Computing (1976), 76?80.
4. L. Berman andH. Hartmanis, On isomorphisms and density of NP and other complete sets.SIAM J. Comput. 6 (1977), 305?322.
5. R.B. Boppana andM. Sipser, The complexity of finite functions. InHandbook of theoretical computer science, ed.J. van Leeuwen, vol. A Algorithms and Complexity, 757?804. Elsevier, Amsterdam. New York. Oxford. Tokyo, 1990.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Planar and Grid Graph Reachability Problems;Theory of Computing Systems;2009-02-05
2. Non-Uniform Reductions;Theory of Computing Systems;2009-01-09
3. The Directed Planar Reachability Problem;Lecture Notes in Computer Science;2005
4. Splittings, Robustness, and Structure of Complete Sets;SIAM Journal on Computing;1998-06
5. Other Public-Key Cryptosystems and Protocols;Texts in Theoretical Computer Science An EATCS Series