Short resolution proofs for a sequence of tricky formulas (Q1924995): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s002360050044 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2126362918 / 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: 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
links / mardi / namelinks / mardi / name
 

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

    Identifiers