Review: Stephen Bellantoni, Stephen Cook, A New Recursion-Theoretic Characterization of the Polytime Functions; Arnold Beckmann, Andreas Weiermann, A Term Rewriting Characterization of the Polytime Functions and Related Complexity Classes
Niggl, Karl-Heinz
Bull. Symbolic Logic, Tome 6 (2000) no. 1, p. 351-353 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
Publié le : 2000-09-14
Classification:  
@article{1182353713,
     author = {Niggl, Karl-Heinz},
     title = {Review: Stephen Bellantoni, Stephen Cook, A New Recursion-Theoretic Characterization of the Polytime Functions; Arnold Beckmann, Andreas Weiermann, A Term Rewriting Characterization of the Polytime Functions and Related Complexity Classes},
     journal = {Bull. Symbolic Logic},
     volume = {6},
     number = {1},
     year = {2000},
     pages = { 351-353},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1182353713}
}

Niggl, Karl-Heinz. Review: Stephen Bellantoni, Stephen Cook, A New Recursion-Theoretic Characterization of the Polytime Functions; Arnold Beckmann, Andreas Weiermann, A Term Rewriting Characterization of the Polytime Functions and Related Complexity Classes. Bull. Symbolic Logic, Tome 6 (2000) no. 1, pp.  351-353. http://gdmltest.u-ga.fr/item/1182353713/