Approximating Succinct MaxSat.
We study the approximability of the version of MAXSAT where exponentially large instances are succinctly represented using circuits. First, we prove that the NP-hardness for approximating MAXSAT can be lifted to a corresponding NEXP-hardness for approximating circuit-succinct MAXSAT for some constan...
Main Authors: | Schallhart, C, Trevisan, L |
---|---|
格式: | Journal article |
语言: | English |
出版: |
2005
|
相似书籍
-
Clausal Forms in MaxSAT and MinSAT
由: Chu Min Li, et al.
出版: (2022-11-01) -
Decoding quantum color codes with MaxSAT
由: Lucas Berent, et al.
出版: (2024-10-01) -
Dynamic Initial Weight Assignment for MaxSAT
由: Abdelraouf Ishtaiwi, et al.
出版: (2021-03-01) -
Negative Learning Ant Colony Optimization for MaxSAT
由: Teddy Nurcahyadi, et al.
出版: (2022-08-01) -
The Impact of Implied Constraints on MaxSAT B2B Instances
由: Miquel Bofill, et al.
出版: (2022-08-01)