MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Polynomially orderable classes of structures

Download:
Download as a PDF | Download as a PS
by Jan Van Den Bussche, Dirk Van Gucht
http://alpha.luc.ac.be/~lucp1080/poly_ord.ps.gz
Add To MetaCart

Abstract:

It is well known in descriptive computational complexity theory that fixpoint logic captures polynomial time on the class of ordered finite structures. The same is true on any class of structures on which a polynomial number of orders are definable in fixpoint logic. We call a class having this property polynomially orderable. We investigate this property, and give examples of polynomially orderable classes of graphs and groups. 1 Introduction and

Citations

1035 Foundations of Databases – Abiteboul, Hull, et al. - 1995
466 The complexity of relational query languages – Vardi - 1982
392 Finite model theory – Ebbinghaus, Flum - 1999
272 Relational queries computable in polynomial time – Immerman - 1986
247 Structure and complexity of relational queries – Chandra, Harel - 1982
200 Universality of data retrieval languages – Aho, Ullman - 1979
154 Logic and the challenge of computer science – Gurevich - 1987
143 Elementary Induction on Abstract Structures – Moschovakis - 1974
92 Isomorphism of graphs of bounded valence can be tested in polynomial time – Luks - 1980
82 Fixed-point extensions of first-order logic – Gurevich, Shelah - 1986
58 Descriptive and computational complexity – Immerman - 1989
40 Feasible Computation through Model Theory – Dawar - 1993
12 How to Define a Linear Order on Finite Models – Hella, Kolaitis, et al. - 1994
9 An analysis of fixed-point queries on binary trees – Lindell - 1991
9 Axiomatizable classes of finite models and definability of linear order – Stolboushkin - 1992
7 On finite rigid structures – Gurevich, Shelah - 1996
4 When do fixed point logics capture complexity classes – Seth - 1995
View or Download | Add to My Collection | Correct Errors