Anuj Dawar  Home/Search
Context Related
| upenn.edu/pub/dawar/thesis.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: upenn.edu (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The computational complexity of a problem is usually defined in terms of the resources required on some machine model of computation. An alternative view looks at the complexity of describing the problem (seen as a collection of relational structures) in a logic, measuring logical resources such as the number of variables, quantifiers, operators, etc. A close correspondence has been observed between these two, with many natural logics corresponding exactly to independently defined complexity... (Update)
Context of citations to this paper: More
...of IFP and PFP on arbitrary nite structures, not necessarily being ordered. This result is due to Abiteboul and Vianu [AV91b] See also [Daw93]. Theorem. Ptime = Pspace if, and only if, IFP = PFP. There are also xed point logics capturing the complexity classes NP and Exptime,...
Cited by: More
On Finite Rigid Structures - Yuri Gurevich Saharon (1996) (Correct)
Metafinite Model Theory - Erich Gradel Yuri (1995) (Correct)
Ptime Canonization for Two Variables with Counting - Otto Mathematische Grundlagen (1995) (Correct)
Similar documents (at the sentence level):
19.6%: Infinitary Logic and Inductive Definability over Finite.. - Dawar, Lindell (1995) (Correct)
Active bibliography (related documents): More All
0.9: Logic and Complexity without Order - Dawar (1997) (Correct)
0.6: Finite Models And Finitely Many Variables - Dawar (1999) (Correct)
0.6: The Expressive Power of Finitely Many Generalized Quantifiers - Dawar, Hella (1995) (Correct)
Similar documents based on text: More All
0.3: Mirage: A Model for Latency in Communication - Touch (1992) (Correct)
0.3: Object/Relational Query Optimization with Chase and Backchase - Popa (2000) (Correct)
0.2: Linear Time Computable Problems and First-Order Descriptions - Seese (1996) (Correct)
Related documents from co-citation: More All
24: The complexity of relational query languages (context) - Vardi - 1982
21: Relational queries computable in polynomial time - Immerman - 1986
21: On Moschovakis closure ordinals (context) - Barwise - 1977
BibTeX entry: (Update)
A. Dawar. Feasible Computation through Model Theory. PhD thesis, University of Pennsylvania, Philadelphia, 1993. http://citeseer.ist.psu.edu/dawar93feasible.html More
@phdthesis{ dawar93feasible,
author = "Dawar, A.",
title = "Feasible Computation through Model Theory",
year = "1993",
url = "citeseer.ist.psu.edu/dawar93feasible.html" }
Citations (may not include all citations):1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
379 The complexity of relational query languages (context) - Vardi - 1982
370 A Mathematical Introduction to Logic (context) - Enderton - 1972
283 Random Graphs (context) - Bollobas - 1985
245 Relational queries computable in polynomial time - Immerman - 1986
211 Languages that capture complexity classes - Immerman - 1987
210 Generalized first-order spectra and polynomial-time recogniz.. (context) - Fagin - 1974
198 Structure and complexity of relational queries - Chandra, Harel - 1982
149 Logic and the challenge of computer science (context) - Gurevich - 1988
129 Theoretical Computer Science (context) - Stockmeyer, hierarchy - 1977
124 Datalog extensions for database queries and updates (context) - Abiteboul, Vianu - 1991
120 Elementary Induction on Abstract Structures (context) - Moschovakis - 1974
115 An application of games to the completeness problem for form.. (context) - Ehrenfeucht - 1961
114 Generic computation and its complexity (context) - Abiteboul, Vianu - 1991
98 An optimal lower bound on the number of variables for graph .. - Cai, Furer et al. - 1989
95 Fixed-point extensions of firstorder logic (context) - Gurevich, Shelah - 1986
85 Upper and lower bounds for first-order expressibility (context) - Immerman - 1982
78 On Moschovakis closure ordinals (context) - Barwise - 1977
66 Describing graphs: A first-order approach to graph canonizat.. - Immerman, Lander - 1990
63 Toward logic tailored for computational complexity - Gurevich - 1984
61 Descriptive and computational complexity - Immerman - 1989
57 the computational complexity of algorithms (context) - Hartmanis, Stearns - 1965
43 Computing with first-order logic - Abiteboul, Vianu - 1992
42 infinitary logic in finite-model theory (context) - Kolaitis, Vardi et al. - 1992
41 The monadic theory of order (context) - Shelah - 1975
40 Definability with bounded number of bound variables - Immerman, Kozen - 1989
36 and computational complexity (context) - Abiteboul, Vardi et al. - 1992
33 Information and Computation (context) - Kolaitis, Vardi et al. - 1992
32 First order predicate logic with generalized quantifiers (context) - Lindstrom - 1966
30 Extended logics: The general framework (context) - Ebbinghaus - 1985
29 Deux ou trois choses que je sais de L n (context) - Poizat - 1982
25 Modest theory of short chains (context) - Gurevich - 1979
21 Logical hierarchies in PTIME (context) - Hella - 1992
20 Definability hierarchies of generalized quantifiers (context) - Hella - 1989
15 An analysis of fixed-point queries on binary trees (context) - Lindell - 1991
14 Inductive definitions over finite structures (context) - Leivant - 1990
13 Using the Hamiltonian path operator to capture np (context) - Stewart - 1992
11 Logic with denumerably long formulas and finite strings of q.. (context) - Scott - 1965
9 Back and forth through infinitary logic (context) - Barwise - 1973
9 Axiomatizable classes of finite models and definability of l.. (context) - Stolboushkin - 1992
8 A decision procedure for the weak second order theory of lin.. (context) - Lauchli - 1968
8 and immunity of complexity classes (context) - Hartmanis, Li et al. - 1986
7 Finite quantifier equivalence (context) - Karp - 1965
7 Annals of Pure and Applied Logic (context) - McColm, arithmetic - 1990
6 and normal forms (context) - Blass, Gurevich et al. - 1984
6 emes de relations. Publications Scientifiques de l (context) - Fraiss'e, classifications - 1954
5 Free Algebras in Von Neumann-Bernays-Godel Set Theory and Po.. (context) - Rubin - 1975
4 Personal Communication (context) - Gurevich - 1992
4 Zeitschrift fur Mathematische Logik und Grundlagen der Mathe.. (context) - Lov'asz, G'acs et al. - 1977
4 The Logical Complexity of Queries on Unordered Graphs (context) - Lindell - 1987
3 to appear in Information and Computation (context) - Immerman, Landau et al. - 1993
3 Personal Communication (context) - Hella - 1993
2 Personal Communication (context) - Cosmadakis - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cis.upenn.edu.html): More
User-Controlled Physics-Based Animation for Articulated.. - Kokkevis, Metaxas, Badler (1996) (Correct)
Semistructured Data - Buneman (1997) (Correct)
A Hybrid Approach to Formal Verification Applied to an ATM.. - Clarke, Lee (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC