Separation of complexity classes in Koiran's weak model (Q1338212): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Created claim: DBLP publication ID (P1635): journals/tcs/CuckerSS94, #quickstatements; #temporary_batch_1731505720702
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Felipe Cucker / rank
 
Normal rank
Property / author
 
Property / author: Stephen Smale / 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/0304-3975(94)00069-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2030220007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3692867 / 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: Q3770650 / 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 the Complexity of Quantifier Elimination: the Structural Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: On digital nondeterminism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real quantifier elimination is doubly exponential / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonuniform proof systems: A new framework to describe nonuniform and probabilistic complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing machines that take advice / 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 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 computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Presburger arithmetic with fixed quantifier dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/tcs/CuckerSS94 / rank
 
Normal rank

Latest revision as of 15:02, 13 November 2024

scientific article
Language Label Description Also known as
English
Separation of complexity classes in Koiran's weak model
scientific article

    Statements

    Identifiers