Geodesic
Cut for resolution method
Zapiski Nauchnykh Seminarov POMI, Studies in constructive mathematics and mathematical logic. Part XII, Tome 407 (2012), pp. 111-128

Voir la notice de l'article provenant de la source Math-Net.Ru

The aim of this talk is to extended Resolution Method by new rule, which simulate cut. We also will obtain upper and lower bounds on the complexity of refutation with and without this rule. 
@article{ZNSL_2012_407_a5,
     author = {V. P. Orevkov},
     title = {Cut for resolution method},
     journal = {Zapiski Nauchnykh Seminarov POMI},
     pages = {111--128},
     publisher = {mathdoc},
     volume = {407},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZNSL_2012_407_a5/}
}
TY  - JOUR
AU  - V. P. Orevkov
TI  - Cut for resolution method
JO  - Zapiski Nauchnykh Seminarov POMI
PY  - 2012
SP  - 111
EP  - 128
VL  - 407
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ZNSL_2012_407_a5/
LA  - ru
ID  - ZNSL_2012_407_a5
ER  - 
%0 Journal Article
%A V. P. Orevkov
%T Cut for resolution method
%J Zapiski Nauchnykh Seminarov POMI
%D 2012
%P 111-128
%V 407
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ZNSL_2012_407_a5/
%G ru
%F ZNSL_2012_407_a5
V. P. Orevkov. Cut for resolution method. Zapiski Nauchnykh Seminarov POMI, Studies in constructive mathematics and mathematical logic. Part XII, Tome 407 (2012), pp. 111-128. http://geodesic.mathdoc.fr/item/ZNSL_2012_407_a5/