M. Dietzfelbinger, W. Maass, and G. Schnitger, The complexity of matrix transposition on one-tape off-line Turing machines, Theor. Comp. Sci., 82 (1991), pp. 113--129. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Linear Time And Memory-Efficient Computation - Regan (1992) (3 citations) (Correct)
....n log n] may be the best achievable in this manner. In general, we advance the BM as a logical next step in the longstanding program of proving nonlinear lower bounds for natural models of computation. In particular, we ask whether the techniques used by Dietzfelbinger, Maass, and Schnitger [20] to obtain lower bounds for Boolean matrix transpose and several sorting related functions on a certain restricted two tape TM can be applied to the differently restricted kind of two tape TM in Theorems 7.1 and 7.3. The latter kind is equivalent to a TM with one worktape and one pushdown store ....
M. Dietzfelbinger, W. Maass, and G. Schnitger, The complexity of matrix transposition on one-tape off-line Turing machines, Theor. Comp. Sci., 82 (1991), pp. 113--129.
Other Complexity Classes and Measures - Allender, Loui, Regan (1999) (Correct)
....property P exists, then it is sufficient to show that any object that does not have property P has a short description; thus any incompressible (or random ) object must have property P . This sort of argument has been useful in proving lower bounds in complexity theory. For example, the paper [ Dietzfelbinger et al. 1991 ] uses Kolmogorov complexity to show that no Turing machine with a single worktape can compute the transpose of a matrix in less than time Omega Gamma n 3=2 = p log n) 9 Research Issues and Summary As stated in the introduction to Chapter 27, the goals of complexity theory are (i) to ....
M. Dietzfelbinger, W. Maass, and G. Schnitger. The complexity of matrix transposition on one-tape off-line Turing machines. Theor. Comp. Sci., 82:113--129, 1991.
Machine Models and Linear Time Complexity - Regan (1993) (2 citations) (Correct)
.... ordinary TMs (see [FMR72, PF79, Kos79, LS81] TMs with only one worktape, or with some other kind of restricted storage such as a stack or queue or counters, are generally considered too weak to model general purpose computation, though interesting nonlinear lower bounds have been proved for them [DGPR84, MS86, LV88, DMS91, LLV92]. Theorem 1.1. a) RAM TIME log [t] DTIME d [t 1 1=d = log t] Lou83] b) DTIME d [t] DTIME[t 2 Gamma1=d ] PF79] Loui and Luginbuhl [LL92a] also prove that in the case t(n) O(n) a) is close to optimal for on line simulations. However, no separations at all have been proved ....
M. Dietzfelbinger, W. Maass, and G. Schnitger. The complexity of matrix transposition on one-tape off-line Turing machines. Theor. Comp. Sci., 82:113--129, 1991.
New Lower Bounds for Element Distinctness on a One-tape Turing.. - López-Ortiz (Correct)
....of Computation, Kolmogorov Complexity 1 Introduction The study of lower bounds for any computational model is one of the most difficult problems in Computational Complexity. Recent developments in Kolmogorov Complexity have proven to be a useful tool for obtaining new bounds in Turing machines [8, 1, 7]. Among the problems for which no tight upper and lower bounds are known, we have Element Distinctness (ed) on a single tape Turing machine. The importance of this problem is partially derived from its close relationship to sorting. Given that in most other computational models the complexity of ....
M. Dietzfelbinger, W. Maass, and G. Schnitger, The Complexity of Matrix Transposition on One-Tape Off-line Turing Machines, Theoretical Computer Science, 1991, 113-129.
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