A polynomial-time fragment of dominance constraints

被引：0

作者：

Koller, A ^{[1
]}

Mehlhorn, K ^{[1
]}

Niehren, J ^{[1
]}

机构：

[1] Univ Saarland, Max Planck Inst Comp Sci, Saarbrucken, Germany

来源：

38TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, PROCEEDINGS OF THE CONFERENCE | 2000年

关键词：

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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.

引用

页码：368 / 375

页数：8

共 50 条

[41] SOME REMARKS ON POLYNOMIAL-TIME ISOMORPHISMS
WANG, J
LECTURE NOTES IN COMPUTER SCIENCE, 1990, 468 : 144 - 153
[42] ON OBTAINING PERMUTATION DISTRIBUTIONS IN POLYNOMIAL-TIME
PAGANO, M
TRITCHLER, D
JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 1983, 78 (382) : 435 - 440
[43] THE POLYNOMIAL-TIME HIERARCHY AND SPARSE ORACLES
BALCAZAR, JL
BOOK, RV
SCHONING, U
JOURNAL OF THE ACM, 1986, 33 (03) : 603 - 617
[44] TUTTE POLYNOMIALS COMPUTABLE IN POLYNOMIAL-TIME
OXLEY, JG
WELSH, DJA
DISCRETE MATHEMATICS, 1992, 109 (1-3) : 185 - 192
[45] POLYNOMIAL-TIME VERSUS RECURSIVE MODELS
CENZER, D
REMMEL, J
ANNALS OF PURE AND APPLIED LOGIC, 1991, 54 (01) : 17 - 58
[46] A POLYNOMIAL-TIME CIRCLE PACKING ALGORITHM
MOHAR, B
DISCRETE MATHEMATICS, 1993, 117 (1-3) : 257 - 263
[47] A Polynomial-Time Attack on the BBCRS Scheme
Couvreur, Alain
Otmani, Ayoub
Tillich, Jean-Pierre
Gauthier-Umana, Valerie
PUBLIC-KEY CRYPTOGRAPHY - PKC 2015, 2015, 9020 : 175 - 193
[48] Genericity, randomness, and polynomial-time approximations
Wang, YG
SIAM JOURNAL ON COMPUTING, 1998, 28 (02) : 394 - 408
[49] Pooling Problems with Polynomial-Time Algorithms
Dag Haugland
Eligius M. T. Hendrix
Journal of Optimization Theory and Applications, 2016, 170 : 591 - 615
[50] Polynomial-time computability in analysis: a survey
Ko, Ker-, I
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2010, (24): : 3 - 3

← 1 2 3 4 5 →