Amanote Research
Register
Sign In
Complexity of Max-Sat Using Stochastic Algorithms
doi 10.1145/1389095.1389219
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 2008
Authors
Mohamed Qasem
Adam Prugel-Bennett
Publisher
ACM Press
Related search
Approximate Solution of Weighted MAX-SAT Problems Using GRASP
DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Parametric RBAC Maintenance via Max-Sat
Randomized Variants of Johnson's Algorithm for MAX SAT
MiniMaxSAT: An Efficient Weighted Max-Sat Solver
Journal of Artificial Intelligence Research
Artificial Intelligence
The Power of Semidefinite Programming Relaxations for MAX-SAT
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Reduced-Complexity Approx-Log-Map and Max-Log-Map Soft PSK/QAM Detection Algorithms
IEEE Transactions on Communications
Electronic Engineering
Electrical
A Max-Sat Solver With Lazy Data Structures
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Three “Quantum” Algorithms to Solve 3-Sat
Theoretical Computer Science
Computer Science
Theoretical Computer Science
Two‐stage Stochastic Minimum S − T Cut Problems: Formulations, Complexity and Decomposition Algorithms
Networks
Information Systems
Computer Networks
Hardware
Communications
Architecture
Software
