Length of prime implicants and number of solutions of random CNF formulae
type: Item
instance of: scholarly article
title: Length of prime implicants and number of solutions of random CNF formulae
zbMATH Open document ID: 0913.68069
DOI: 10.1016/S0304-3975(95)00184-0
published in: Theoretical Computer Science
publication date: 1999-04-28T00:00:00Z
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 1281070
zbMATH Keywords: satisfiability
zbMATH Keywords: prime implicants
zbMATH Keywords: number of solutions
zbMATH Keywords: Davis and Putnam
author: Yacine Boufkhad
author: Olivier Dubois
MaRDI profile type: Publication
cites work: Q4228436
cites work: A Computing Procedure for Quantification Theory
cites work: Q5687266
cites work: A General Upper Bound for the Satisfiability Threshold of Randomr-SAT Formulae
cites work: Sharp thresholds of graph properties, and the $k$-sat problem
cites work: A threshold for unsatisfiability
cites work: On some generalized farlie-gumbel-morgenstern distributions-II regression, correlation and further generalizations
cites work: Q3915689
cites work: A machine program for theorem-proving
cites work: Q4856179
cites work: The Problem of Simplifying Truth Functions
cites work: A Way to Simplify Truth Functions
cites work: On Cores and Prime Implicants of Truth Functions
cites work: Asymptotic Estimates of Stirling Numbers
description: scientific article; zbMATH DE number 1281070