A Subrecursive Refinement of the Fundamental Theorem of Algebra

A Subrecursive Refinement of the Fundamental Theorem of Algebra. Peshev, P. & Skordev, D. In Beckmann, A., Berger, U., Löwe, B., & Tucker, J., editors, Logical Approaches to Computational Barriers, volume 3988, pages 435–444, Berlin, 2006. Springer. Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006

Paper bibtex

@INPROCEEDINGS{PS06,
  author = {Peshev, Peter and Skordev, Dimiter},
  title = {A Subrecursive Refinement of the Fundamental Theorem of Algebra},
  booktitle = {Logical Approaches to Computational Barriers},
  year = {2006},
  editor = {Beckmann, A. and Berger, U. and L{\"o}we, B. and Tucker, J.V.},
  volume = {3988},
  series = LNCS,
  pages = {435--444},
  address = {Berlin},
  publisher = {Springer},
  note = {Second Conference on Computability in Europe, CiE 2006, Swansea,
	UK, June 30-July 5, 2006},
  keywords = {bib,cca},
  url = {http://dx.doi.org/10.1007/11780342_45}
}

Downloads: 0

{"_id":"fgfFogaecGDtqhz3Z","bibbaseid":"peshev-skordev-asubrecursiverefinementofthefundamentaltheoremofalgebra-2006","authorIDs":[],"author_short":["Peshev, P.","Skordev, D."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"propositions":[],"lastnames":["Peshev"],"firstnames":["Peter"],"suffixes":[]},{"propositions":[],"lastnames":["Skordev"],"firstnames":["Dimiter"],"suffixes":[]}],"title":"A Subrecursive Refinement of the Fundamental Theorem of Algebra","booktitle":"Logical Approaches to Computational Barriers","year":"2006","editor":[{"propositions":[],"lastnames":["Beckmann"],"firstnames":["A."],"suffixes":[]},{"propositions":[],"lastnames":["Berger"],"firstnames":["U."],"suffixes":[]},{"propositions":[],"lastnames":["Löwe"],"firstnames":["B."],"suffixes":[]},{"propositions":[],"lastnames":["Tucker"],"firstnames":["J.V."],"suffixes":[]}],"volume":"3988","pages":"435–444","address":"Berlin","publisher":"Springer","note":"Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006","keywords":"bib,cca","url":"http://dx.doi.org/10.1007/11780342_45","bibtex":"@INPROCEEDINGS{PS06,\r\n author = {Peshev, Peter and Skordev, Dimiter},\r\n title = {A Subrecursive Refinement of the Fundamental Theorem of Algebra},\r\n booktitle = {Logical Approaches to Computational Barriers},\r\n year = {2006},\r\n editor = {Beckmann, A. and Berger, U. and L{\\\"o}we, B. and Tucker, J.V.},\r\n volume = {3988},\r\n series = LNCS,\r\n pages = {435--444},\r\n address = {Berlin},\r\n publisher = {Springer},\r\n note = {Second Conference on Computability in Europe, CiE 2006, Swansea,\r\n\tUK, June 30-July 5, 2006},\r\n keywords = {bib,cca},\r\n url = {http://dx.doi.org/10.1007/11780342_45}\r\n}\r\n\r\n","author_short":["Peshev, P.","Skordev, D."],"editor_short":["Beckmann, A.","Berger, U.","Löwe, B.","Tucker, J."],"key":"PS06","id":"PS06","bibbaseid":"peshev-skordev-asubrecursiverefinementofthefundamentaltheoremofalgebra-2006","role":"author","urls":{"Paper":"http://dx.doi.org/10.1007/11780342_45"},"keyword":["bib","cca"],"downloads":0},"bibtype":"inproceedings","biburl":"http://cca-net.de/publications/lit.bib","creationDate":"2019-09-10T10:17:54.006Z","downloads":0,"keywords":["bib","cca"],"search_terms":["subrecursive","refinement","fundamental","theorem","algebra","peshev","skordev"],"title":"A Subrecursive Refinement of the Fundamental Theorem of Algebra","year":2006,"dataSources":["t7rKiAbxugj4Agz8M"]}