On sparseness and Turing reducibility over the reals (Q4916198): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import recommendations run Q6767936
 
(5 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57733262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281491 / rank
 
Normal rank
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: There are No Sparse NP<sub><i>w</i></sub>-Hard Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separation of complexity classes in Koiran's weak model / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(p\)-adic and real subanalytic sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse NP-complete problems over the reals with addition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754200 / 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: 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: Geometric categories and o-minimal structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem of the complement and some new o-minimal structures / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s1571-0661(04)80537-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2081323336 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/entcs/Cucker02 / rank
 
Normal rank
Property / Recommended article
 
Property / Recommended article: Reducibilities on tally and sparse sets / rank
 
Normal rank
Property / Recommended article: Reducibilities on tally and sparse sets / qualifier
 
Similarity Score: 0.8889893
Amount0.8889893
Unit1
Property / Recommended article: Reducibilities on tally and sparse sets / qualifier
 
Property / Recommended article
 
Property / Recommended article: On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets / rank
 
Normal rank
Property / Recommended article: On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets / qualifier
 
Similarity Score: 0.880208
Amount0.880208
Unit1
Property / Recommended article: On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets / qualifier
 
Property / Recommended article
 
Property / Recommended article: Reducibility of computable metrics on the real line / rank
 
Normal rank
Property / Recommended article: Reducibility of computable metrics on the real line / qualifier
 
Similarity Score: 0.8733367
Amount0.8733367
Unit1
Property / Recommended article: Reducibility of computable metrics on the real line / qualifier
 
Property / Recommended article
 
Property / Recommended article: On sparseness, reducibilities, and complexity / rank
 
Normal rank
Property / Recommended article: On sparseness, reducibilities, and complexity / qualifier
 
Similarity Score: 0.8725102
Amount0.8725102
Unit1
Property / Recommended article: On sparseness, reducibilities, and complexity / qualifier
 
Property / Recommended article
 
Property / Recommended article: On reductions of NP sets to sparse sets / rank
 
Normal rank
Property / Recommended article: On reductions of NP sets to sparse sets / qualifier
 
Similarity Score: 0.87225413
Amount0.87225413
Unit1
Property / Recommended article: On reductions of NP sets to sparse sets / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q3809788 / rank
 
Normal rank
Property / Recommended article: Q3809788 / qualifier
 
Similarity Score: 0.8703201
Amount0.8703201
Unit1
Property / Recommended article: Q3809788 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Reductions, completeness and the hardness of approximability / rank
 
Normal rank
Property / Recommended article: Reductions, completeness and the hardness of approximability / qualifier
 
Similarity Score: 0.8657535
Amount0.8657535
Unit1
Property / Recommended article: Reductions, completeness and the hardness of approximability / qualifier
 
Property / Recommended article
 
Property / Recommended article: On the Turing Degrees of Weakly Computable Real Numbers / rank
 
Normal rank
Property / Recommended article: On the Turing Degrees of Weakly Computable Real Numbers / qualifier
 
Similarity Score: 0.8654232
Amount0.8654232
Unit1
Property / Recommended article: On the Turing Degrees of Weakly Computable Real Numbers / qualifier
 
Property / Recommended article
 
Property / Recommended article: Sparse sets and collapse of complexity classes / rank
 
Normal rank
Property / Recommended article: Sparse sets and collapse of complexity classes / qualifier
 
Similarity Score: 0.86541295
Amount0.86541295
Unit1
Property / Recommended article: Sparse sets and collapse of complexity classes / qualifier
 
Property / Recommended article
 
Property / Recommended article: Computable Reducibility for Cantor Space / rank
 
Normal rank
Property / Recommended article: Computable Reducibility for Cantor Space / qualifier
 
Similarity Score: 0.8635052
Amount0.8635052
Unit1
Property / Recommended article: Computable Reducibility for Cantor Space / qualifier
 

Latest revision as of 17:51, 4 April 2025

scientific article; zbMATH DE number 6156006
Language Label Description Also known as
English
On sparseness and Turing reducibility over the reals
scientific article; zbMATH DE number 6156006

    Statements

    On sparseness and Turing reducibility over the reals (English)
    0 references
    0 references
    19 April 2013
    0 references
    real computation
    0 references
    Turing reducibility
    0 references
    sparseness
    0 references

    Identifiers