Maria Serna, Luca Trevisan, and Fatos Xhafa. The (parallel) approximability of non-boolean satisfiability problems and restricted integer programming. In Proc. 15th Symp. on Theoretical Aspects of Computer Science, 1998. To appear. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Integer Programming as a Framework for Optimization and.. - Barland, Kolaitis (1996) (6 citations) (Correct)
.... we know that Max FSBLIP(poly) contains Max Capacity Representatives, which, as mentioned earlier, is not logapproximable modulo reasonable complexity assumptions [Bel93] Under similar assumptions, it has recently been shown that Max Capacity Representatives(log) is not constant approximable [STX98] Proposition 4.13: If g is a constant function, then Max FSBLIP(g(n) Max FSBLIP(2) Proof: We use the standard trick of replacing a variable x with its bit representation of 0 1 variables x 1 ; x log(g) with their coefficients being appropriate powers of two. This increases the ....
....same greedy algorithm. One of the main open problems in this work is to establish that the classes Max FSBLIP(2) Max FSBLIP(log) and Max FSBLIP(poly(n) form a proper hierarchy. This is true modulo appropriate complexity theory assumptions both pairs of adjacent classes have been separated [STX98, Bel93, respectively] A strength of the logic based syntactic classes is that some techniques are known for showing nonmembership in the class (without reference to open complexitytheory problems) we know of no such techniques for these Integer Programmingbased syntactic classes. In the same ....
Maria Serna, Luca Trevisan, and Fatos Xhafa. The (parallel) approximability of non-boolean satisfiability problems and restricted integer programming. In Proc. 15th Symp. on Theoretical Aspects of Computer Science, 1998. To appear.
Lower Bounds for non-Boolean Constraint Satisfaction Programs - Engebretsen (2000) (1 citation) (Correct)
....group G. As a consequence, we prove that the Max k CSP G problem cannot be approximated within G k O( # k) # , for any constant # 0, unless P = NP. This lower bound matches well with the best known upper bound, G k 1 , following from a linear relaxation combined with randomized rounding [9, 6]. As a technical tool, Samorodnitsky and Trevisan [5] use a composition lemma by Sudan and Trevisan [7] In this paper, we extend this lemma to the non Boolean setting. By using the lemma as an integrated part of the construction rather than a black box, we are also able to improve some of the ....
Maria Serna, Luca Trevisan, and Fatos Xhafa. The (parallel) approximability of non-Boolean satisfiability problems and restricted integer programming. In Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science, volume 1373 of Lecture Notes in Computer Science, pages 488--498. SpringerVerlag, Berlin, February 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC