𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Polynomial Time Introreducibility

✍ Scribed by Cintioli; Silvestri

Publisher
Springer
Year
2003
Tongue
English
Weight
133 KB
Volume
36
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Choiceless polynomial time
Choiceless polynomial time
✍ Andreas Blass; Yuri Gurevich; Saharon Shelah πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 268 KB

Turing machines deΓΏne polynomial time (PTime) on strings but cannot deal with structures like graphs directly, and there is no known, easily computable string encoding of isomorphism classes of structures. Is there a computation model whose machines do not distinguish between isomorphic structures a

The Analytic Polynomial-Time Hierarchy
The Analytic Polynomial-Time Hierarchy
✍ Herbert Baier; Klaus W. Wagner πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 863 KB

Motivated by results on interactive proof systems we investigate an 3-V-hierarchy over P using word quantifiers as well as two types of set quantifiers. This hierarchy, which extends the (arithmetic) polynomial-time hierarchy, is called the analytic polynomial-time hierarchy. It is shown that every

Polynomial Time Uniform Word Problems
Polynomial Time Uniform Word Problems
✍ Stanley Burris πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 587 KB

## Abstract We have two polynomial time results for the uniform word problem for a quasivariety __Q__: (a) The uniform word problem for __Q__ can be solved in polynomial time iff one can find a certain congruence on finite partial algebras in polynomial time. (b) Let __Q__\* be the relational class