Martin Grohe  Home/Search
Context
Related
| uic.edu/~grohe/pub/csl97.ps 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: uic.edu/~grohe/pub (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Let L k be the k-variable fragment of first-order logic, for some k 3. We prove that equivalence of finite structures in L k has no P-computable canonization function unless NP P=poly. The latter assumption is considered as highly unlikely; in particular it implies a collapse of the polynomial hierarchy. The question for such a canonization function came up in the context of the problem of whether there is a logic for P. Slight modifications of our result yield answers to questions... (Update)
Similar documents (at the sentence level):
69.9%: Canonization for ...-Equivalence is Hard - Grohe (Correct)
13.0%: Large Finite Structures with Few L k -Types - Grohe (1997) (Correct)
Active bibliography (related documents): More All
0.5: Finite Variable Logics In Descriptive Complexity Theory - Grohe (1998) (Correct)
0.5: Finite Models And Finitely Many Variables - Dawar (1999) (Correct)
0.3: Bounded Variable Logics: Two, Three, and More - Otto (1997) (Correct)
Similar documents based on text: More All
0.5: Fixed-Point Logics on Planar Graphs - Grohe (1998) (Correct)
0.4: Ptime Canonization for Two Variables with Counting - Otto (1995) (Correct)
0.3: Alogtime Algorithms for Tree Isomorphism, Comparison, and.. - Buss (Correct)
BibTeX entry: (Update)
@misc{ grohe-canonization,
author = "Martin Grohe",
title = "Canonization for ...-Equivalence is Hard",
url = "citeseer.ist.psu.edu/407443.html" }
Citations (may not include all citations):379 The complexity of relational query languages (context) - Vardi - 1982
245 Relational queries computable in polynomial time - Immerman - 1986
149 Logic and the challenge of computer science (context) - Gurevich - 1988
114 Generic computation and its complexity (context) - Abiteboul, Vianu - 1991 ACM DBLP
85 Upper and lower bounds for first-order expressibility (context) - Immerman - 1982
85 Turing machines that take advice (context) - Karp, Lipton - 1982
81 Mathematical Logic (context) - Ebbinghaus, Flum et al. - 1994
78 On Moschovakis closure ordinals (context) - Barwise - 1977
57 Infinitary logic and inductive definability over finite stru.. - Dawar, Lindell et al. - 1995
38 Computing solutions uniquely collapses the polynomial hierar.. - Hemaspaandra, Naik et al. - 1996
29 Deux ou trois choses que je sais de Ln (context) - Poizat - 1982
18 The expressive power of fixed-point logic with counting (context) - Otto - 1996 DBLP
16 volume 9 of Lecture Notes in Logic (context) - Otto, Logics - 1997
11 Large finite structures with few L k -types - Grohe - 1997
9 Ptime canonization for two variables with counting - Otto - 1995
8 Equivalence in finite-variable logics is complete for polyno.. - Grohe - 1996 ACM DBLP
7 fixed point logic and linear order (context) - Dawar, Lindell et al. - 1996
6 and normal forms (context) - Blass, Gurevich et al. - 1984
5 Capturing bisimulation-invariant Ptime (context) - Otto - 1997
Documents on the same site (http://www.math.uic.edu/~grohe/pub.html): More
On Fixed-Point Logic With Counting - Flum, Grohe (1998) (Correct)
Definability and Descriptive Complexity on Databases of.. - Grohe, Mariño (1999) (Correct)
When is the Evaluation of Conjunctive Queries Tractable? - Grohe, Schwentick, Segoufin (2000) (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