An oracle separating conjectures about incompleteness in the finite domain (Q2290649): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2020.01.003 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Nondeterministic functions and the existence of optimal proof systems / 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: NP-Completeness, Proof Systems, and Disjoint NP-Pairs. / 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: Complexity Measures for Public-Key Cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint NP-Pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity classes without machines: on complete languages for UP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472459 / 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: Propositional proof systems, the consistency of first order theories and the complexity of computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On total functions, existence theorems and computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4885911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Foundations of Mathematics and Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: INCOMPLETENESS IN THE FINITE DOMAIN / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2020.01.003 / rank
 
Normal rank

Latest revision as of 20:40, 17 December 2024

scientific article
Language Label Description Also known as
English
An oracle separating conjectures about incompleteness in the finite domain
scientific article

    Statements

    An oracle separating conjectures about incompleteness in the finite domain (English)
    0 references
    0 references
    29 January 2020
    0 references
    disjoint NP-pairs
    0 references
    proof systems
    0 references
    P-optimal
    0 references
    UP
    0 references
    oracle
    0 references

    Identifiers