Absorbing random walks and the NAE2SAT problem

DOI10.1080/00207161003631893MaRDI QIDQ5391499zbMATH OpenOpenAlexFDO

Authors Xiaofeng Gu, K. Subramani

Publication date 6 April 2011

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207161003631893

zbMATH Keywords

\(L\)-completeabsorbing random walkserror boundsNAE2SATverification

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Analysis of algorithms (68W40)

Recommendations

• Absorbing Random Walks and the NAE2SAT Problem
• CASCADING RANDOM WALKS
• Theory and Applications of Satisfiability Testing
• Random walks for selected Boolean implication and equivalence problems
• An exact and a randomized approach for the satisfiability problem

Cites work

• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• A probabilistic algorithm for k-SAT based on limited local search and restart
• A randomized linear-time algorithm to find minimum spanning trees
• A theory of the learnable
• An improved exponential-time algorithm for k -SAT
• CASCADING RANDOM WALKS
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1514781 (Why is no real title available?)
• scientific article; zbMATH DE number 1834642 (Why is no real title available?)
• On clausal equivalence and hull inclusion.
• STACS 2004
• Symmetric Complementation
• Symmetric space-bounded computation
• Theory and Applications of Satisfiability Testing
• Undirected ST-connectivity in log-space

Cited in

(5)

• Random walks for selected Boolean implication and equivalence problems
• NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability
• Absorbing Random Walks and the NAE2SAT Problem
• Walksat Stalls Well Below Satisfiability
• From MAXCUT to MAXNAESAT: elegant proofs and algorithmic advances

This page was built for publication: Absorbing random walks and the NAE2SAT problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5391499)