K. Abrahamson. Time-space tradeo s for algebraic problems on general sequential machines. JCSS, 43(2):269-289, Oct 1991. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Time-Space Tradeoffs for Branching Programs - Beame, Saks, Thathachar (1999) (15 citations) (Correct)
....we summarize in the next two subsections. 1. 1 Lower bounds for single output functions There has been a great deal of success in proving time space tradeo# lower bounds for multi output functions in FP such as sorting, pattern matching, matrix vector product, and hashing [BC82, Bea91, Abr90, Abr91, MNT93] However, for single output functions (those whose output is one bit) prior to the work in this paper, there were apparently no lower bounds known better than n C (for constant C) for any explicit n variable function. The existing techniques for multi variate functions involve some sort ....
Karl R. Abrahamson. Time--space tradeo#s for algebraic problems on general sequential models. Journal of Computer and System Sciences, 43(2):269--289, October 1991.
On Lower Bounds for Read-k-Times - Borodin, Razborov, Smolensky (Correct)
No context found.
K. Abrahamson. Time-space tradeo s for algebraic problems on general sequential machines. JCSS, 43(2):269-289, Oct 1991.
Time-Space Tradeoffs in Algebraic Complexity - Aldaz, Matera, Montaña, .. (Correct)
No context found.
K. Abrahamson. Time-space tradeo s for algebraic problems on general sequential machines. J. of Comp. Syst. Sci., 43:269-289, 1991.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC