On the public citation graph
On Threshold Circuits and Polynomial Computation
0 signed · 97 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-13345-3_25openalex-snapshot
On probabilistic tape complexity and fast circuits for matrix inversion problems
inferredcites →https://doi.org/10.1007/3-540-16486-3_105openalex-snapshot
Parallel computation with threshold functions
inferredcites →https://doi.org/10.1016/0028-3932(82)90056-2openalex-snapshot
From images to surfaces. A computational study of the human early visual system
inferredcites →https://doi.org/10.1016/0898-1221(86)90015-5openalex-snapshot
Fast parallel algorithms for polynomial division over an arbitrary field of constants
inferredcites →https://doi.org/10.1016/s0364-0213(82)80001-3openalex-snapshot
Connectionist Models and Their Properties
inferredcites →https://doi.org/10.1049/ip-i-1.1981.0010openalex-snapshot
Introduction to V.L.S.I. Systems
inferredcites →https://doi.org/10.1073/pnas.79.8.2554openalex-snapshot
Neural networks and physical systems with emergent collective computational abilities.
inferredcites →https://doi.org/10.1137/0213019openalex-snapshot
Parallel Solution of Certain Toeplitz Linear Systems
inferredcites →https://doi.org/10.1137/0215017openalex-snapshot
Logarithmic Depth Circuits for Algebraic Functions
inferredcites →https://doi.org/10.1137/0215070openalex-snapshot
Log Depth Circuits for Division and Related Problems
inferredcites →https://doi.org/10.1145/321941.321945openalex-snapshot
New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions and Recurrences
inferredcites →https://doi.org/10.1145/322358.322373openalex-snapshot
Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs
inferredcites →https://doi.org/10.1147/rd.312.0235openalex-snapshot
The complexity of computations by networks
inferredcites →https://doi.org/10.1207/s15516709cog0901_7openalex-snapshot
A Learning Algorithm for Boltzmann Machines*
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781119162254.ch06openalex-snapshot
Dynamical Systems and Interaction Networks
inferred← citeshttps://doi.org/10.1006/inco.1994.1059openalex-snapshot
Approximating Threshold Circuits by Rational Functions
inferred← citeshttps://doi.org/10.1006/inco.1998.2783openalex-snapshot
Efficient Threshold Circuits for Power Series
inferred← citeshttps://doi.org/10.1006/jcss.1999.1675openalex-snapshot
On TC0, AC0, and Arithmetic Circuits
inferred← citeshttps://doi.org/10.1007/3-540-44503-x_16openalex-snapshot
The Dynamic Complexity of Transitive Closure Is in DynTC°
inferred← citeshttps://doi.org/10.1007/3-540-55808-x_5openalex-snapshot
Neural networks and complexity theory
inferred← citeshttps://doi.org/10.1007/3-540-59042-0_64openalex-snapshot
On realizing iterated multiplication by small depth threshold circuits
inferred← citeshttps://doi.org/10.1007/3-540-61332-3_156openalex-snapshot
Depth-efficient threshold circuits for multiplication and symmetric function computation
inferred← citeshttps://doi.org/10.1007/978-1-4615-2696-4_2openalex-snapshot
Depth-Efficient Threshold Circuits for Arithmetic Functions
inferred← citeshttps://doi.org/10.1007/978-3-030-26954-8_27openalex-snapshot
Broadcast and Trace with $$N^{\varepsilon }$$ Ciphertext Size from Standard Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-030-77870-5_1openalex-snapshot
Non-interactive Zero Knowledge from Sub-exponential DDH
inferred← citeshttps://doi.org/10.1007/978-3-031-42333-8_4openalex-snapshot
Neural Networks Universality, Geometric, and Dynamical System Elements for Fluid Animation
inferred← citeshttps://doi.org/10.1007/978-3-032-15641-9_22openalex-snapshot
Reachability in Interactive Chemical Reaction Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-10512-3_14openalex-snapshot
Time-Bounded Reachability for Initialized Hybrid Automata with Linear Differential Inclusions and Rectangular Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-91908-9_2openalex-snapshot
Some Estimated Likelihoods for Computational Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_12openalex-snapshot
On Defining Integers in the Counting Hierarchy and Proving Arithmetic Circuit Lower Bounds
inferred← citeshttps://doi.org/10.1007/978-3-642-29011-4_42openalex-snapshot
Pseudorandom Functions and Lattices
inferred← citeshttps://doi.org/10.1007/s00037-009-0260-xopenalex-snapshot
On Defining Integers And Proving Arithmetic Circuit Lower Bounds
inferred← citeshttps://doi.org/10.1007/s00153-014-0414-7openalex-snapshot
Open induction in a bounded arithmetic for TC0
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90372-mopenalex-snapshot
The complexity of computing symmetric functions using threshold circuits
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90254-qopenalex-snapshot
On read-once threshold formulae and their randomized decision tree complexity
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50007-2openalex-snapshot
A Catalog of Complexity Classes
inferred← citeshttps://doi.org/10.1016/j.apal.2023.103269openalex-snapshot
Elementary analytic functions in VTC0
inferred← citeshttps://doi.org/10.1016/j.ic.2012.03.002openalex-snapshot
Greenʼs theorem and isolation in planar graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.07.022openalex-snapshot
The complexity of game isomorphism
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.09.001openalex-snapshot
Root finding with threshold circuits
inferred← citeshttps://doi.org/10.1016/s0022-0000(02)00025-9openalex-snapshot
Uniform constant-depth threshold circuits for division and iterated multiplication
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00740-5openalex-snapshot
The dynamic complexity of transitive closure is in DynTC0
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00227-2openalex-snapshot
Non-commutative arithmetic circuits: depth reduction and size lower bounds
inferred← citeshttps://doi.org/10.1109/12.106225openalex-snapshot
Depth-size tradeoffs for neural computation
inferred← citeshttps://doi.org/10.1109/18.256501openalex-snapshot
Depth efficient neural networks for division and related problems
inferred← citeshttps://doi.org/10.1109/18.312168openalex-snapshot
Rational approximation techniques for analysis of neural networks
inferred← citeshttps://doi.org/10.1109/5.58350openalex-snapshot
Neural computation of arithmetic functions
inferred← citeshttps://doi.org/10.1109/acssc.1991.186497openalex-snapshot
Circuit complexity for neural computation
inferred← citeshttps://doi.org/10.1109/acssc.1999.831923openalex-snapshot
Optimal-depth threshold circuits for multiplication and related problems
inferred← citeshttps://doi.org/10.1109/ccc.1997.612309openalex-snapshot
On TC/sup 0/, AC/sup 0/, and arithmetic circuits
inferred← citeshttps://doi.org/10.1109/ccc.2001.933882openalex-snapshot
Uniform circuits for division: consequences and problems
inferred← citeshttps://doi.org/10.1109/ccc.2011.19openalex-snapshot
On the Sum of Square Roots of Polynomials and Related Problems
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00045openalex-snapshot
A New Minimax Theorem for Randomized Algorithms (Extended Abstract)
inferred← citeshttps://doi.org/10.1109/fscs.1990.89559openalex-snapshot
On threshold circuits for parity
inferred← citeshttps://doi.org/10.1109/fscs.1990.89585openalex-snapshot
Polynomial threshold functions, AC functions and spectrum norms
inferred← citeshttps://doi.org/10.1109/ijcnn.2003.1223825openalex-snapshot
A survey of perceptron circuit complexity results
inferred← citeshttps://doi.org/10.1109/lics.1996.561298openalex-snapshot
A generalization of Fagin's theorem
inferred← citeshttps://doi.org/10.1109/sct.1989.41816openalex-snapshot
The complexity of iterated multiplication
inferred← citeshttps://doi.org/10.1109/sct.1990.113956openalex-snapshot
On read-once threshold formulae and their randomized decision tree complexity
inferred← citeshttps://doi.org/10.1109/sct.1994.315806openalex-snapshot
Time, hardware, and uniformity
inferred← citeshttps://doi.org/10.1109/sfcs.1987.59openalex-snapshot
Threshold circuits of bounded depth
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63538openalex-snapshot
A note on the power of threshold circuits
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646134openalex-snapshot
Number-theoretic constructions of efficient pseudo-random functions
inferred← citeshttps://doi.org/10.1109/tc.2018.2881245openalex-snapshot
Mapping Monotone Boolean Functions into Majority
inferred← citeshttps://doi.org/10.1109/tcad.2023.3257082openalex-snapshot
Improved Linear Decomposition of Majority and Threshold Boolean Functions
inferred← citeshttps://doi.org/10.1109/tencon.1990.152559openalex-snapshot
Fast arithmetic computing with neural networks
inferred← citeshttps://doi.org/10.1137/20m1344202openalex-snapshot
Quantum Hardness of Learning Shallow Classical Circuits
inferred← citeshttps://doi.org/10.1142/9789812562494_0011openalex-snapshot
THE DIVISION BREAKTHROUGHS
inferred← citeshttps://doi.org/10.1145/167088.167226openalex-snapshot
Depth reduction for noncommutative arithmetic circuits
inferred← citeshttps://doi.org/10.1145/174644.174647openalex-snapshot
Cryptographic Limitations on Learning Boolean Formulae and Finite Automata
inferred← citeshttps://doi.org/10.1145/2591796.2591858openalex-snapshot
New algorithms and lower bounds for circuits with linear threshold gates
inferred← citeshttps://doi.org/10.1145/3452143.3465530openalex-snapshot
Cyclotomic Identity Testing and Applications
inferred← citeshttps://doi.org/10.1145/3626514openalex-snapshot
A New Minimax Theorem for Randomized Algorithms
inferred← citeshttps://doi.org/10.1145/972639.972643openalex-snapshot
Number-theoretic constructions of efficient pseudo-random functions
inferred← citeshttps://doi.org/10.1162/089976603322518731openalex-snapshot
General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results
inferred← citeshttps://doi.org/10.1162/neco.1996.8.4.805openalex-snapshot
Analog versus Discrete Neural Networks
inferred← citeshttps://doi.org/10.1201/9781420050646.pteopenalex-snapshot
Neural Network Hardware Implementations
inferred← citeshttps://doi.org/10.1364/ao.36.007327openalex-snapshot
Efficient parallel algorithms for optical computing with the discrete Fourier transform (DFT) primitive
inferred← citeshttps://doi.org/10.1613/jair.1.14040openalex-snapshot
Finite Materialisability of Datalog Programs with Metric Temporal Operators
inferred← citeshttps://doi.org/10.3233/com-220407openalex-snapshot
On the complexity of algebraic numbers, and the bit-complexity of straight-line programs
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2010.308openalex-snapshot
Computing Rational Radical Sums in Uniform TC^0
inferred← citeshttps://doi.org/10.46298/dmtcs.526openalex-snapshot
Grammatical compression: compressed equivalence and other problems
inferred← citeshttps://doi.org/10.48550/arxiv.1401.2444openalex-snapshot
New algorithms and lower bounds for circuits with linear threshold gates
inferred← citeshttps://doi.org/10.48550/arxiv.2003.06993openalex-snapshot
Space Hardness of Solving Structured Linear Systems
inferred← citeshttps://doi.org/10.5821/dissertation-2117-94628openalex-snapshot
The Complexity of angel-daemons and game isomorphism
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.