Resolution cannot polynomially simulate compressed-BFS (Q1776193): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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/s10472-004-8427-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2142612879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-level logic minimization: an overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: An experimental study of a compressed index / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution and binary decision diagrams cannot simulate each other polynomially / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Investigations on autark assignments / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP: a search algorithm for propositional satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4707784 / rank
 
Normal rank

Latest revision as of 11:37, 10 June 2024

scientific article
Language Label Description Also known as
English
Resolution cannot polynomially simulate compressed-BFS
scientific article

    Statements