𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Completeness of polynomials in an LP space

✍ Scribed by S. O. Sinanyan

Book ID
118290844
Publisher
SP MAIK Nauka/Interperiodica
Year
1978
Tongue
English
Weight
441 KB
Volume
24
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Algebraic polynomial bases of space LP
Algebraic polynomial bases of space LP
✍ Z. A. Chanturiya πŸ“‚ Article πŸ“… 1978 πŸ› SP MAIK Nauka/Interperiodica 🌐 English βš– 285 KB
Infiniteness of proof(Ξ±) is polynomial-s
Infiniteness of proof(Ξ±) is polynomial-space complete
✍ Sachio Hirokawa πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 546 KB

It is shown that the infiniteness problem of proof (a) is polynomial-space complete. The set proof (~) is the set of closed I-terms in p-normal form which has a as their types. The set is identical to the set of normal form proofs of a in the natural deduction system for implicational fragment of in

A Combinatorial Problem Which Is Complet
A Combinatorial Problem Which Is Complete in Polynomial Space
✍ Even, S.; Tarjan, R. E. πŸ“‚ Article πŸ“… 1976 πŸ› Association for Computing Machinery 🌐 English βš– 537 KB

This paper considers a generalization, called the Shannon switching game on vertices, of a familiar board game called Hex. It is shown that determining who wins such a game if each player plays perfectly is very hard; in fact, if this game problem is solvable in polynomial time, then any problem sol