On the computational structure of the connected components of a hard problem (Q1607000): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPLEXITY AND REAL COMPUTATION: A MANIFESTO / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4372496 / 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: Complexity and dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542570 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On NP-completeness for linear machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sparse sets in NP-P / 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: Bounds for the computational power and learning complexity of analog neural nets / 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 / cites work
 
Property / cites work: On the complexity of quadratic programming in real number models of computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Relations Between Discrete and Continuous Complexity Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on real structural complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4841154 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A low and a high hierarchy within NP / rank
 
Normal rank

Latest revision as of 12:04, 4 June 2024

scientific article
Language Label Description Also known as
English
On the computational structure of the connected components of a hard problem
scientific article

    Statements

    On the computational structure of the connected components of a hard problem (English)
    0 references
    0 references
    0 references
    25 July 2002
    0 references
    0 references
    sparse sets
    0 references
    Turing complexity theory
    0 references