See this document in CiteSeerX!

An Analog Algorithm for Satisfiability Problem (2002)  (Make Corrections)  
Yoichi Takenaka, Akihiro Hashimoto



  Home/Search   Context   Related

 
View or download:
uc.edu/Conferences/SAT200...takenaka.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  uc.edu/Conferences/...sat2002list (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: this paper, we propose a SATalHBGH2W foranal8 computers. Our al gorithm is characterized by its use of two substances. We use two substances and determine whether given SAT instance has asolGB62 or not by measuring amount of the two. One substance is used as base unit and another is used as a barometer ofunsatisfiabil2 y. If amount of thele2BB substance issmal8B2W96602 70 Tabl 1: Assignments and its number of 00 1 1 1 1 00 3 1 x 1 x 2 01 1 3 01 1 1 11 1 1 0 11 1 1 10 1 1 1 1 10 1 1 1 1 than... (Update)

Similar documents based on text:   More   All
0.3:   Performance Improvements of Mobile Data Protocol in Wire and.. - Park, Song, Cho (1999)   (Correct)
0.3:   A Multiple Alignment Algorithm for Metabolic Pathway.. - Tohsato, Matsuda.. (2000)   (Correct)
0.3:   Using CSP Look-Back Techniques to Solve Real-World SAT Instances - Bayardo, Schrag (1997)   (Correct)

BibTeX entry:   (Update)

@misc{ takenaka-analog,
  author = "Yoichi Takenaka and Akihiro Hashimoto",
  title = "An Analog Algorithm for Satisfiability Problem",
  url = "citeseer.ist.psu.edu/takenaka02analog.html" }
Citations (may not include all citations):
1   a guide to the theor of NP-completeness (context) - Garey, Johnson et al. - 1991
1   The complexity of theor em-pr oving pr3 ur es (context) - Cook - 1971
1   Sel658 Pushing the envelope (context) - Kautz

Documents on the same site (http://gauss.ececs.uc.edu/Conferences/SAT2002/sat2002list.html):   More
On Quantifier Shifting for Quantified Boolean Formulas - Egly, Tompits, Woltran (2002)   (Correct)
NAGSAT: A Randomized, Complete, Parallel Solver for 3-SAT - Forman, Segre (2002)   (Correct)
X3SAT is Decidable in Time - Porschen, Randerath, Speckenmeyer (2002)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC