Back to Results
First PageMeta Content
Constraint programming / Boolean algebra / Automated theorem proving / Logic in computer science / NP-complete problems / Boolean satisfiability problem / DPLL algorithm / Satz / Solver / Theoretical computer science / Applied mathematics / Mathematics


Annales Mathematicae et Informaticae[removed]pp. 9–21 http://ami.ektf.hu Cube-and-Conquer approach for SAT solving on grids∗
Add to Reading List

Document Date: 2013-12-20 13:48:28

Open Document

File Size: 737,34 KB

Share Result on Facebook

Company

IBM / /

/

Facility

Vienna University / /

IndustryTerm

performance computing / early solution / search node / search tree / volunteer grid computing / case splitting tool / distributed computing environment / computational grid infrastructure / linear time algorithm / search space / open source grid infrastructure / /

Organization

Eszterházy Károly College / Austro-Hungarian Action Foundation / Johannes Kepler University / Vienna University of Technology / /

ProvinceOrState

iLingeling / /

Technology

DPLL algorithm / linear time algorithm / end procedure Algorithm / load balancing / API / 17 Algorithm / grids Algorithm / /

URL

http /

SocialTag