Root finding with threshold circuits (Q690451): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2121824896 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1112.3925 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold circuits of bounded depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel computation with threshold functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant Depth Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniformity within \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Majority Gate Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logarithmic Depth Circuits for Algebraic Functions / 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: Division in logspace-uniform<i>NC</i><sup>1</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform constant-depth threshold circuits for division and iterated multiplication. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Threshold Circuits and Polynomial Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient threshold circuits for power series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3592129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3279563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen / rank
 
Normal rank
Property / cites work
 
Property / cites work: A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Specified precision polynomial root isolation is in NC / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the complex roots problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal and nearly optimal algorithms for approximating polynomial zeros / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a Polynomial Equation: Some History and Recent Progress / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5465356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5306365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5341750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniform circuit complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4267800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4177796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4953977 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4769056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5797046 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4837918 / rank
 
Normal rank

Latest revision as of 22:53, 5 July 2024

scientific article
Language Label Description Also known as
English
Root finding with threshold circuits
scientific article

    Statements

    Root finding with threshold circuits (English)
    0 references
    0 references
    27 November 2012
    0 references
    0 references
    root finding
    0 references
    threshold circuit
    0 references
    power series
    0 references
    open induction
    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
    0 references
    0 references
    0 references