A hierarchy of tractable subclasses for SAT and counting SAT problems
10.1109/SYNASC.2009.12
Saved in:
Main Authors: | Andrei, Ş., Grigoraş, G., Rinard, M., Chuan Yap, R.H. |
---|---|
Other Authors: | COMPUTER SCIENCE |
Format: | Conference or Workshop Item |
Published: |
2013
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/39934 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Tractable approximations to robust conic optimization problems
by: Bertsimas, D., et al.
Published: (2013) -
A Faster Exact Algorithm to Count X3SAT Solutions
by: Hoi, G, et al.
Published: (2023) -
What is an asset: Is a kegal definition tractable?
by: PANG, Yang Hoong, et al.
Published: (1998) -
Distributionally robust optimization and its tractable approximations
by: Goh, J., et al.
Published: (2013) -
On solving the partial MAX-SAT problem
by: Fu, Z., et al.
Published: (2013)