Geodesic
Quasipolynomial algorithms for the recognition of the satisfiability and derivability of propositional formulas
Doklady Akademii Nauk, Tome 290 (1986) no. 2, pp. 281-286 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{DAN_1986_290_2_a5,
     author = {M. I. Kanovich},
     title = {Quasipolynomial algorithms for the recognition of the satisfiability and derivability of propositional formulas},
     journal = {Doklady Akademii Nauk},
     pages = {281--286},
     year = {1986},
     volume = {290},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DAN_1986_290_2_a5/}
}
TY  - JOUR
AU  - M. I. Kanovich
TI  - Quasipolynomial algorithms for the recognition of the satisfiability and derivability of propositional formulas
JO  - Doklady Akademii Nauk
PY  - 1986
SP  - 281
EP  - 286
VL  - 290
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/DAN_1986_290_2_a5/
LA  - ru
ID  - DAN_1986_290_2_a5
ER  - 
%0 Journal Article
%A M. I. Kanovich
%T Quasipolynomial algorithms for the recognition of the satisfiability and derivability of propositional formulas
%J Doklady Akademii Nauk
%D 1986
%P 281-286
%V 290
%N 2
%U http://geodesic.mathdoc.fr/item/DAN_1986_290_2_a5/
%G ru
%F DAN_1986_290_2_a5
M. I. Kanovich. Quasipolynomial algorithms for the recognition of the satisfiability and derivability of propositional formulas. Doklady Akademii Nauk, Tome 290 (1986) no. 2, pp. 281-286. http://geodesic.mathdoc.fr/item/DAN_1986_290_2_a5/