Upper Bounds for a Theory of Queues
暂无分享,去创建一个
[1] Andrei Voronkov,et al. Complexity of nonrecursive logic programs with complex values , 1998, PODS.
[2] J. Ferrante,et al. The computational complexity of logical theories , 1979 .
[3] Manfred Broy,et al. Proceedings of The 1998 ARO/ONR/NSF/DARPA Monterey Workshop on Engineering Automation for Computer Based Systems Held in Carmel, California on October 23-26, 1998. , 1999 .
[4] Z. Manna,et al. Integrating decision procedures for temporal verification , 1998 .
[5] Achim Blumensath,et al. Automatic structures , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).
[6] Anil Nerode,et al. Automatic Presentations of Structures , 1994, LCC.
[7] Thomas Schwentick,et al. A model-theoretic approach to regular string relations , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.
[8] C. Ward Henson,et al. A Uniform Method for Proving Lower Bounds on the Computational Complexity of Logical Theories , 1990, Ann. Pure Appl. Log..
[9] Hugo Volger. Turing Machines with Linear Alternation, Theories of Bounded Concatenation and the Decision Problem of First Order Theories , 1983, Theor. Comput. Sci..
[10] Andrei Voronkov,et al. A decision procedure for term algebras with queues , 2001, TOCL.
[11] Wolfgang Thomas. Infinite Trees and Automation-Definable Relations over omega-Words , 1992, Theor. Comput. Sci..