Author:
Borchert Bernd,Silvestri Riccardo
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference23 articles.
1. Two theorems on random polynomial time;Adleman,1978
2. Sublattices of the polynomial time degrees;Ambos-Spies;Inform. and Control,1985
3. Minimal pairs for polynomial time reducibilities;Ambos-Spies,1986
4. On the relative complexity of hard problems for complexity classes without complete problems;Ambos-Spies;Theoret. Comput. Sci.,1989
5. Structural Complexity I;Balcázar,1988
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. THE DOT-DEPTH AND THE POLYNOMIAL HIERARCHIES CORRESPOND ON THE DELTA LEVELS;International Journal of Foundations of Computer Science;2005-08
2. Leaf Language Classes;Lecture Notes in Computer Science;2005
3. Dot operators;Theoretical Computer Science;2001-07
4. Succinctness as a source of complexity in logical formalisms;Annals of Pure and Applied Logic;1999-03