Subrecursive complexity of identifying the Ramsey structure of posets. Fouché, W. L. In Logic and theory of algorithms, volume 5028, of Lecture Notes in Comput. Sci., pages 196–205. Springer, Berlin, 2008.
Subrecursive complexity of identifying the Ramsey structure of posets [link]Paper  doi  bibtex   
@INCOLLECTION{Fou08b,
  author = {Fouch{\'e}, Willem L.},
  title = {Subrecursive complexity of identifying the {R}amsey structure of
	posets},
  booktitle = {Logic and theory of algorithms},
  publisher = {Springer, Berlin},
  year = {2008},
  volume = {5028},
  series = {Lecture Notes in Comput. Sci.},
  pages = {196--205},
  doi = {10.1007/978-3-540-69407-6_23},
  keywords = {bib, cca},
  mrclass = {03D20 (05D10 06A07)},
  mrnumber = {2507018 (2010h:03059)},
  owner = {Vasco},
  timestamp = {2015.09.11},
  url = {http://dx.doi.org/10.1007/978-3-540-69407-6_23}
}
Downloads: 0