CONTEXTIAL INSERTION FOR #3SAT

被引：0
|
作者：
Subramaniam, G. [1 ]
Siromoney, Rani [2 ,3 ]
机构：
[1] Birla Inst Technol & Sci, Ranchi, Bihar, India
[2] Chennai Math Inst, Chennai, Tamil Nadu, India
[3] Madras Christian Coll, Madras, Tamil Nadu, India
来源：
BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE | 2006年 / 88期
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Even though SAT has been solved in a linear number of bio-steps, each step takes a long time mainly due to the number of gel separations and ligations. In this paper, we try to reduce the time taken by each bio-step. First, we formalize the concept of non-consistent assignments with a simple deterministic finite automaton. Then we use contextual insertion to capture the transitions of the DFA. Finally, we describe the procedure which can be used to solve both 3SAT and #3SAT with only a constant number of gel separations and no ligations at all.
引用
收藏
页码：174 / 181
页数：8
相关论文
共 50 条
  • [21] A new reduction from 3SAT to n-partite graphs
    Hulme, Daniel J.
    Hirsch, Robin
    Buxton, Bernard F.
    Lotto, R. Beau
    2007 IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTATIONAL INTELLIGENCE, VOLS 1 AND 2, 2007, : 235 - +
  • [22] 3SAT on an all-to-all-connected CMOS Ising solver chip
    Cilasun, Huesrev
    Zeng, Ziqing
    Ramprasath, S.
    Kumar, Abhimanyu
    Lo, Hao
    Cho, William
    Moy, William
    Kim, Chris H.
    Karpuzcu, Ulya R.
    Sapatnekar, Sachin S.
    SCIENTIFIC REPORTS, 2024, 14 (01):
  • [23] Polynomial-Time Reductions from 3SAT to Kurotto and Juosan Puzzles
    Iwamoto, Chuzo
    Ibusuki, Tatsuaki
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2020, E103D (03) : 500 - 505
  • [24] SATQUBOLIB: A Python']Python Framework for Creating and Benchmarking (Max-)3SAT QUBOs
    Zielinski, Sebastian
    Benkard, Magdalena
    Nusslein, Jonas
    Linnhoff-Popien, Claudia
    Feld, Sebastian
    INNOVATIONS FOR COMMUNITY SERVICES, I4CS 2024, 2024, 2109 : 47 - 65
  • [25] Amplitude amplification-inspired QAOA: improving the success probability for solving 3SAT
    Mandl, Alexander
    Barzen, Johanna
    Bechtold, Marvin
    Leymann, Frank
    Wild, Karoline
    QUANTUM SCIENCE AND TECHNOLOGY, 2024, 9 (01)
  • [26] A Polynomial-Time Reduction from the 3SAT Problem to the Generalized String Puzzle Problem
    Iwamoto, Chuzo
    Sasaki, Kento
    Morita, Kenichi
    ALGORITHMS, 2012, 5 (02) : 261 - 271
  • [27] 一个高效的3SAT到Hamilton环转化方法
    杜立智
    张晓龙
    南京理工大学学报, 2013, 37 (04) : 506 - 510
  • [28] DIFFERENT ADIABATIC QUANTUM OPTIMIZATION ALGORITHMS FOR THE NP-COMPLETE EXACT COVER AND 3SAT PROBLEMS
    Choi, Vicky
    QUANTUM INFORMATION & COMPUTATION, 2011, 11 (7-8) : 638 - 648
  • [29] An interview with Wolfgang Bergmann and Jo Schmidt on 3sat television's filming of productions at the Berliner Theatertreffen
    Wille, F
    Bergmann, W
    Schmidt, J
    THEATER HEUTE, 1997, (05): : 67 - 68
  • [30] 德国3Sat电视台专题报道中德科技学院
    青岛科技大学学报(自然科学版), 2007, (06) : 497 - 497
12345