On sparse hard sets for counting classes (Q1210293): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3765251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3692867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic polynomial time is closed under parity reductions / 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 Sets Truth-Table Reducible to Sparse Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of parity polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection Theorems for Systems of Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: PP is closed under truth-table reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Sparse Complete Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Probabilistic Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing conjunctive and disjunctive reducibilities by sparse sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of polynomial time reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: BPP and the polynomial hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: On gamma-reducibility versus polynomial time many-one reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong nondeterministic polynomial-time reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-reducible sets of small density / 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: Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4743737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic complexity classes and lowness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Results on Polynomial Time Truth-Table Reductions to Sparse Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of combinatorial problems with succinct input representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3826109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete sets and the polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some consequences of non-uniform conditions on uniform classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(93)90020-t / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1995286703 / rank
 
Normal rank

Latest revision as of 08:45, 30 July 2024

scientific article
Language Label Description Also known as
English
On sparse hard sets for counting classes
scientific article

    Statements

    On sparse hard sets for counting classes (English)
    0 references
    0 references
    0 references
    24 May 1993
    0 references
    structural complexity
    0 references
    counting classes
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers