The Community for Technology Leaders
RSS Icon
Subscribe
Oct. 16, 1978 to Oct. 18, 1978
pp: 159-165
ABSTRACT
We show an Ω(n/log n) lower bound on the total number of operations necessary to compute 0-1 polynomials of degree n in the model with complex preconditioning. The best previous result was Ω(n1/2/log n). This yields the first asymptotically optimal lower bound on the complexity of 0-1 polynomials in this model. We show also that there are 0-1 polynomials of degree n that require Ω(n1/2/log n) additive operations over C. The best previously shown lower bound on additions was Ω(n1/3/log n).
CITATION
Jean-Paul Van de Wiele, "An optimal lower bound on the number of total operations to compute 0-1 polynomials over the field of complex numbers", FOCS, 1978, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science 1978, pp. 159-165, doi:10.1109/SFCS.1978.7
34 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool