Skip to main content Accessibility help
×
Home

On polynomial time computation over unordered structures

  • Andreas Blass (a1), Yuri Gurevich (a2) and Saharon Shelah (a3) (a4)

Abstract

This paper is motivated by the question whether there exists a logic capturing polynomial time computation over unordered structures. We consider several algorithmic problems near the border of the known, logically defined complexity classes contained in polynomial time. We show that fixpoint logic plus counting is stronger than might be expected, in that it can express the existence of a complete matching in a bipartite graph. We revisit the known examples that separate polynomial time from fixpoint plus counting. We show that the examples in a paper of Cai, Fürer, and Immerman, when suitably padded, are in choiceless polynomial time yet not in fixpoint plus counting. Without padding, they remain in polynomial time but appear not to be in choiceless polynomial time plus counting. Similar results hold for the multipede examples of Gurevich and Shelah, except that their final version of multipedes is, in a sense, already suitably padded. Finally, we describe another possible candidate, involving determinants, for the task of separating polynomial time from choiceless polynomial time plus counting.

Copyright

References

Hide All
[1]Abiteboul, S. and Vianu, V., Generic computation and its complexity, Proceedings of the 23rd ACM Symposium on Theory of Computing, 1991, pp. 209219.
[2]Blass, A. and Gurevich, Y., Strong extension axioms and Shelah's zero-one law for choiceless polynomial time, to appear.
[3]Blass, A., Equivalence relations, invariants, and normal forms, SIAM Journal on Computing, vol. 13 (1984), pp. 682689.
[4]Blass, A., Equivalence relations, invariants, and normal forms, II, Logic and Machines: Decision Problems and Complexity (Börger, E., Hasenjaeger, G., and Rödding, D., editors), Lecture Notes in Computer Science, vol. 171, Springer-Verlag, 1984, pp. 2442.
[5]Blass, A., Gurevich, Y., and den Bussche, J. V., Abstract state machines and computationally complete query languages, Information and Computation, An abridged version appeared in Abstract State Machines: Theory and Applications, (Gurevich, Y., Kutter, P., Odersky, M., and Thiele, L., editors). Lecture Notes in Computer Science, vol. 1912, Spinger-Verlag, 2000, pp. 2233.
[6]Blass, A., Gurevich, Y., and Shelah, S., Choiceless polynomial time, Annals of Pure and Applied Logic, vol. 100 (1999), pp. 141187.
[7]Bollobás, B., Graph Theory: An Introductory Course, Springer-Verlag, 1979.
[8]Cai, J. Y., Fürer, M., and Immerman, N., An optimal lower bound on the number of variables for graph identification, Combinatorica, vol. 12 (1992), pp. 389410.
[9]Chandra, A. and Harel, D., Structure and complexity of relational queries, Journal of Computer and System Sciences, vol. 25 (1982), pp. 99128.
[10]Gire, F. and Hoang, H. A, An extension of fixpoint logic with a symmetry-based choice construct, Information and Computation, vol. 144 (1998), pp. 4065.
[11]Grädel, E. and Gurevich, Y., Metafinite model theory, Information and Computation, vol. 140 (1998), pp. 2681.
[12]Gurevich, Y., Logic and the challenge of computer science, Current trends in theoretical computer science (Börger, E., editor). Computer Science Press, 1988, pp. 157.
[13]Gurevich, Y., Evolving algebras 1993: Lipari guide, Specification and validation methods (Börger, E., editor), Oxford University Press, 1995, pp. 936.
[14]Gurevich, Y., From invariants to canonization, Bulletin of the European Association on Theoretical Computer Science, vol. 63 (1997), Also as Logic in Computer Science, in Current trends in theoretical computer science: Entering the 21st century, (Paun, G., Rozenberg, G. and Salomaa, A., editors). World Scientific, 2001, pp. 233436.
[15]Gurevich, Y. and Shelah, S., On finite rigid structures, this Journal, vol. 61 (1996), pp. 549562.
[16]Huggins, J. K., ASM Michigan Web page, http://www.eecs.umich.edu/gasm/.
[17]Immerman, N., Relational queries computable in polynomial time, Information and Control, vol. 68 (1986), pp. 86104.
[18]Otto, M., Bounded variable logics and counting: A study in finite models, Lecture Notes in Logic, vol. 9, Springer-Verlag, 1997.
[19]Shelah, S., Choiceless polynomial time logic: Inability to express, Computer Science Logic 2000 (Clote, P. and Schwichtenberg, H., editors), Lecture Notes in Computer Science, vol. 1862, Springer-Verlag, 2000, paper number 634, pp. 72125.
[20]Vardi, M., The complexity of relational query languages, Proceedings of the 14th ACM Symposium on Theory of Computing, 1982, pp. 137146.

Related content

Powered by UNSILO

On polynomial time computation over unordered structures

  • Andreas Blass (a1), Yuri Gurevich (a2) and Saharon Shelah (a3) (a4)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.