On the reducibility of sets inside NP to sets with low information content (Q1765294): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jcss.2004.03.003 / rank
Normal rank
 
Property / author
 
Property / author: Ogihara, Mitsunori / rank
Normal rank
 
Property / author
 
Property / author: Ogihara, Mitsunori / 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/j.jcss.2004.03.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4240832909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on decision versus search for graph automorphism / 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: A very hard log-space counting class / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281491 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structural property of regular frequency computations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2742600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4259996 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The (Non)enumerability of the determinant and the rank / 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: Structure and importance of logspace-MOD class / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerative counting is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Division in logspace-uniform<i>NC</i><sup>1</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of promise problems with applications to public-key cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptocomplexity and NP-completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sparse sets in NP-P / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse sets in NP-P: EXPTIME versus NEXPTIME / rank
 
Normal rank
Property / cites work
 
Property / cites work: NONDETERMINISTICALLY SELECTIVE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Solutions Uniquely Collapses the Polynomial Hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2769034 / 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: Q4273947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relativization of questions about log space computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of polynomial time reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric space-bounded computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the graph isomorphism counting problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4808678 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Membership Comparable Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate formulas for some functions of prime numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the density of families of sets / 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: On membership comparable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On polynomial-time truth-table reducibility of intractable sets to P-selective sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP is as easy as detecting unique solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic and randomized bounded truth-table reductions of P, NL, and L to sparse sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JCSS.2004.03.003 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:38, 11 December 2024

scientific article
Language Label Description Also known as
English
On the reducibility of sets inside NP to sets with low information content
scientific article

    Statements

    On the reducibility of sets inside NP to sets with low information content (English)
    0 references
    0 references
    0 references
    23 February 2005
    0 references
    Computational complexity
    0 references
    Selectivity
    0 references
    Membership comparability
    0 references
    Self-reduction
    0 references
    Sets with low information content
    0 references
    Prover-verifier protocols
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers