Author:
Buhrman Harry,Fortnow Lance
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference23 articles.
1. NP might not be as easy as detecting unique solutions;Beigel,1998
2. Commutative queries;Beigel,1997
3. Oracles and queries that are sufficient for exact learning;Bshouty;J. Comput. System Sci.,1996
4. A relationship between difference hierarchies and relativized polynomial hierarchies;Beigel;Math. Systems Theory,1993
5. Structural Complexity I;Balcázar,1988
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献