论文信息 - Time-Space Tradeoffs for Integer Multiplication on Various Types of Input Oblivious Sequential Machines - 字舞流文

Time-Space Tradeoffs for Integer Multiplication on Various Types of Input Oblivious Sequential Machines

Jordan Gergov | Jordan Gergov

[1] Randal E. Bryant,et al. Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.

[2] Noga Alon,et al. Meanders and Their Applications in Lower Bounds Arguments , 1988, J. Comput. Syst. Sci..

[3] Noam Nisan,et al. Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-Offs , 1992, J. Comput. Syst. Sci..

[4] Kurt Mehlhorn,et al. Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract) , 1982, STOC '82.

[5] Randal E. Bryant,et al. On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication , 1991, IEEE Trans. Computers.

[6] Noam Nisan,et al. Multiparty protocols and logspace-hard pseudorandom sequences , 1989, STOC '89.

[7] Matthias Krause,et al. On Oblivious Branching Programs of Linear Length , 1991, Inf. Comput..

[8] Stasys Jukna,et al. A Note on Read-k Times Branching Programs , 1994, RAIRO Theor. Informatics Appl..

[9] Allan Borodin,et al. A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation , 1982, SIAM J. Comput..

[10] Jacob A. Abraham,et al. IBDDs: an efficient functional representation for digital circuits , 1992, [1992] Proceedings The European Conference on Design Automation.