Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

69

CADE
1994
Springer

favoriteEmaildiscussreport

161views Logical Reasoning» more CADE 1994»

The Complexity of Counting Problems in Equational Matching

15 years 1 months ago

The Complexity of Counting Problems in Equational Matching

Download www.lix.polytechnique.fr

Miki Hermann, Phokion G. Kolaitis

Real-time Traffic

CADE 1994 | Logical Reasoning |

claim paper

Related Content

» ARTMAPIC and medical diagnosis Instance counting and inconsistent cases

» Isolation Matching and Counting

» The Polynomially Bounded Perfect Matching Problem Is in NC 2

» Pattern minimization problems over recursive data types

» Structural Analysis for DifferentialAlgebraic Systems Complexity Formulation and Facets

» Static Analysis using Parameterised Boolean Equation Systems

» Circular Stable Matching and 3way Kidney Transplant

» MatchSim a novel neighborbased similarity measure with maximum neighborhood matching

» ADtrees for Fast Counting and for Fast Learning of Association Rules

Post Info
More Details (n/a)

Added	09 Aug 2010
Updated	09 Aug 2010
Type	Conference
Year	1994
Where	CADE
Authors	Miki Hermann, Phokion G. Kolaitis

Comments (0)