Although general theories are beginning to emerge in the area of automata based complexity theory, there are very few general methods or even general problem formulations in the area of arithmetic complexity. In this paper we pronose and defend a general model for studying bilinear multiplication in order to provide a common framework for discussing a wide class of problems.
|Original language||English (US)|
|Number of pages||8|
|Journal||Proceedings of the Annual ACM Symposium on Theory of Computing|
|State||Published - Apr 30 1973|
|Event||5th Annual ACM Symposium on Theory of Computing, STOC 1973 - Austin, United States|
Duration: Apr 30 1973 → May 2 1973
All Science Journal Classification (ASJC) codes