Some consequences of cryptographical conjectures for \(S_2^1\) and EF (Q1383164): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1006/inco.1997.2674 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2068363706 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q106785148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: RSA and Rabin Functions: Certain Parts are as Hard as the Whole / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for cutting planes proofs with small coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3794177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative efficiency of propositional proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fragments of Bounded Arithmetic and Bounded Query Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds to the size of constant-depth propositional proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolation by a Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4395611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional proof systems, the consistency of first order theories and the complexity of computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantified propositional calculi and fragments of bounded arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded arithmetic and the polynomial hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4744264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the complexity of Craig's interpolants in sentential logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tautologies with a unique Craig interpolant, uniform vs. nonuniform complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3689182 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provability of the pigeonhole principle and the existence of infinitely many primes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every Prime Has a Succinct Certificate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for resolution and cutting plane proofs and monotone computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unprovability of lower bounds on circuit size in certain fragments of bounded arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for obtaining digital signatures and public-key cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140644 / rank
 
Normal rank

Latest revision as of 12:01, 28 May 2024

scientific article
Language Label Description Also known as
English
Some consequences of cryptographical conjectures for \(S_2^1\) and EF
scientific article

    Statements

    Some consequences of cryptographical conjectures for \(S_2^1\) and EF (English)
    0 references
    0 references
    0 references
    4 May 1998
    0 references
    RSA cryptosystem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers