Nondeterministic polynomial-time computations and models of arithmetic (Q3476273)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4145333
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nondeterministic polynomial-time computations and models of arithmetic |
scientific article; zbMATH DE number 4145333 |
Statements
Nondeterministic polynomial-time computations and models of arithmetic (English)
0 references
1990
0 references
computation by abstract devices
0 references
complexity classes
0 references
nondeterministic Turing machine
0 references
NP-complete
0 references
nonstandard models of arithmetic
0 references
diophantine sets
0 references
0.9209778
0 references
0.89658326
0 references
0.88709223
0 references
0.88535035
0 references
