Contact and support
Need help, have a question, or want to contact the ResearchHub team?
© 2026 ResearchHub. Built for responsible scholarly connection.
Privacy-aware community infrastructureResearch graph
References from Lower bounds for the non-linear complexity of algebraic computation trees with integer inputs. Local targets link to admitted publications; unresolved targets remain external evidence.
10.1145/800061.808735
10.1145/800061.808735 · External reference
10.1016/s0747-7171(08)80013-2
10.1016/s0747-7171(08)80013-2 · 1990 · External reference
Unresolved reference
External reference
Unresolved reference
External reference
10.1090/s0002-9939-1964-0161339-9
10.1090/s0002-9939-1964-0161339-9 · 1964 · External reference
10.1007/3-540-13866-8
10.1007/3-540-13866-8 · 1984 · External reference
10.1016/0196-6774(82)90002-5
10.1016/0196-6774(82)90002-5 · 1982 · External reference
10.1515/9781400874842-016
10.1515/9781400874842-016 · External reference
10.1109/sfcs.1989.63495
10.1109/sfcs.1989.63495 · External reference
Unresolved reference
1989 · External reference
