William Hesse, Eric Allender, et al.  Home/Search
Context Related
| rutgers.edu/pub/allender...division.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: rutgers.edu/~alle...complete_list (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper. 2.1. Circuit Classes We begin by formally defining the three circuit complexity classes that will concern us here. These are given by combinatorial restrictions on the circuits of the family. We will then define the uniformity restrictions we will use. Finally, we will give the equivalent formulations of uniform circuit complexity classes in terms of descriptive complexity classes (Update)
Context of citations to this paper: More
...parallel) some consistency checks. The consistency checks involve field operations, which are computable by DLOGTIME uniform TC circuits [14]. All the queries to the provers are made in one round (and hence are nonadaptive) Since by assumption, ###### # NC that every language...
.... finding the product of two n bit integers, finding the integer quotient of two n bit integers, and finding the product of n n bit integers [19]. This extra power can be used to create a fully dynamic algorithm for transitive closure. In other words, Theorem 5.1 DynREACH is in...
Cited by: More
Arithmetic Complexity, Kleene Closure, and Formal Power.. - Allender, Arvind, Mahajan (2003) (Correct)
Dynamic Computational Complexity - Hesse (2003) (Correct)
Derandomization and Distinguishing Complexity - Allender, Koucky, Ronneburger.. (2003) (Correct)
Similar documents (at the sentence level):
21.5%: Uniform Circuits for Division: Consequences and Problems - Allender, Barrington, Hesse (2000) (Correct)
6.7%: Division is in Uniform TC - William Hesse Department (2001) (Correct)
5.3%: The Division Breakthroughs - Allender (2001) (Correct)
Active bibliography (related documents): More All
6.2: Uniform Constant-Depth Threshold Circuits for Division and.. - Hesse, Allender (2002) (Correct)
0.6: Time-Space Tradeoffs in the Counting Hierarchy - Allender, Kouck, Ronneburger (2001) (Correct)
0.5: Arithmetic Circuit Complexity and Motion Planning - Tate (1992) (Correct)
Similar documents based on text: More All
0.2: The Permanent Requires Large Uniform Threshold Circuits - Allender (1999) (Correct)
0.2: Fully Dynamic Undirected Graph Reachability in Constant Time on a.. - Hesse (Correct)
0.2: The Dynamic Complexity of Transitive Closure is in DynTC0 - Hesse (2002) (Correct)
BibTeX entry: (Update)
W. Hesse, E. Allender, and D. Barrington. Uniform constant-depth threshold circuits for division and iterated multiplication. Journal of Computer and System Sciences, 65:695--716, 2002. http://citeseer.ist.psu.edu/hesse02uniform.html More
@misc{ hesse02uniform,
author = "W. Hesse and E. Allender and D. Barrington",
title = "Uniform constant-depth threshold circuits for division and iterated multiplication",
text = "W. Hesse, E. Allender, and D. Barrington. Uniform constant-depth threshold
circuits for division and iterated multiplication. Journal of Computer and
System Sciences, 65:695--716, 2002.",
year = "2002",
url = "citeseer.ist.psu.edu/hesse02uniform.html" }
Citations (may not include all citations):125 On uniform circuit complexity (context) - Ruzzo - 1981
110 Descriptive Complexity (context) - Immerman - 1999
103 Almost optimal lower bounds for small depth circuits - Hastad - 1989
92 Constant depth reducibility (context) - Chandra, Stockmeyer et al. - 1984
91 Log depth circuits for division and related problems (context) - Beame, Cook et al. - 1986
60 On uniformity within NC (context) - Barrington, Immerman et al. - 1990
51 On threshold circuits and polynomial computation - Reif, Tate - 1992
51 On threshold circuits and polynomial computation - Reif
38 The complexity of iterated multiplication - Immerman, Landau - 1995
38 Nondeterministic NC computation - Caussinus, McKenzie et al. - 1998
28 Introduction to Circuit Complexity (context) - Vollmer - 1999
25 On optimal depth threshold circuits for multiplication and r.. (context) - Siu, Roychowdhury - 1994
21 Logarithmic depth circuits for algebraic functions (context) - Reif - 1986
20 polynomial-size circuits for symmetric functions (context) - Fagin, Klawe et al. - 1985
20 and Arithmetic Circuits (context) - Agrawal, Allender et al. - 2000
19 Fast parallel arithmetic via modular representation (context) - Davida, Litow - 1991
18 Threshold circuits of small majority-depth - Maciel, Therien - 1998
17 Space-efficient deterministic simulation of probabilistic au.. - Macarie - 1998
14 On counting AC circuits with negative constants - Ambainis, Barrington et al. - 1998
14 Reducing the complexity of reductions - Agrawal, Allender et al. - 2001
14 Turing Machines with Sublogarithmic Space (context) - Szepietowski - 1994
12 Bits and relative order from residues (context) - Dietz, Macarie et al. - 1994
11 Rudimentary reductions revisited - Allender, Gore - 1991
10 Bounded Depth Arithmetic Circuits: Counting and Closure - Allender, Ambainis et al. - 1999
8 Efficient parallel circuits and algorithms for division (context) - Shankar, Ramachandran - 1998
8 On tape bounds for single letter alphabet language processin.. (context) - Hartmanis, Berman - 1976
7 Decomposing NC and AC (context) - Wilson - 1990
7 Optimal size integer division circuits - Reif, Tate - 1990
7 Time-space tradeoffs for satisfiability - Fortnow - 2000
6 Sequential machine independent characterizations of the para.. (context) - Clote - 1990
6 and Counting: Uniform and Nonuniform Upper Bounds (context) - Allender, Reinhardt et al. - 1999
6 If deterministic and nondeterministic space complexities are.. (context) - Szepietowski - 1990
5 Space bounded computations: Review and new speculation (context) - Hartmanis, Ranjan - 1989
5 Complexity of parallel arithmetic using the Chinese Remainde.. - Chiu - 1995
5 Type 2 computational complexity (context) - Constable - 1973
4 and circuit complexity (context) - Newman, Ragde et al. - 1990
4 the complexity of some problems on groups given as multiplic.. (context) - Barrington, Kadau et al. - 2001
4 Rudimentary predicates and Turing calculations (context) - Nepomnjasci - 1970
4 Inductive Counting for Width-Restricted Branching Programs - Damm, Holzer - 1996
3 The division breakthroughs - Allender - 2001
3 Computing with sublogarithmic space - Liskiewicz, Reischuk - 1997
2 Uniform circuits for division: Consequencesand problems (context) - Allender, Barrington et al. - 2001
2 DIMACS Series in Discrete Mathematics and Theoretical Comput.. (context) - Allender, Gore et al. - 1993
2 Logarithmic depth circuits for Hermite interpolation (context) - Eberly - 1994
2 very small size circuits for symmetric functions (context) - Hastad, Wegener et al. - 1994
2 Very fast polynomial arithmetic (context) - Eberly - 1989
2 RAIRO Theoretical Informatics and Applications (context) - Chiu, Davida et al. - 2001
2 InICALP2001: Twenty-Eighth International ColloquiumonAutomat.. (context) - Hesse, in - 2001
2 Efficient threshold circuits for power series - Maciel, Therien - 1999
2 Definability by constant-depth (context) - Denenberg, Gurevich et al. - 1986
2 Uniform circuits for division: Consequencesand problems (context) - Allender, Barrington - 2000
1 ithmetic, the Diffie-Hellman problem, and Constable's Class .. (context) - Johannsen - 1999
1 on and N. Immerman. Time, hardware, and uniformity (context) - MixBarringt - 1997
1 Bounded-widthpolynomial-sizebranchingprograms recognizeexact.. (context) - MixBarrington - 1989
http://www.nada.kth.se/#johanh/papers.html
Documents on the same site (http://athos.rutgers.edu/~allender/publications/complete_list.html): More
Limitations of the Upward Separation Technique - Allender (1990) (Correct)
A Note on the Representational Incompatibility of Function.. - Allender, Kearns (2002) (Correct)
Algebraic Methods for Proving Lower Bounds in Circuit Complexity - Allender (Correct)
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