<i>P</i> versus <i>NP</i> and computability theoretic constructions in complexity theory over algebraic structures (Q5313380): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.2178/jsl/1080938824 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2102403322 / rank | |||
Normal rank | |||
Revision as of 03:03, 20 March 2024
scientific article; zbMATH DE number 2199913
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
