Sciweavers

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

10

ACL
2000

favoriteEmaildiscussreport

58views Computational Linguistics» more ACL 2000»

A Polynomial-Time Fragment of Dominance Constraints

13 years 6 months ago

A Polynomial-Time Fragment of Dominance Constraints

Download acl.ldc.upenn.edu

Dominance constraints are logical descriptions of trees that are widely used in computational linguistics. Their general satisfiability problem is known to be NP-complete. Here we identify the natural fragment of normal dominance constraints and show that its satisfiability problem is in deterministic polynomial time.

Alexander Koller, Kurt Mehlhorn, Joachim Niehren

Real-time Traffic

ACL 2000 | ACL 2007 | Dominance Constraints | General Satisfiability Problem | Satisfiability Problem |

claim paper

Related Content

» An exact algorithm for minimum CDS with shortest path constraint in wireless networks

» Polynomialtime subgraph enumeration for automated instruction set extension

» Allocation of periodic task modules with precedence and deadline constraints in distribute...

» TreeWidth for First Order Formulae

» Global Detection of Salient Convex Boundaries

» Generalized hypertree decompositions nphardness and tractable variants

» Contrasting Views of Complexity and Their Implications For NetworkCentric Infrastructures

Post Info
More Details (n/a)

Added	01 Nov 2010
Updated	01 Nov 2010
Type	Conference
Year	2000
Where	ACL
Authors	Alexander Koller, Kurt Mehlhorn, Joachim Niehren

Comments (0)