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 条

[31] Different adiabatic quantum optimization algorithms for the NP-complete exact cover and 3SAT problems
Choi, Vicky
Quantum Information and Computation, 2011, 11 (7-8): : 638 - 648
[32] Film essays by Heide-Marie Hartel (3rd Tele-Tanzjournal produced for 3sat, a network serving three countries)
Wesemann, A
BALLETT INTERNATIONAL-TANZ AKTUELL, 1998, (04): : 16 - 16
[33] Videodance in Germany - 'We don't watch the ratings" (An interview with Jo Schmidt, director of the Theatre-Programmes-Group for 3sat)
Wesemann, A
Schmidt, J
BALLETT INTERNATIONAL-TANZ AKTUELL, 1999, (06): : 38 - 39
[34] The Outdoorsman as sovereign Stylist Laudation to Clemens Meyer on the Occasion of the Literature Award of the City of Mainz, ZDF and 3sat in Mainz on 26th February 2016
Hametner, Michael
NEUE RUNDSCHAU, 2016, 127 (02): : 242 - 249
[35] Approximating MIN 2-SAT and MIN 3-SAT
Adi Avidor
Uri Zwick
Theory of Computing Systems, 2005, 38 : 329 - 345
[36] A SAT Approach to the Initial Mapping Problem in SWAP Gate Insertion for Commuting Gates
Matsuo, Atsushi
Yamashita, Shigeru
Egger, Daniel J.
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2023, E106A (11) : 1424 - 1431
[37] Approximating MIN 2-SAT and MIN 3-SAT
Avidor, A
Zwick, U
THEORY OF COMPUTING SYSTEMS, 2005, 38 (03) : 329 - 345
[38] The phase transition in 1-in-k SAT and NAE 3-SAT
Achlioptas, D
Chtcherba, A
Istrate, G
Moore, C
PROCEEDINGS OF THE TWELFTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2001, : 721 - 722
[39] 3-SAT EQUALS SAT FOR A CLASS OF NORMAL MODAL-LOGICS
DEMRI, S
INFORMATION PROCESSING LETTERS, 1995, 54 (05) : 281 - 287
[40] FPGA based accelerator for 3-SAT conflict analysis in SAT solvers
Safar, M
El-Kharashi, MW
Salem, A
CORRECT HARDWARE DESIGN AND VERIFICATION METHODS, PROCEEDINGS, 2005, 3725 : 384 - 387

← 1 2 3 4 5 →