Gergov, J. (1994). Time-space tradeo#s for integer multiplication on various types of input oblivious sequential machines. Information Processing Letters 51, 265--269. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Lower Bound For Integer Multiplication With Read-Once Branching .. - Ponzio (1998) (29 citations) (Correct)
....as long as each synthesis operation can be performed e#ciently. 800 STEPHEN PONZIO . k IBDDs, where the variable ordering is k consecutive permutations, possibly di#erent [JABFA92, BSSW95] OBDDs with various kinds of nondeterministic branching nodes (# nodes, # nodes, # nodes) [Me89, SDG94, Ge94, and others]. Recently proposed alternative models include graph driven BDDs [SW95] and binary moment diagrams [BC94] The latter are not branching programs and do not compute a function, but they do allow polynomial size representation of multiplication. Also, in [AM88] lower bounds are proved for any ....
....of linear length, regardless of the order in which variables are read. From the proof of Bryant s lower bound for OBDDs [Br91] it follows by a simple communication complexity argument that MULT cannot be computed in polynomialsize by k OBDDs [Kr91, BSSW93] or the various nondeterministic OBDDs [Ge94]. Incorporating results from [AM88] Ge94] extends the lower bound to arbitrary linearlength oblivious programs. Indeed, all of these oblivious models have been found too weak to compute MULT in polynomial size. It is therefore natural to consider nonoblivious programs, the simplest of these ....
[Article contains additional citation context not shown here]
J. Gergov, Time-space tradeo#s for integer multiplication on various types of inputoblivious sequential machines, Inform. Process. Lett., 51 (1994), pp. 265--269.
BDDs - Design, Analysis, Complexity, and Applications - Wegener (Correct)
No context found.
Gergov, J. (1994). Time-space tradeo#s for integer multiplication on various types of input oblivious sequential machines. Information Processing Letters 51, 265--269.
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