ALOGTIME and a conjecture of S. A. Cook (Q1353980): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Weak Second‐Order Arithmetic and Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial size proofs of the propositional pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A taxonomy of problems with fast parallel algorithms / 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: Expressibility and Parallel Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3829548 / 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: Q3325707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniform circuit complexity / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01531023 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3157713018 / rank
 
Normal rank

Latest revision as of 10:37, 30 July 2024

scientific article
Language Label Description Also known as
English
ALOGTIME and a conjecture of S. A. Cook
scientific article

    Statements

    ALOGTIME and a conjecture of S. A. Cook (English)
    0 references
    0 references
    0 references
    13 May 1997
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    propositional calculus
    0 references
    NC
    0 references
    resolution proof
    0 references
    parallel complexity classes
    0 references
    free variable equational logic
    0 references
    Frege proofs
    0 references
    0 references
    0 references