Effectiveness of Hindman's Theorem for Bounded Sums.
D. Dzhafarov, C. Jr., R. Solomon, and L. Westrick. Computability and Complexity, volume 10010 of Lecture Notes in Computer Science, page 134-142. Springer, (2017)
Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 conf/birthday/DzhafarovJSW17
%A Dzhafarov, Damir D.
%A Jr., Carl G. Jockusch
%A Solomon, Reed
%A Westrick, Linda Brown
%B Computability and Complexity
%D 2017
%E Day, Adam R.
%E Fellows, Michael R.
%E Greenberg, Noam
%E Khoussainov, Bakhadyr
%E Melnikov, Alexander G.
%E Rosamond, Frances A.
%I Springer
%K dblp
%P 134-142
%T Effectiveness of Hindman's Theorem for Bounded Sums.
%U http://dblp.uni-trier.de/db/conf/birthday/downey2017.html#DzhafarovJSW17
%V 10010
%@ 978-3-319-50061-4
@inproceedings{conf/birthday/DzhafarovJSW17,
added-at = {2017-01-06T00:00:00.000+0100},
author = {Dzhafarov, Damir D. and Jr., Carl G. Jockusch and Solomon, Reed and Westrick, Linda Brown},
biburl = {https://www.bibsonomy.org/bibtex/2ce72366031f983b8070f78a31b9b69d9/dblp},
booktitle = {Computability and Complexity},
crossref = {conf/birthday/2017downey},
editor = {Day, Adam R. and Fellows, Michael R. and Greenberg, Noam and Khoussainov, Bakhadyr and Melnikov, Alexander G. and Rosamond, Frances A.},
ee = {http://dx.doi.org/10.1007/978-3-319-50062-1_11},
interhash = {5e6024caa8d3cd04bd8bc5671c22ab3b},
intrahash = {ce72366031f983b8070f78a31b9b69d9},
isbn = {978-3-319-50061-4},
keywords = {dblp},
pages = {134-142},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2017-01-10T11:35:55.000+0100},
title = {Effectiveness of Hindman's Theorem for Bounded Sums.},
url = {http://dblp.uni-trier.de/db/conf/birthday/downey2017.html#DzhafarovJSW17},
volume = 10010,
year = 2017
}