On a transfer theorem for the \(\text{P}\neq \text{NP}\) conjecture (Q5938580): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q122929201, #quickstatements; #temporary_batch_1707161894653
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1006/jcom.2000.0568 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2062998958 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for linear programming over the algebraic numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5563439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4717931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5521594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3033315 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On weak and weighted computations over the real closure of \(\mathbb{Q}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Real Turing Machines over Binary Inputs / 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: Two \(P\)-complete problems in the theory of the reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3943431 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / 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: A weak version of the Blum, Shub, and Smale model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3735800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4338894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3697106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3745276 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized Newton algorithms: Quadratic convergence, path-following and error analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: P\(\neq\)NP over the nonstandard reals implies P\(\neq\)NP over \(\mathbb{R}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3963114 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity over the \(p\)-adic numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3710637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4720691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical problems for the next century / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Bezout's Theorem I: Geometric Aspects / rank
 
Normal rank

Latest revision as of 18:36, 3 June 2024

scientific article; zbMATH DE number 1623064
Language Label Description Also known as
English
On a transfer theorem for the \(\text{P}\neq \text{NP}\) conjecture
scientific article; zbMATH DE number 1623064

    Statements

    On a transfer theorem for the \(\text{P}\neq \text{NP}\) conjecture (English)
    0 references
    12 December 2001
    0 references
    0 references
    NP-completeness
    0 references
    0 references
    0 references