AAAAAA

   
Results: 1-12 |
Results: 12
COMPUTING THE ADDITIVE COMPLEXITY OF ALGEBRAIC CIRCUITS WITH ROOT EXTRACTING
Authors: GRIGORIEV D KARPINSKI M
Citation: D. Grigoriev et M. Karpinski, COMPUTING THE ADDITIVE COMPLEXITY OF ALGEBRAIC CIRCUITS WITH ROOT EXTRACTING, SIAM journal on computing, 27(3), 1998, pp. 694-701
A LOWER-BOUND FOR RANDOMIZED ALGEBRAIC DECISION TREES
Authors: GRIGORIEV D KARPINSKI M AUFDERHEIDE FM SMOLENSKY R
Citation: D. Grigoriev et al., A LOWER-BOUND FOR RANDOMIZED ALGEBRAIC DECISION TREES, Computational complexity, 6(4), 1997, pp. 357-375
RANDOMIZATION AND THE COMPUTATIONAL POWER OF ANALYTIC AND ALGEBRAIC DECISION TREES
Authors: GRIGORIEV D KARPINSKI M SMOLENSKY R
Citation: D. Grigoriev et al., RANDOMIZATION AND THE COMPUTATIONAL POWER OF ANALYTIC AND ALGEBRAIC DECISION TREES, Computational complexity, 6(4), 1997, pp. 376-388
TESTING SHIFT-EQUIVALENCE OF POLYNOMIALS BY DETERMINISTIC, PROBABILISTIC AND QUANTUM MACHINES
Authors: GRIGORIEV D
Citation: D. Grigoriev, TESTING SHIFT-EQUIVALENCE OF POLYNOMIALS BY DETERMINISTIC, PROBABILISTIC AND QUANTUM MACHINES, Theoretical computer science, 180(1-2), 1997, pp. 217-228
LOWER-BOUND ON TESTING MEMBERSHIP TO A POLYHEDRON BY ALGEBRAIC DECISION AND COMPUTATION TREES
Authors: GRIGORIEV D KARPINSKI M VOROBJOV N
Citation: D. Grigoriev et al., LOWER-BOUND ON TESTING MEMBERSHIP TO A POLYHEDRON BY ALGEBRAIC DECISION AND COMPUTATION TREES, Discrete & computational geometry, 17(2), 1997, pp. 191-215
ON THE POWER OF REAL TURING-MACHINES OVER BINARY INPUTS
Authors: CUCKER F GRIGORIEV D
Citation: F. Cucker et D. Grigoriev, ON THE POWER OF REAL TURING-MACHINES OVER BINARY INPUTS, SIAM journal on computing, 26(1), 1997, pp. 243-254
CHARACTERIZATION OF A NEW MULTIANODE PMT FOR OPTICAL-FIBER READOUT ATLOW-LEVEL LIGHT-INTENSITY
Authors: GRIGORIEV D JOHNSON O WORSTELL W ZAVARZIN V
Citation: D. Grigoriev et al., CHARACTERIZATION OF A NEW MULTIANODE PMT FOR OPTICAL-FIBER READOUT ATLOW-LEVEL LIGHT-INTENSITY, IEEE transactions on nuclear science, 44(3), 1997, pp. 990-993
COMPLEXITY LOWER BOUNDS FOR COMPUTATION TREES WITH ELEMENTARY TRANSCENDENTAL FUNCTION GATES
Authors: GRIGORIEV D VOROBJOV N
Citation: D. Grigoriev et N. Vorobjov, COMPLEXITY LOWER BOUNDS FOR COMPUTATION TREES WITH ELEMENTARY TRANSCENDENTAL FUNCTION GATES, Theoretical computer science, 157(2), 1996, pp. 185-214
NC SOLVING OF A SYSTEM OF LINEAR ORDINARY DIFFERENTIAL-EQUATIONS IN SEVERAL UNKNOWNS
Authors: GRIGORIEV D
Citation: D. Grigoriev, NC SOLVING OF A SYSTEM OF LINEAR ORDINARY DIFFERENTIAL-EQUATIONS IN SEVERAL UNKNOWNS, Theoretical computer science, 157(1), 1996, pp. 79-90
COMPUTABILITY OF THE ADDITIVE COMPLEXITY OF ALGEBRAIC CIRCUITS WITH ROOT EXTRACTING
Authors: GRIGORIEV D KARPINSKI M
Citation: D. Grigoriev et M. Karpinski, COMPUTABILITY OF THE ADDITIVE COMPLEXITY OF ALGEBRAIC CIRCUITS WITH ROOT EXTRACTING, Theoretical computer science, 157(1), 1996, pp. 91-99
ON COMPUTING ALGEBRAIC-FUNCTIONS USING LOGARITHMS AND EXPONENTIALS
Authors: GRIGORIEV D SINGER M YAO A
Citation: D. Grigoriev et al., ON COMPUTING ALGEBRAIC-FUNCTIONS USING LOGARITHMS AND EXPONENTIALS, SIAM journal on computing, 24(2), 1995, pp. 242-246
COMPUTATIONAL-COMPLEXITY OF SPARSE RATIONAL INTERPOLATION
Authors: GRIGORIEV D KARPINSKI M SINGER MF
Citation: D. Grigoriev et al., COMPUTATIONAL-COMPLEXITY OF SPARSE RATIONAL INTERPOLATION, SIAM journal on computing, 23(1), 1994, pp. 1-11
Risultati: 1-12 |