Theory and Applications of Satisfiability Testing
From MaRDI portal
Publication:5714749
DOI10.1007/11527695zbMATH Open1122.68602OpenAlexW2483910514MaRDI QIDQ5714749FDOQ5714749
Authors: Yannet Interian 
Publication date: 16 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11527695
Recommendations
- scientific article; zbMATH DE number 1258327
- scientific article; zbMATH DE number 1552232
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- scientific article; zbMATH DE number 1002206
- Approximation algorithms for the maximum satisfiability problem
- scientific article; zbMATH DE number 1302170
- On Some Recent Approximation Algorithms for MAX SAT
- An efficient approach to solving random \(k\)-SAT problems
- 1.0957-Approximation Algorithm for Random MAX-3SAT
Cited In (7)
- Bounds on greedy algorithms for MAX SAT
- Title not available (Why is that?)
- Witnesses for Answer Sets of Logic Programs
- Randomized greedy: new variants of some classic approximation algorithms
- Automata, Languages and Programming
- Size, cost and capacity: a semantic technique for hard random QBFs
- Backdoors to normality for disjunctive logic programs
This page was built for publication: Theory and Applications of Satisfiability Testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5714749)
