Review: Neil Immerman, Upper and Lower Bounds for First Order Expressibility; Neil Immerman, Relational Queries Computable in Polynomial Time; Neil Immerman, Languages that Capture Complexity Classes
Buss, Samuel
J. Symbolic Logic, Tome 54 (1989) no. 1, p. 287-288 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
Publié le : 1989-03-14
Classification:  
@article{1183742870,
     author = {Buss, Samuel},
     title = {Review: Neil Immerman, Upper and Lower Bounds for First Order Expressibility; Neil Immerman, Relational Queries Computable in Polynomial Time; Neil Immerman, Languages that Capture Complexity Classes},
     journal = {J. Symbolic Logic},
     volume = {54},
     number = {1},
     year = {1989},
     pages = { 287-288},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183742870}
}

Buss, Samuel. Review: Neil Immerman, Upper and Lower Bounds for First Order Expressibility; Neil Immerman, Relational Queries Computable in Polynomial Time; Neil Immerman, Languages that Capture Complexity Classes. J. Symbolic Logic, Tome 54 (1989) no. 1, pp.  287-288. http://gdmltest.u-ga.fr/item/1183742870/