Go to the corresponding Portal 
Blaeser, Markus ; Engels, Christian
pdfformat: 

@InProceedings{blaeser_et_al:LIPIcs:2011:3043, author = {Markus Blaeser and Christian Engels}, title = {{Randomness Efficient Testing of Sparse Black Box Identities of Unbounded Degree over the Reals}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011) }, pages = {555566}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897255}, ISSN = {18688969}, year = {2011}, volume = {9}, editor = {Thomas Schwentick and Christoph D{\"u}rr}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3043}, URN = {urn:nbn:de:0030drops30433}, doi = {http://dx.doi.org/10.4230/LIPIcs.STACS.2011.555}, annote = {Keywords: Descartes’ rule of signs, polynomial identity testing, sparse polynomials, black box testing} }
Keywords:  Descartes’ rule of signs, polynomial identity testing, sparse polynomials, black box testing  
Seminar:  28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)  
Issue Date:  2011  
Date of publication:  11.03.2011 