Sparse selfreducible sets and nonuniform lower bounds (Q1755786): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Q343857 / rank
Normal rank
 
Property / author
 
Property / author: Nikolai K. Vereshchagin / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2809558868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-linear truth-table reductions to \(p\)-selective sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258566 / 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: Approximable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(p\)-selective self-reducible sets: a new characterization of P / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On self-reducibility and weak P-selectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Circuit-Size Complexity and the Low Hierarchy in NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-reducible sets of small density / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating classes in the exponential-time hierarchy from classes in PH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Membership Comparable Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analogues of semirecursive sets and effective reducibilities to the study of NP complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandomness for approximate counting and sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relativized circuit complexity / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:47, 17 July 2024

scientific article
Language Label Description Also known as
English
Sparse selfreducible sets and nonuniform lower bounds
scientific article

    Statements

    Sparse selfreducible sets and nonuniform lower bounds (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 January 2019
    0 references
    computational complexity
    0 references
    sparseness
    0 references
    selfreducibility
    0 references

    Identifiers