Complexity and dimension (Q287068): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: On Isomorphisms and Density of $NP$ and Other Complete Sets / rank
 
Normal rank
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: Computing over the reals with addition and order: Higher complexity classes / 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: Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis / 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(97)00060-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1976838138 / rank
 
Normal rank

Latest revision as of 09:17, 30 July 2024

scientific article
Language Label Description Also known as
English
Complexity and dimension
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references