Two systems for proving tautologies, based on the split method-Reference-Cited by-同舟云学术

Two systems for proving tautologies, based on the split method

Published:1983 Issue:3 Volume:22 Page:1293-1305
ISSN:0090-4104
Container-title:Journal of Soviet Mathematics
language:en
Short-container-title:J Math Sci

Author:

Dantsin E. Ya.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,General Mathematics,Statistics and Probability,Applied Mathematics,General Mathematics,Statistics and Probability

Link

http://link.springer.com/content/pdf/10.1007/BF01084392.pdf

Reference6 articles.

1. A. Aho, J. Hopcroft and J. Ullman, The Design and Analysis of Computer Algorithms (1976).

2. E. Ya. Dantsin, ?Parameters defining recognition time for tautologies by the split method,? Semiotika Inf. (Moskva),12, 8?17 (1979).

3. Z. Galil, ?On enumeration procedures for theorem proving and for integer programming,? in: Automat Languages and Programming, 335?381 (1976).

4. S. Yu. Maslov, ?The theory of deduction search and some of its applications,? Kibernetika, No. 4 (1975).

5. G. S. Tseitin, ?The complexity of deduction in a propositional calculus,? Zap. Nauchn. Sem. Leningr. Otd. Mat. Inst. Akad. Nauk SSSR,8, 234?259 (1968).

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An improved upper bound for SAT;Theoretical Computer Science;2021-10

2. A Randomized Algorithm for 3-SAT;Mathematics in Computer Science;2010-04-16

3. Improved Randomized Algorithms for 3-SAT;Algorithms and Computation;2010

4. 3-coloring in time;Journal of Algorithms;2005-02

5. Worst-case study of local search for MAX-k-SAT;Discrete Applied Mathematics;2003-08