<i>P</i> versus <i>NP</i> and computability theoretic constructions in complexity theory over algebraic structures (Q5313380)
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 2199913
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | <i>P</i> versus <i>NP</i> and computability theoretic constructions in complexity theory over algebraic structures |
scientific article; zbMATH DE number 2199913 |
Statements
<i>P</i> versus <i>NP</i> and computability theoretic constructions in complexity theory over algebraic structures (English)
0 references
29 August 2005
0 references
complexity classes
0 references
0.8034536242485046
0 references
0.7758438587188721
0 references
0.7689182162284851
0 references
0.7601616978645325
0 references
0.752761721611023
0 references
