Short resolution proofs for a sequence of tricky formulas (Q1924995): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Polynomial size proofs of the propositional pigeonhole principle / 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: The intractability of resolution / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Über eine Art von Unvollständigkeit des Prädikatenkalküls der ersten Stufe / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Short proofs for tricky formulas / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5593816 / rank | |||
Normal rank |
Latest revision as of 14:25, 24 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Short resolution proofs for a sequence of tricky formulas |
scientific article |
Statements
Short resolution proofs for a sequence of tricky formulas (English)
0 references
27 October 1996
0 references
propositional formulas
0 references