<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 OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5570212 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A model-theoretic proof for <i>P ≠ NP</i> over all infinite abelian group / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On P Versus NP for Parameter-Free Programs Over Algebraic Structures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computing over the reals with addition and order / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computability Over Structures of Infinite Signature / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computability of String Functions Over Algebraic Structures Armin Hemmerling / rank | |||
Normal rank |
Latest revision as of 15:44, 10 June 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