首页>
外国专利>
Sequential machine for solving boolean satisfiability (SAT) problems in linear time
Sequential machine for solving boolean satisfiability (SAT) problems in linear time
展开▼
机译:解决线性时间中布尔可满足性(SAT)问题的顺序机
展开▼
页面导航
摘要
著录项
相似文献
摘要
The invention is a sequential machine for solving boolean satisfiability (SAT) problems for functions of n variables and m clauses in linear time with complexity O(m), independent of the number of variables in the function. With current hardware technology, a value of n=32 variables can be achieved. The machine can serve as a basic building block to develop faster SAT solvers.
展开▼