✦ LIBER ✦

Unification Algorithms Cannot Be Combined in Polynomial Time

✍ Scribed by Miki Hermann; Phokion G. Kolaitis

Book ID: 112252488
Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 236 KB
Volume: 162
Category: Article
ISSN: 0890-5401
DOI: 10.1006/inco.1999.2855

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Polynomial-time dual algorithms in linea

Polynomial-time dual algorithms in linear programming

✍ Yu. E. Nesterov 📂 Article 📅 1989 🏛 Springer US 🌐 English ⚖ 919 KB

Polynomial-Time Algorithms for Minimum-T

Polynomial-Time Algorithms for Minimum-Time Broadcast in Trees

✍ Cohen; Fraigniaud; Mitjana 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 250 KB

Dynamic-Programming Algorithms for Recog

Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time

✍ Saxe, James B. 📂 Article 📅 1980 🏛 Society for Industrial and Applied Mathematics ⚖ 970 KB

Quantum Circuits That Can Be Simulated C

Quantum Circuits That Can Be Simulated Classically in Polynomial Time

✍ Valiant, Leslie G. 📂 Article 📅 2002 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 295 KB

A Polynomial Time Algorithm for Diophant

A Polynomial Time Algorithm for Diophantine Equations in One Variable

✍ F CUCKER; P KOIRAN; S SMALE 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 195 KB

We exhibit an algorithm computing, for a polynomial f ∈ Z [t], the set of its integer roots. The running time of the algorithm is polynomial in the size of the sparse encoding of f .

A Combinatorial Algorithm Minimizing Sub

A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time

✍ Alexander Schrijver 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 108 KB

We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear programming method. No bound on the complexity of the values of f is needed to be known a priori. The number of oracle c