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 条
  • [1] On strongly planar 3SAT
    Wu, Lidong
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 32 (01) : 293 - 298
  • [2] Plasmids to solve #3SAT
    Siromoney, R
    Das, B
    ASPECTS OF MOLECULAR COMPUTING: ESSAYS DEDICATED TO TOM HEAD ON THE OCCASION OF HIS 70TH BIRTHDAY, 2004, 2950 : 361 - 366
  • [3] On strongly planar 3SAT
    Lidong Wu
    Journal of Combinatorial Optimization, 2016, 32 : 293 - 298
  • [4] A second order parameter for 3SAT
    Sandholm, TW
    PROCEEDINGS OF THE THIRTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE, VOLS 1 AND 2, 1996, : 259 - 265
  • [5] Counting models for 2SAT and 3SAT formulae
    Dahllöf, V
    Jonsson, P
    Wahström, M
    THEORETICAL COMPUTER SCIENCE, 2005, 332 (1-3) : 265 - 291
  • [6] Visualizing the 3SAT to CLIQUE Reduction Process
    Marchetti, Kaden
    Bodily, Paul
    2022 INTERMOUNTAIN ENGINEERING, TECHNOLOGY AND COMPUTING (IETC), 2022,
  • [7] Hardness of Max 3SAT with no mixed clauses
    Guruswami, V
    Khot, S
    TWENTIETH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2005, : 154 - 162
  • [8] Secure set membership using 3SAT
    de Mare, Michael
    Wright, Rebecca N.
    INFORMATION AND COMMUNICATIONS SECURITY, PROCEEDINGS, 2006, 4307 : 452 - +
  • [9] AN EXACT TENSOR NETWORK FOR THE 3SAT PROBLEM
    Garcia-Saez, Artur
    Latorre, Jose I.
    QUANTUM INFORMATION & COMPUTATION, 2012, 12 (3-4) : 283 - 292
  • [10] Data visualization tools for 3SAT instances
    García-Ortegón, JM
    Torres-Jiménez, J
    ICCIMA 2001: FOURTH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND MULTIMEDIA APPLICATIONS, PROCEEDINGS, 2001, : 318 - +
12345