Publisher
Springer Science and Business Media LLC
Reference17 articles.
1. Borodin, A., Munro, I.: The computational complexity of algebraic and numeric problems. New York 1975.
2. Brent, E., Kuck, D., Maruyama, K.: The parallel evaluation of arithmetic expressions without division. IEEE Transactions on Computers C-22 (1973) 532–534.
3. Fischer, M.J., Meyer, A.R., Paterson, M.S.: Ω(nlogn) lower bounds on length of Boolean formulas. SIAM J. Comput.11, 3 (1982) 416–427.
4. Hodes, L.E., Specker, E.: Length of formulas and elimination of quantifiers I. Contributions to Mathematical Logic. Amsterdam 1968.
5. Krapchenko, V.M.: Complexity of the realization of a linear function in the class of II-circuits. Math. Notes Acad. Sci. USSR (1971) 21–23.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献