Nondeterministic functions and the existence of optimal proof systems (Q837177): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2009.05.021 / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q57950025 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1996110613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monotone circuit complexity of Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Deduction Theorem for Strong Propositional Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of representable disjoint \textsf{NP}-pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tuples of disjoint \(\mathsf{NP}\)-sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the correspondence between arithmetic theories and propositional proof systems – a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-automatizability of bounded-depth Frege proofs / 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: On Interpolation and Automatization for Frege Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative Relativizations of Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Does the polynomial hierarchy collapse if onto functions are invertible? / 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: Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure in Approximation Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverting onto functions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oracles That Compute Values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separability and one-way functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reductions between disjoint NP-pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint NP-Pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical disjoint NP-pairs of propositional proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Informational Content of Canonical Disjoint NP-Pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Measures for Public-Key Cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NONDETERMINISTICALLY SELECTIVE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some natural complete operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal proof systems imply complete sets for promise classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: UNIFORM CHARACTERIZATIONS OF COMPLEXITY CLASSES OF FUNCTIONS / 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: Propositional proof systems, the consistency of first order theories and the complexity of computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some consequences of cryptographical conjectures for \(S_2^1\) and EF / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of optimization problems / 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: Q4251070 / 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: A hierarchy based on output multiplicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / 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: Q4215637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On reducibility and symmetry of disjoint NP pairs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3758729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an optimal quantified propositional proof system nal proof system and a complete language for NP ∩ co-NP for NP ∩ co-NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263798 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an optimal propositional proof system and the structure of easy subsets of TAUT. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A taxonomy of complexity classes of functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative complexity of checking and evaluating / rank
 
Normal rank
Property / cites work
 
Property / cites work: #P-COMPLETENESS VIA MANY-ONE REDUCTIONS / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2009.05.021 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:45, 10 December 2024

scientific article
Language Label Description Also known as
English
Nondeterministic functions and the existence of optimal proof systems
scientific article

    Statements

    Nondeterministic functions and the existence of optimal proof systems (English)
    0 references
    0 references
    0 references
    0 references
    10 September 2009
    0 references
    optimal proof systems
    0 references
    nondeterministic functions
    0 references
    disjoint NP-pairs
    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

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references