✦ LIBER ✦

On the power of parity polynomial time

✍ Scribed by Jin-yi Cai; Lane A. Hemachandra

Publisher: Springer
Year: 1990
Tongue: English
Weight: 794 KB
Volume: 23
Category: Article
ISSN: 1433-0490
DOI: 10.1007/bf02090768

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parity, circuits, and the polynomial-tim

Parity, circuits, and the polynomial-time hierarchy

✍ Merrick Furst; James B. Saxe; Michael Sipser 📂 Article 📅 1984 🏛 Springer 🌐 English ⚖ 880 KB

On the Correlation Between Parity and Mo

On the Correlation Between Parity and Modular Polynomials

✍ Anna Gál; Vladimir Trifonov 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 655 KB

The relative power of logspace and polyn

The relative power of logspace and polynomial time reductions

✍ Harry Buhrman; Edith Spaan; Leen Torenvliet 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 973 KB

Ex ante purchasing power parity: Some ev

Ex ante purchasing power parity: Some evidence based on vector autoregressions in the time domain

✍ M. P. Taylor 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 647 KB

The impact of purchasing power parity on

The impact of purchasing power parity on auto foreign trade

✍ Nurcan Metin; Sudi Apak 📂 Article 📅 2008 🏛 Springer Netherlands 🌐 English ⚖ 149 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