ALOGTIME and a conjecture of S. A. Cook
type: Item
instance of: scholarly article
title: ALOGTIME and a conjecture of S. A. Cook
zbMATH Open document ID: 0865.03029
DOI: 10.1007/BF01531023
author: Peter Clote
published in: Annals of Mathematics and Artificial Intelligence
publication date: 1997-05-13T00:00:00Z
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 03F20
Mathematics Subject Classification ID: 03B35
Mathematics Subject Classification ID: 03B05
zbMATH DE Number: 1005821
zbMATH Keywords: propositional calculus
zbMATH Keywords: NC
zbMATH Keywords: resolution proof
zbMATH Keywords: parallel complexity classes
zbMATH Keywords: free variable equational logic
zbMATH Keywords: Frege proofs
Wikidata QID: Q123220857
MaRDI profile type: Publication
cites work: Weak Second‐Order Arithmetic and Finite Automata
cites work: Polynomial size proofs of the propositional pigeonhole principle
cites work: Q4133141
cites work: A taxonomy of problems with fast parallel algorithms
cites work: The relative efficiency of propositional proof systems
cites work: Expressibility and Parallel Complexity
cites work: Q3829548
cites work: Propositional proof systems, the consistency of first order theories and the complexity of computations
cites work: Q3325707
cites work: On uniform circuit complexity
full work available at URL: https://doi.org/10.1007/bf01531023
OpenAlex ID: W3157713018
description: scientific article; zbMATH DE number 1005821