✦ LIBER ✦

MAX SAT approximation beyond the limits of polynomial-time approximation

✍ Scribed by Evgeny Dantsin; Michael Gavrilovich; Edward A. Hirsch; Boris Konev

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 119 KB
Volume: 113
Category: Article
ISSN: 0168-0072
DOI: 10.1016/s0168-0072(01)00052-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Polynomial time approximation of dense w

Polynomial time approximation of dense weighted instances of MAX-CUT

✍ W. Fernandez de la Vega; M. Karpinski 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 162 KB

On the efficiency of polynomial time app

On the efficiency of polynomial time approximation schemes

✍ Marco Cesati; Luca Trevisan 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 630 KB

A polynomial time approximation scheme (PTAS) for an optimization problem A is an algorithm that given in input an instance of A and E > 0 find;,; (1 + E)-approximate solution in time that is polynomial for each fixed E. Typical running times are no(+) or 2"' n. While algorithms of the former kind t

Local limiting behavior of the zeros of

Local limiting behavior of the zeros of approximating polynomials

✍ M. Simkani 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 377 KB

Spin-Phonon Interaction beyond the Limit

Spin-Phonon Interaction beyond the Limit of Spin-wave Approximation

✍ Nguyẽñ Ngoc Chân 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 220 KB

A polynomial time approximation scheme f

A polynomial time approximation scheme for the SONET ring loading problem

✍ Sanjeev Khanna 📂 Article 📅 2002 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 110 KB 👁 1 views

Low-order polynomial approximation of pr

Low-order polynomial approximation of propagators for the time-dependent Schrödinger equation

✍ Hillel Tal-Ezer; Ronnie Kosloff; Charles Cerjan 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 683 KB