A combinatorial analysis for the critical clause tree
type: Item
instance of: scholarly article
title: A combinatorial analysis for the critical clause tree
zbMATH Open document ID: 1298.68291
author: Masaki Yamamoto
published in: Theory of Computing Systems
publication date: 2013-04-15T00:00:00Z
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 6153885
zbMATH Keywords: critical clause tree
zbMATH Keywords: \(k\)-SAT
MaRDI profile type: Publication
full work available at URL: s00224-012-9383-6
OpenAlex ID: W2032225349
cites work: 3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General
cites work: Catalan numbers, their generalization, and their uses
cites work: Q5501274
cites work: Solving satisfiability in less than \(2^ n\) steps
cites work: A full derandomization of schöning's k-SAT algorithm
cites work: Q4484662
DOI: 10.1007/S00224-012-9383-6
description: scientific article; zbMATH DE number 6153885