The polynomial bounds of proof complexity in Frege systems.
Aleksanyan, S.R.; Chubaryan, A.A.
Sibirskij Matematicheskij Zhurnal (2009)
- Volume: 50, Issue: 2, page 243-249
- ISSN: 0037-4474
Access Full Article
top
How to cite
topAleksanyan, S.R., and Chubaryan, A.A.. "The polynomial bounds of proof complexity in Frege systems.." Sibirskij Matematicheskij Zhurnal 50.2 (2009): 243-249. <http://eudml.org/doc/233542>.
@article{Aleksanyan2009,
author = {Aleksanyan, S.R., Chubaryan, A.A.},
journal = {Sibirskij Matematicheskij Zhurnal},
keywords = {proof complexity; Frege system; determinative conjunct; determinative set; hard-determinable formula},
language = {eng},
number = {2},
pages = {243-249},
publisher = {Sibirskoe Otdelenie Rossijskoj Akademii Nauk, Institut Matematiki Im. S. L. Soboleva SO RAN, Novosibirsk; Izdatel'stvo Instituta Matematiki},
title = {The polynomial bounds of proof complexity in Frege systems.},
url = {http://eudml.org/doc/233542},
volume = {50},
year = {2009},
}
TY - JOUR
AU - Aleksanyan, S.R.
AU - Chubaryan, A.A.
TI - The polynomial bounds of proof complexity in Frege systems.
JO - Sibirskij Matematicheskij Zhurnal
PY - 2009
PB - Sibirskoe Otdelenie Rossijskoj Akademii Nauk, Institut Matematiki Im. S. L. Soboleva SO RAN, Novosibirsk; Izdatel'stvo Instituta Matematiki
VL - 50
IS - 2
SP - 243
EP - 249
LA - eng
KW - proof complexity; Frege system; determinative conjunct; determinative set; hard-determinable formula
UR - http://eudml.org/doc/233542
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.