Computing in the fractal cloud: modular generic solvers for SAT and Q-SAT variants

Details Computing in the fractal cloud: modular generic solvers for SAT and Q-SAT variants Computing in the fractal cloud: modular generic solvers for SAT and Q-SAT variants

2011-05-17

arxiv.org/abs/1105.3454v1

Computer Science

Computational Complexity

Scientific paper

Abstract geometrical computation can solve hard combinatorial problems efficiently: we showed previously how Q-SAT can be solved in bounded space and time using instance-specific signal machines and fractal parallelization. In this article, we propose an approach for constructing a particular generic machine for the same task. This machine deploies the Map/Reduce paradigm over a fractal structure. Moreover our approach is modular: the machine is constructed by combining modules. In this manner, we can easily create generic machines for solving satifiability variants, such as SAT, #SAT, MAX-SAT.

Affiliated with

Also associated with

No associations

Rating

Computing in the fractal cloud: modular generic solvers for SAT and Q-SAT variants does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing in the fractal cloud: modular generic solvers for SAT and Q-SAT variants, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing in the fractal cloud: modular generic solvers for SAT and Q-SAT variants will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-727974