On P Versus NP for Parameter-Free Programs Over Algebraic Structures (Q2707072)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On P Versus NP for Parameter-Free Programs Over Algebraic Structures |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On P Versus NP for Parameter-Free Programs Over Algebraic Structures |
scientific article |
Statements
28 March 2001
0 references
programs over algebraic structures
0 references
complexity classes
0 references
computation model
0 references
time complexity of computations over arbitrary first-order structures
0 references
parameter-free computations
0 references
P versus NP
0 references
quantifier elimination
0 references
computation tree analysis
0 references
structural complexity theory
0 references
On P Versus NP for Parameter-Free Programs Over Algebraic Structures (English)
0 references
