Пожалуйста, войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)
Цитировать эту публикацию
%0 Journal Article
%1 journals/dam/BeameCMM05
%A Beame, Paul
%A Culberson, Joseph C.
%A Mitchell, David G.
%A Moore, Cristopher
%D 2005
%J Discret. Appl. Math.
%K dblp
%N 1-3
%P 25-47
%T The resolution complexity of random graph k-colorability.
%U http://dblp.uni-trier.de/db/journals/dam/dam153.html#BeameCMM05
%V 153
@article{journals/dam/BeameCMM05,
added-at = {2023-09-30T00:00:00.000+0200},
author = {Beame, Paul and Culberson, Joseph C. and Mitchell, David G. and Moore, Cristopher},
biburl = {https://www.bibsonomy.org/bibtex/23118a2258d49c19290c350e989631188/dblp},
ee = {https://doi.org/10.1016/j.dam.2005.05.004},
interhash = {aa825cce1ef22aeeeaf66001775631b2},
intrahash = {3118a2258d49c19290c350e989631188},
journal = {Discret. Appl. Math.},
keywords = {dblp},
number = {1-3},
pages = {25-47},
timestamp = {2024-04-09T01:28:47.000+0200},
title = {The resolution complexity of random graph k-colorability.},
url = {http://dblp.uni-trier.de/db/journals/dam/dam153.html#BeameCMM05},
volume = 153,
year = 2005
}