Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Simplifying random satisfiability problems by removing frustrating interactions.

A Ramezanpour1, S Moghimi-Araghi

  • 1Institute for Advanced Studies in Basic Sciences, Zanjan 45195-1159, Iran. ramezanpour@iasbs.ac.ir

Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics
|December 13, 2006
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Statistical physics of principal minors: Cavity approach.

Physical review. E·2024
Same author

Statistical physics of loopy interactions: independent-loop approximation and beyond.

Physical review. E, Statistical, nonlinear, and soft matter physics·2015
Same author

Bethe free-energy approximations for disordered quantum systems.

Physical review. E, Statistical, nonlinear, and soft matter physics·2014
Same author

Computing loop corrections by message passing.

Physical review. E, Statistical, nonlinear, and soft matter physics·2013
Same author

Cavity approach to sphere packing in Hamming space.

Physical review. E, Statistical, nonlinear, and soft matter physics·2012
Same author

Inference and learning in sparse systems with multiple states.

Physical review. E, Statistical, nonlinear, and soft matter physics·2011
Same journal

Tension on dsDNA bound to ssDNA-RecA filaments may play an important role in driving efficient and accurate homology recognition and strand exchange.

Physical review. E, Statistical, nonlinear, and soft matter physics·2016
Same journal

Publisher's Note: Amplitude-phase coupling drives chimera states in globally coupled laser networks [Phys. Rev. E 91, 040901(R) (2015)].

Physical review. E, Statistical, nonlinear, and soft matter physics·2016
Same journal

Erratum: Shapes of sedimenting soft elastic capsules in a viscous fluid [Phys. Rev. E 92, 033003 (2015)].

Physical review. E, Statistical, nonlinear, and soft matter physics·2016
Same journal

Erratum: Attenuation of excitation decay rate due to collective effect [Phys. Rev. E 90, 022142 (2014)].

Physical review. E, Statistical, nonlinear, and soft matter physics·2016
Same journal

Publisher's Note: Role of connectivity and fluctuations in the nucleation of calcium waves in cardiac cells [Phys. Rev. E 92, 052715 (2015)].

Physical review. E, Statistical, nonlinear, and soft matter physics·2016
Same journal

Publisher's Note: Lattice Boltzmann approach for complex nonequilibrium flows [Phys. Rev. E 92, 043308 (2015)].

Physical review. E, Statistical, nonlinear, and soft matter physics·2016
See all related articles

This study introduces a modified survey propagation algorithm to simplify constraint satisfaction problems (CSPs) by removing interactions. The method generates smaller, satisfiable subproblems that directly yield solutions for the original CSP.

Area of Science:

  • Computer Science
  • Artificial Intelligence
  • Computational Complexity

Background:

  • Constraint Satisfaction Problems (CSPs) are fundamental in artificial intelligence and operations research.
  • Identifying minimal satisfiable subsets of constraints is crucial for problem simplification and efficient solving.
  • Existing methods for reducing constraint interactions may not guarantee satisfiability of the resulting subproblems.

Purpose of the Study:

  • To develop a method for removing interactions in CSPs while preserving satisfiability.
  • To investigate the application of a modified survey propagation algorithm for this purpose.
  • To construct minimal satisfiable subproblems from original CSPs.

Main Methods:

  • A modified survey propagation algorithm is employed to systematically remove interactions.

Related Experiment Videos

  • The algorithm incorporates a tuning parameter to control the number of removed interactions.
  • The study focuses on random K-satisfiability problems as a prototypical CSP.

    • Main Results:

    • The modified algorithm successfully generates satisfiable subproblems by reducing interactions.
    • Satisfiable subproblems range from the original problem to a minimal version with the fewest interactions.
    • The number of removed interactions is controllable via an algorithm parameter.

    Conclusions:

    • The proposed method effectively reduces the complexity of CSPs by generating smaller, equivalent satisfiable subproblems.
    • Minimal satisfiable subproblems derived from this approach can directly provide solutions to the original problem.
    • This technique offers a novel way to simplify and solve complex constraint satisfaction instances.