The P\(\neq\) NP conjecture in the context of real and complex analysis (Q2489146): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Costa, José Félix / rank
Normal rank
 
Property / author
 
Property / author: Costa, José Félix / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jco.2005.07.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1972178849 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q122877523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machines, Computations, and Universality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous-time computation with restricted integration capabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iteration, inequalities, and differentiability in analog computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analog characterization of the Grzegorczyk hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analog computers and recursive functions over the reals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closed-form analytic maps in one and two dimensions can simulate universal Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursion theory on the reals and continuous-time computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\mu\)-recursion and infinite limits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real recursive functions and their hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machines, Computations, and Universality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability over Continuous Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical recursion theory. The theory of functions and sets of natural numbers. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical recursion theory. Vol. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fourier Analysis and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485693 / rank
 
Normal rank

Latest revision as of 14:06, 24 June 2024

scientific article
Language Label Description Also known as
English
The P\(\neq\) NP conjecture in the context of real and complex analysis
scientific article

    Statements

    The P\(\neq\) NP conjecture in the context of real and complex analysis (English)
    0 references
    0 references
    0 references
    16 May 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    Structural Complexity
    0 references
    Analog computation
    0 references
    Real recursive functions
    0 references
    0 references
    0 references