scientific article; zbMATH DE number 1114010
From MaRDI portal
Publication:4375778
zbMATH Open0889.68072MaRDI QIDQ4375778FDOQ4375778
Authors: Ewald Speckenmeyer, Max Böhm, Peter Heusch 
Publication date: 2 June 1998
Title of this publication is not available (Why is that?)
Recommendations
- Length of prime implicants and number of solutions of random CNF formulae
- Why almost all satisfiable k-CNF formulas are easy
- On the concentration of the number of solutions of random satisfiability formulas
- scientific article; zbMATH DE number 1113997
- A short implicant of a CNF formula with many satisfying assignments
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4375778)
