z-logo
open-access-imgOpen Access
Improving WalkSAT for Random k-Satisfiability Problem with k > 3
Author(s) -
Shaowei Cai,
Kaile Su,
Chuan Luo
Publication year - 2013
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v27i1.8554
Subject(s) - satisfiability , computer science , boolean satisfiability problem , random function , robustness (evolution) , algorithm , maximum satisfiability problem , boolean function , theoretical computer science , random field , mathematics , biochemistry , statistics , chemistry , gene

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom