Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms and Computation

ISAAC 2015: Algorithms and Computation pp 664–676Cite as

Give Me Another One!

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9472))

Abstract

We investigate the complexity of an optimization problem in Boolean propositional logic related to information theory: Given a conjunctive formula over a set of relations, find a satisfying assignment with minimal Hamming distance to a given assignment that satisfies the formula (\(\mathsf {NearestOtherSolution}\), \(\mathsf {NOSol}\)).

We present a complete classification with respect to the relations admitted in the formula. We give polynomial-time algorithms for several classes of constraint languages. For all other cases we prove hardness or completeness regarding \(\mathrm {poly{\text {-}}APX}\), \(\mathrm {NPO}\), or equivalence to a well-known hard optimization problem.

Mike Behrisch and Gernot Salzer—Supported by Austrian Science Fund (FWF) grant I836-N23.

Miki Hermann—Supported by ANR-11-ISO2-003-01 Blanc International grant ALCOCLAN.

Stefan Mengel—Supported by QUALCOMM grant administered by École Polytechnique.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer-Verlag, Heidelberg (1999)

    Book  MATH  Google Scholar 

  2. Baker, K.A., Pixley, A.F.: Polynomial interpolation and the Chinese Remainder Theorem for algebraic systems. Math. Z. 143(2), 165–174 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  3. Behrisch, M., Hermann, M., Mengel, S., Salzer, G.: Minimal distance of propositional models (2015). CoRR abs/1502.06761

  4. Böhler, E., Creignou, N., Reith, S., Vollmer, H.: Playing with Boolean blocks, Part II: Constraint satisfaction problems. SIGACT News 35(1), 22–35 (2004)

    Article  Google Scholar 

  5. Böhler, E., Reith, S., Schnoor, H., Vollmer, H.: Bases for Boolean co-clones. Inf. Process. Lett. 96(2), 59–66 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  6. Creignou, N., Khanna, S., Sudan, M.: Complexity classifications of Boolean constraint satisfaction problems. In: SIAM Monographs on Discrete Mathematics and Applications, vol. 7. SIAM, Philadelphia (PA) (2001)

    Google Scholar 

  7. Creignou, N., Kolaitis, P.G., Zanuttini, B.: Structure identification of Boolean relations and plain bases for co-clones. J. Comput. Syst. Sci. 74(7), 1103–1115 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  8. Dumer, I., Micciancio, D., Sudan, M.: Hardness of approximating the minimum distance of a linear code. IEEE Trans. Inf. Theory 49(1), 22–37 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  9. Jeavons, P., Cohen, D., Gyssens, M.: Closure properties of constraints. J. Assoc. Comput. Mach. 44(4), 527–548 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  10. Juban, L.: Dichotomy theorem for the generalized unique satisfiability problem. In: Ciobanu, G., Păun, G. (eds.) FCT 1999. LNCS, vol. 1684, pp. 327–337. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  11. Khanna, S., Sudan, M., Trevisan, L., Williamson, D.P.: The approximability of constraint satisfaction problems. SIAM J. Comput. 30(6), 1863–1920 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  12. Lagerkvist, V.: Weak bases of boolean co-clones. Inf. Process. Lette. 114(9), 462–468 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  13. Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings 10th Symposium on Theory of Computing (STOC 1978), San Diego (California, USA), pp. 216–226 (1978)

    Google Scholar 

  14. Schnoor, H., Schnoor, I.: Partial polymorphisms and constraint satisfaction problems. In: Creignou, N., Kolaitis, P.G., Vollmer, H. (eds.) Complexity of Constraints. LNCS, vol. 5250, pp. 229–254. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technische Universität Wien, Vienna, Austria

    Mike Behrisch & Gernot Salzer

  2. LIX (UMR CNRS 7161), École Polytechnique, Palaiseau, France

    Miki Hermann & Stefan Mengel

Authors
  1. Mike Behrisch
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Miki Hermann
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Stefan Mengel
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Gernot Salzer
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Miki Hermann .

Editor information

Editors and Affiliations

  1. Masdar Institute, Abu Dhabi, United Arab Emirates

    Khaled Elbassioni

  2. Kyoto University, Kyoto, Japan

    Kazuhisa Makino

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Behrisch, M., Hermann, M., Mengel, S., Salzer, G. (2015). Give Me Another One!. In: Elbassioni, K., Makino, K. (eds) Algorithms and Computation. ISAAC 2015. Lecture Notes in Computer Science(), vol 9472. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48971-0_56

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-48971-0_56

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-48970-3

  • Online ISBN: 978-3-662-48971-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation