Author:
Eiter Thomas,Veith Helmut
Subject
General Computer Science,Theoretical Computer Science
Reference46 articles.
1. Foundations of Databases;Abiteboul,1995
2. V. Arvind, J. Torán, Sparse sets, approximable sets, and parallel queries to NP, in: C. Meinel, S. Tison (Eds.), Proc. 16th Symp. on Theoretical Aspects of Computing (STACS ’99), Lecture Notes in Computer Science, Vol, 1563, Trier, March 1999, Springer, Berlin, pp. 281–290.
3. The complexity of algorithmic problems on succinct instances;Balcázar,1992
4. R. Beigel, NP-hard sets are P-superterse unless R=NP, Tech. Report TR4, CS Dept., Johns Hopkins University, 1988.
5. Autoepistemic logics as a unifying framework for the semantics of logic programs;Bonatti;J. Logic Program.,1995
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献