AAAAAA
Results:
1-12
|
Results: 12
Authors:
Koiran, P
Citation: P. Koiran, Transfer theorems via sign conditions, INF PROCESS, 81(2), 2002, pp. 65-69
Authors:
Blondel, VD
Bournez, O
Koiran, P
Papadimitriou, CH
Tsitsiklis, JN
Citation: Vd. Blondel et al., Deciding stability and mortality of piecewise affine dynamical systems, THEOR COMP, 255(1-2), 2001, pp. 687-696
Authors:
Koiran, P
Portier, N
Citation: P. Koiran et N. Portier, Back-and-forth systems for generic curves and a decision algorithm for thelimit theory, ANN PUR APP, 111(3), 2001, pp. 257-275
Authors:
Blondel, VD
Bournez, O
Koiran, P
Tsitsiklis, JN
Citation: Vd. Blondel et al., The stability of saturated linear dynamical systems is undecidable, J COMPUT SY, 62(3), 2001, pp. 442-462
Authors:
Dedieu, JP
Koiran, P
Citation: Jp. Dedieu et P. Koiran, Guest editors' preface, J COMPLEX, 16(3), 2000, pp. 528-528
Authors:
Koiran, P
Citation: P. Koiran, The complexity of local dimensions for constructible sets, J COMPLEX, 16(1), 2000, pp. 311-323
Authors:
Koiran, P
Citation: P. Koiran, On defining irreducibility, CR AC S I, 330(7), 2000, pp. 529-532
Authors:
Shawe-Taylor, J
Ben-David, S
Koiran, P
Schapire, R
Shawe-Taylor, J
Citation: J. Shawe-taylor et al., Theoretical analysis of real-valued function classes, NEUROCOMPUT, 29(1-3), 1999, pp. 1-2
Authors:
Koiran, P
Citation: P. Koiran, The real dimension problem is NPR-complete, J COMPLEX, 15(2), 1999, pp. 227-238
Authors:
Cucker, F
Koiran, P
Smale, S
Citation: F. Cucker et al., A polynomial time algorithm for diophantine equations in one variable, J SYMB COMP, 27(1), 1999, pp. 21-29
Authors:
Koiran, P
Citation: P. Koiran, Elimination of parameters in the polynomial hierarchy, THEOR COMP, 215(1-2), 1999, pp. 289-304
Authors:
Chapuis, O
Koiran, P
Citation: O. Chapuis et P. Koiran, Saturation and stability in the theory of computation over the reals, ANN PUR APP, 99(1-3), 1999, pp. 1-49
Risultati:
1-12
|