Uniform constant-depth threshold circuits for division and iterated multiplication. (Q1872733): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q29306000 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing the complexity of reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rudimentary reductions revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4287355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isolation, matching, and counting uniform and nonuniform upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniformity within \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some problems on groups input as multiplication tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Log Depth Circuits for Division and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic \(NC^1\) computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant Depth Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Division in logspace-uniform<i>NC</i><sup>1</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4062633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive counting for width-restricted branching programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Parallel Arithmetic via Modular Representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability by constant-depth polynomial-size circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bits and relative order from residues, space efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Very Fast Parallel Polynomial Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logarithmic Depth Circuits for Hermite Interpolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-depth, polynomial-size circuits for symmetric functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-space tradeoffs for satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tape bounds for single letter alphabet language processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3975135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal depth, very small size circuits for symmetric functions in \(AC^ 0\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of iterated multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4359462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-Efficient Deterministic Simulation of Probabilistic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold circuits of small majority-depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient threshold circuits for power series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5628106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logarithmic Depth Circuits for Algebraic Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Threshold Circuits and Polynomial Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Size Integer Division Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniform circuit complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel circuits and algorithms for division / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Optimal Depth Threshold Circuits for Multiplication and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: If deterministic and nondeterministic space complexities are equal for log log n, then they are also equal for log n / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing machines with sublogarithmic space / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Decomposability of $NC$ and $AC$ / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:25, 5 June 2024

scientific article
Language Label Description Also known as
English
Uniform constant-depth threshold circuits for division and iterated multiplication.
scientific article

    Statements

    Uniform constant-depth threshold circuits for division and iterated multiplication. (English)
    0 references
    0 references
    0 references
    14 May 2003
    0 references
    0 references
    division
    0 references
    iterated multiplication
    0 references
    uniform threshold circuits
    0 references
    circuit complexity
    0 references
    Chinese remainder representation
    0 references
    computation in abelian groups
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references