scientific article; zbMATH DE number 69384

zbMATH Open0794.68068MaRDI QIDQ4014855FDOQ4014855

Authors: Erol Gelenbe 

Publication date: 7 December 1992

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

Boolean functionssatisfability problem

Mathematics Subject Classification ID

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

Cited In (15)

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

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)