The P-DNP problem for infinite Abelian groups (Q5949384): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On digital nondeterminism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of String Functions Over Algebraic Structures Armin Hemmerling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a \(P \neq NP\) result for a restricted class of real machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4841154 / rank
 
Normal rank

Latest revision as of 21:26, 3 June 2024

scientific article; zbMATH DE number 1675703
Language Label Description Also known as
English
The P-DNP problem for infinite Abelian groups
scientific article; zbMATH DE number 1675703

    Statements