MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in $\mathcal{O}(2^n)$ Time

Author(s):  
Evgeny Dantsin ◽  
Alexander Wolpert
Keyword(s):  
2017 ◽  
Vol 697 ◽  
pp. 58-68
Author(s):  
Takayuki Sakai ◽  
Kazuhisa Seto ◽  
Suguru Tamaki ◽  
Junichi Teruyama
Keyword(s):  

Author(s):  
Sylvain Darras ◽  
Gilles Dequen ◽  
Laure Devendeville ◽  
Chu-Min Li
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document