Subject
General Computer Science,Theoretical Computer Science
Reference32 articles.
1. Generic computation and its complexity;Abiteboul;Proc. 23rd ACM Symp. on Theory of Computing,1991
2. A linear-time algorithm for testing the truth of certain quantified Boolean formulas;Apsvall;Inform. Process. Lett.,1979
3. Henkin quantifiers and complete problems;Blass;Ann. Pure Appl. Logic,1986
4. Two applications of complementation via inductive counting;Borodin;Proc. 3rd IEEE Conf. on Structure in Complexity Theory,1988
5. An optimal lower bound on the number of variables for graph identification;Cai;Proc. 30th IEEE Symp. on Foundations of Computer Science,1989
Cited by
66 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献