scientific article

zbMATH Open0794.68068MaRDI QIDQ4014855

Erol Gelenbe

Publication date: 7 December 1992

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

zbMATH Keywords

Boolean functionssatisfability problem

Mathematics Subject Classification ID

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

Related Items (8)

A probabilistic algorithm for \(k\)-SAT based on limited local search and restart ⋮ Title not available (Why is that?) ⋮ A probabilistic study on the satisfiability problem ⋮ Title not available (Why is that?) ⋮ Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem ⋮ \(G\)-networks: A versatile approach for work removal in queueing networks ⋮ Multiple class \(G\)-networks with list-oriented deletions ⋮ Probabilistic approach to the satisfiability problem

Recommendations

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

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)