P. W. Beame, S. A. Cook, and H. J. Hoover. Log depth circuits for division and related problems. SIAM J. Comput., 15(4):994--1003, November 1986. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
First 50 documents Next 50
Uniform Constant-Depth Threshold Circuits for Division and.. - Hesse, Allender (2002) (1 citation) (Correct)
Parallel Algorithm for Multiplication on Elliptic Curves - Garcia, Garcia (2002) (Correct)
Static Dictionaries on AC^0 RAMs: Query time.. - Andersson.. (1996) (Correct)
Dictionaries on AC^0 RAMs: Query Time.. - Andersson.. (1997) (Correct)
Division is in Uniform TC - William Hesse Department (2001) (5 citations) (Correct)
Uniform Circuits for Division: Consequences and Problems - Allender, Barrington, Hesse (2000) (2 citations) (Correct)
The Dynamic Complexity of Transitive Closure is in DynTC0 - Hesse (2001) (Correct)
On Closure Properties of P in the Context of PF - Ogihara, Thierauf, Toda (Correct)
The Division Breakthroughs - Allender (2001) (Correct)
Number-Theoretic Constructions of Efficient Pseudo-Random.. - Naor, Reingold (1997) (39 citations) (Correct)
On Threshold Circuits and Polynomial Computation - Reif, Tate (1987) (50 citations) (Correct)
Time, Hardware, and Uniformity - David Mix Barrington (Correct)
Fast parallel circuits for the quantum Fourier transform - Cleve, Watrous (2000) (6 citations) (Correct)
Programmable Neural Logic - Bohossian, Hasler, Bruck (1995) (1 citation) (Correct)
Simulating Threshold Circuits by Majority Circuits - Goldmann, Karpinski (1994) (19 citations) (Correct)
Complexity Of Parallel Arithmetic Using The Chinese Remainder.. - Chiu (1995) (4 citations) (Correct)
Short Proofs for Nondivisibility of Sparse Polynomials .. - Grigoriev, Karpinski, .. (1991) (Correct)
On The Power Of Small-Depth Threshold Circuits - Håstad, Goldmann (1991) (13 citations) (Correct)
Uniform Circuits for Division: Consequences and Problems - Allender, Barrington (2000) (2 citations) (Correct)
NC1 Division - Chiu, Davida, Litow (2000) (1 citation) (Correct)
Parallel Complexity of Integer Coprimality - Litow (2000) (1 citation) (Correct)
On Interpolation and Automatization for Frege Systems - Bonet, Pitassi, Raz (2000) (11 citations) (Correct)
On Closure Properties of #P in the Context of PF o #P - Ogihara, Thierauf, Toda, al. (Correct)
Division in O(log n) Depth Using O(...) Processors - Hastad, Leighton (Correct)
The Descriptive Complexity of the Fixed-Points of Bounded Formulas - Atserias (2000) (Correct)
Extensions of an Idea of McNaughton - Barrington (1993) (1 citation) (Correct)
Fast parallel circuits for the quantum Fourier transform - Cleve, Watrous (2000) (6 citations) (Correct)
On the Complexity of Some Problems on Groups Input.. - Barrington, Kadau, .. (Correct)
The Crew Pram Complexity Of Modular Inversion - GATHEN, Shparlinski (1998) (Correct)
Size-Depth Trade-offs for Threshold Circuits (Extended Abstract) - Impagliazzo, al. (Correct)
Computational Aspects of First-Order Logic on Finite Structures - Atserias (1999) (1 citation) (Correct)
Weak Bounded Arithmetic, the Diffie-Hellman Problem and.. - Johannsen (1999) (Correct)
Expressing Uniformity via Oracles - Damm, Holzer, Rossmanith (1997) (1 citation) (Correct)
No Feasible Interpolation for TC 0 -Frege Proofs - Bonet, Pitassi, Raz (1997) (5 citations) (Correct)
The Complexity of Matrix Rank and Feasible Systems of.. - Allender, Beals, Ogihara (1997) (14 citations) (Correct)
Unknown - Fundamental Parallel Algebraic (Correct)
On Threshold Circuits And Polynomial Computation - John Reif And (Correct)
Fast parallel circuits for the quantum Fourier transform - Richard Cleve John (Correct)
Fast parallel circuits for the quantum Fourier transform - Richard Cleve John (Correct)
Private Collaborative Forecasting and Benchmarking - Atallah, Bykova, Li.. (2004) (1 citation) (Correct)
Uniform Constant-Depth Threshold Circuits for Division and .. - Hesse, Allender, al. (2002) (1 citation) (Correct)
On Small Depth Threshold Circuits - Alexander Razborov Steklov (1992) (9 citations) (Correct)
On TC^0, AC^0, and Arithmetic Circuits - Agrawal, Allender, Datta (2000) (Correct)
Fixed-Point Logics, Descriptive Complexity, And Random.. - Atserias (2002) (Correct)
Hashing, Randomness and Dictionaries - Pagh (2002) (Correct)
Cryptographic Limitations on Learning - Boolean Formulae And (Correct)
Circuit Complexity - Krause, Wegener (Correct)
Star-Free Open Languages and Aperiodic Loops - Beaudry, Lemieux, Thérien (2001) (Correct)
On Counting AC0 Circuits with Negative Constants - Ambainis, Barrington, LeThanh (1998) (9 citations) (Correct)
A Compendium of Problems Complete for P - Greenlaw, Hoover, Ruzzo (1991) (14 citations) Self-citation (Hoover) (Correct)
First 50 documents Next 50
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