scientific article; zbMATH DE number 69384

MaRDI QIDQ4014855zbMATH OpenFDO

Authors Erol Gelenbe

Publication date 7 December 1992

zbMATH Keywords

Boolean functionssatisfability problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• Probabilistic approach to the satisfiability problem
• A probabilistic study on the satisfiability problem
• Probabilistic Reasoning by SAT Solvers
• Generalized probabilistic satisfiability
• Theory and Applications of Satisfiability Testing
• A Stochastic Limit Approach to the SAT Problem
• Probabilistic satisfiability
• Probabilistic satisfiability
• Probabilistic estimates for the generalized maximum satisfiability problem

Cited in

(15)

• Multiple class \(G\)-networks with list-oriented deletions
• scientific article; zbMATH DE number 3954272 (Why is no real title available?)
• scientific article; zbMATH DE number 1630006 (Why is no real title available?)
• scientific article; zbMATH DE number 1784977 (Why is no real title available?)
• \(G\)-networks: A versatile approach for work removal in queueing networks
• A probabilistic study on the satisfiability problem
• Stochastic Boolean satisfiability
• An artificial neural network satisfiability tester
• Probabilistic approach to the satisfiability problem
• Artificial Intelligence and Soft Computing - ICAISC 2004
• Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem
• A probabilistic algorithm for \(k\)-SAT based on limited local search and restart
• NEURAL NETWORKS AND LINEAR PROGRAMMING FOR THE SATISFIABILITY PROBLEM
• scientific article; zbMATH DE number 5139164 (Why is no real title available?)
• Probabilistic estimates for the generalized maximum satisfiability problem

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 Q4014855)