Phokion G. Kolaitis, Thomas Rall  Home/Search
Context
Related
Links: ACM DBLP | ucsc.edu/~kolaitis/papers/83.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: ucsc.edu/~kolaitis/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: AC-matching is the problem of deciding whether an equation involving a binary associative-commutative function symbol, formal variables and formal constants has a solution. This problem is known to be strong NP-complete and to play a fundamental role in equational uni cation and automated deduction. We initiate an investigation of the existence of a phase transition in random AC-matching and its relationship to the performance of AC-matching solvers. We identify a parameter that captures ... (Update)
Active bibliography (related documents): More All
0.7: Complexity of Constraint Satisfaction Problems - Creignou, Hermann, Pichler (Correct)
0.5: Algorithmic and Complexity Issues Concerning.. - Dunne, Gibbons, Zito (Correct)
0.3: The Complexity of Contract Negotiation - Dunne, Wooldridge, Laurence (2003) (Correct)
Similar documents based on text: More All
0.4: The Saturate System - Ganzinger, Nieuwenhuis, Nivela (1998) (Correct)
0.2: 0-1 Laws for Fragments of Existential Second-Order Logic: A.. - Kolaitis, Vardi (Correct)
0.2: The Constrainedness of Search - Gent, Prosser, Walsh (1999) (Correct)
BibTeX entry: (Update)
@article{ kolaitis01search,
author = "Phokion G. Kolaitis and Thomas Raffill",
title = "In Search of a Phase Transition in the {AC}-Matching Problem",
journal = "Lecture Notes in Computer Science",
volume = "2239",
pages = "433--??",
year = "2001",
url = "citeseer.ist.psu.edu/488059.html" }
Citations (may not include all citations):114 The Theory of Partitions (context) - Andrews - 1984
62 Solution of the Robbins problem - McCune - 1997 ACM DBLP
59 Locating the phase transition in binary constraint satisfact.. - Smith, Dyer - 1996 DBLP
59 The constrainedness of search - Gent, MacIntyre et al. - 1996 DBLP
38 Unication theory - Baader, Siekmann - 1994
22 Planning as satisability (context) - Kautz, Selman - 1992
21 Maude as a formal meta-tool - Clavel, Duran et al. - 1999 ACM DBLP
20 Combinatorial Algorithms for Computers and Calculators (context) - Nijenhuis, Wilf - 1978
12 A compiler for rewrite programs in associativecommutative th.. - Moreau, Kirchner - 1998
12 Random 3-SAT: The plot thickens - Coarfa, Demopoulos et al. DBLP
12 Analysis of heuristics for number partitioning (context) - Gent, Walsh - 1998
10 Generating hard satisability problems (context) - Selman, Mitchell et al. - 1996
5 Critical behavior in the satisability of random boolean expr.. (context) - Kirkpatrick, Selman - 1994
5 Computational complexity of simultaneous elementary matching.. - Hermann, Kolaitis - 1999 ACM DBLP
3 Complexity-theoretic models of phase transitions in search p.. (context) - Dunne, Gibbons et al. - 2000 ACM DBLP
2 Improving the eciency of AC-matching and unication (context) - Eker - 1993
1 the search for a phase transition in AC-matching (context) - Rall - 2000
1 Personal communication (context) - Eker - 2000
Documents on the same site (http://www.cse.ucsc.edu/~kolaitis/): More
A Game-Theoretic Approach to Constraint Satisfaction - Kolaitis, Vardi (Correct)
Integer Programming as a Framework for Optimization and.. - Barland, Kolaitis (1996) (Correct)
Existential Second-Order Logic over Graphs: Charting.. - Gottlob, Kolaitis.. (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