This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
12th Annual Symposium on Switching and Automata Theory (SWAT 1971)
Bounds on the evaluation time for rational polynomial
October 13-October 15
ASCII Text
x 
 
Michael Paterson, Larry Stockmeyer, "Bounds on the evaluation time for rational polynomial," Foundations of Computer Science, IEEE Annual Symposium on, pp. 140-143, 12th Annual Symposium on Switching and Automata Theory (SWAT 1971), 1971.
 
 
BibTex
x
 
@article{ 10.1109/SWAT.1971.5,
author = {Michael Paterson and Larry Stockmeyer},
title = {Bounds on the evaluation time for rational polynomial},
journal ={Foundations of Computer Science, IEEE Annual Symposium on},
volume = {0},
year = {1971},
issn = {0272-4847},
pages = {140-143},
doi = {http://doi.ieeecomputersociety.org/10.1109/SWAT.1971.5},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Foundations of Computer Science, IEEE Annual Symposium on
TI - Bounds on the evaluation time for rational polynomial
SN - 0272-4847
SP140
EP143
A1 - Michael Paterson,
A1 - Larry Stockmeyer,
PY - 1971
VL - 0
JA - Foundations of Computer Science, IEEE Annual Symposium on
ER -
 
Citation:
Michael Paterson, Larry Stockmeyer, "Bounds on the evaluation time for rational polynomial," focs, pp.140-143, 12th Annual Symposium on Switching and Automata Theory (SWAT 1971), 1971
Usage of this product signifies your acceptance of the Terms of Use.