메뉴 건너뛰기




Volumn 37, Issue 3, 2003, Pages 285-305

On semidefinite programming relaxations of (2 + p)-SAT

Author keywords

Approximation algorithms; Randomized rounding; Satisfiability; Semidefinite programming

Indexed keywords


EID: 0037212943     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1021208315170     Document Type: Article
Times cited : (13)

References (23)
  • 2
    • 0013521904 scopus 로고
    • Geometry of spaces of constant curvature
    • ed. E.B. Vinberg, Encyclopedia of Mathematical Sciences, (Springer, Berlin)
    • D.V. Alekseevskij, E.B. Vinberg and A.S. Solodovnikov, Geometry of spaces of constant curvature, in: Geometry II, ed. E.B. Vinberg, Encyclopedia of Mathematical Sciences, Vol. 29 (Springer, Berlin, 1993).
    • (1993) Geometry II , vol.29
    • Alekseevskij, D.V.1    Vinberg, E.B.2    Solodovnikov, A.S.3
  • 4
    • 0039772219 scopus 로고    scopus 로고
    • Solving large-scale sparse semidefinite programs for combinatorial optimization
    • S.J. Benson, Y. Ye and X. Zhang, Solving large-scale sparse semidefinite programs for combinatorial optimization, SIAM Journal on Optimization 10 (2000) 443-461.
    • (2000) SIAM Journal on Optimization , vol.10 , pp. 443-461
    • Benson, S.J.1    Ye, Y.2    Zhang, X.3
  • 8
    • 0000921195 scopus 로고    scopus 로고
    • Initialization in semidefinite programming via a self-dual, skew-symmetric embedding
    • E. de Klerk, C. Roos and T. Terlaky, Initialization in semidefinite programming via a self-dual, skew-symmetric embedding, OR Letters 20 (1997) 213-221.
    • (1997) OR Letters , vol.20 , pp. 213-221
    • De Klerk, E.1    Roos, C.2    Terlaky, T.3
  • 9
    • 0001624064 scopus 로고    scopus 로고
    • Infeasible-start semidefinite programming algorithms via self-dual embeddings
    • eds. P.M. Pardalos and H. Wolkowicz, Fields Institute Communications Series, (American Mathematical Society)
    • E. de Klerk, C. Roos and T. Terlaky, Infeasible-start semidefinite programming algorithms via self-dual embeddings, in: Topics in Semidefinite and Interior-Point Methods, eds. P.M. Pardalos and H. Wolkowicz, Fields Institute Communications Series, Vol. 18 (American Mathematical Society, 1998) pp. 215-236.
    • (1998) Topics in Semidefinite and Interior-Point Methods , vol.18 , pp. 215-236
    • De Klerk, E.1    Roos, C.2    Terlaky, T.3
  • 10
    • 0344794583 scopus 로고    scopus 로고
    • Relaxations of the satisfiability problem using semidefinite programming
    • E. de Klerk, H. van Maaren and J.P. Warners, Relaxations of the satisfiability problem using semidefinite programming, Journal of Automated Reasoning 24 (2000) 37-65.
    • (2000) Journal of Automated Reasoning , vol.24 , pp. 37-65
    • De Klerk, E.1    Van Maaren, H.2    Warners, J.P.3
  • 11
    • 84893574327 scopus 로고
    • Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
    • M.X. Goemans and D.P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, Journal of the ACM 42(6) (1995) 1115-1145.
    • (1995) Journal of the ACM , vol.42 , Issue.6 , pp. 1115-1145
    • Goemans, M.X.1    Williamson, D.P.2
  • 12
    • 0000076101 scopus 로고
    • The intractability of resolution
    • A. Haken, The intractability of resolution, Theoretical Computer Science 39 (1985) 297-308.
    • (1985) Theoretical Computer Science , vol.39 , pp. 297-308
    • Haken, A.1
  • 13
    • 0013189831 scopus 로고    scopus 로고
    • Approximation algorithms for MAX 4-SAT and rounding procedures for semidefinite programs
    • E. Halperin and U. Zwick, Approximation algorithms for MAX 4-SAT and rounding procedures for semidefinite programs, Journal of Algorithms 40 (2001) 184-211.
    • (2001) Journal of Algorithms , vol.40 , pp. 184-211
    • Halperin, E.1    Zwick, U.2
  • 14
    • 0345878609 scopus 로고
    • On infinitesimal symmetrization and volume formula for spherical or hyperbolic tetrahedrons
    • Oxford
    • W.-Y. Hsiang, On infinitesimal symmetrization and volume formula for spherical or hyperbolic tetrahedrons, The Quarterly Journal of Mathematics. Oxford 39(2) (1988) pp. 463-468.
    • (1988) The Quarterly Journal of Mathematics , vol.39 , Issue.2 , pp. 463-468
    • Hsiang, W.-Y.1
  • 15
    • 0031331518 scopus 로고    scopus 로고
    • A 7/8-approximation algorithm for MAX 3SAT?
    • H. Karloff and U. Zwick, A 7/8-approximation algorithm for MAX 3SAT?, in: Proc. 38th FOCS (1997) 406-415.
    • (1997) Proc. 38th FOCS , pp. 406-415
    • Karloff, H.1    Zwick, U.2
  • 18
    • 0033536221 scopus 로고    scopus 로고
    • Determining computational complexity from characteristic 'phase transitions'
    • R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman and L. Troyansky, Determining computational complexity from characteristic 'phase transitions', Nature 400 (1999) 133-137.
    • (1999) Nature , vol.400 , pp. 133-137
    • Monasson, R.1    Zecchina, R.2    Kirkpatrick, S.3    Selman, B.4    Troyansky, L.5
  • 20
    • 0033296299 scopus 로고    scopus 로고
    • Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones
    • J.F. Sturm, Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones, Optimization Methods and Software 11-12 (1999) 625-653.
    • (1999) Optimization Methods and Software , vol.11-12 , pp. 625-653
    • Sturm, J.F.1
  • 21
    • 0041596789 scopus 로고    scopus 로고
    • Elliptic approximations of propositional formulae
    • H. Van Maaren, Elliptic approximations of propositional formulae, Discrete Applied Mathematics 96-97 (1999) 223-244.
    • (1999) Discrete Applied Mathematics , vol.96-97 , pp. 223-244
    • Van Maaren, H.1
  • 22
    • 0347685849 scopus 로고    scopus 로고
    • Recognition of tractable satisfiability problems through balanced polynomial representations
    • J.P. Warners and H. Van Maaren, Recognition of tractable satisfiability problems through balanced polynomial representations, Discrete Applied Mathematics 99 (2000) 229-244.
    • (2000) Discrete Applied Mathematics , vol.99 , pp. 229-244
    • Warners, J.P.1    Van Maaren, H.2
  • 23
    • 0032631766 scopus 로고    scopus 로고
    • Outward rotations: A new tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems
    • U. Zwick, Outward rotations: a new tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems, in: Proc. 31st STOC (1999) pp. 679-687.
    • (1999) Proc. 31st STOC , pp. 679-687
    • Zwick, U.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.