×

zbMATH — the first resource for mathematics

Koiran, Pascal

Compute Distance To:
Author ID: koiran.pascal Recent zbMATH articles by "Koiran, Pascal"
Published as: Koiran, P.; Koiran, Pascal
External Links: MGP · Wikidata
Documents Indexed: 84 Publications since 1993

Publications by Year

Citations contained in zbMATH

66 Publications have been cited 471 times in 312 Documents Cited by Year
Computability with low-dimensional dynamical systems. Zbl 0821.68053
Koiran, Pascal; Cosnard, Michel; Garzon, Max
32
1994
Arithmetic circuits: the chasm at depth four gets wider. Zbl 1253.68139
Koiran, Pascal
28
2012
Closed-form analytic maps in one and two dimensions can simulate universal Turing machines. Zbl 0912.68033
Koiran, Pascal; Moore, Cristopher
21
1999
Computing over the reals with addition and order. Zbl 0822.68028
Koiran, P.
21
1994
Deciding stability and mortality of piecewise affine dynamical systems. Zbl 0973.68067
Blondel, V. D.; Bournez, O.; Koiran, P.; Papadimitriou, C. H.; Tsitsiklis, J. N.
18
2001
Computing over the reals with addition and order: Higher complexity classes. Zbl 0843.68033
Cucker, Felipe; Koiran, Pascal
16
1995
Vandermonde matrices, NP-completeness and transversal subspaces. Zbl 1050.15001
Chistov, Alexander; Fournier, Hervé; Gurvits, Leonid; Koiran, Pascal
15
2003
A weak version of the Blum, Shub, and Smale model. Zbl 0869.68049
Koiran, Pascal
15
1997
Hilbert’s Nullstellensatz is in the polynomial hierarchy. Zbl 0862.68053
Koiran, Pascal
15
1996
Decidable and undecidable problems about quantum automata. Zbl 1078.81012
Blondel, Vincent D.; Jeandel, Emmanuel; Koiran, Pascal; Portier, Natacha
14
2005
Quantum automata and algebraic groups. Zbl 1124.81004
Derksen, Harm; Jeandel, Emmanuel; Koiran, Pascal
13
2005
The stability of saturated linear dynamical systems is undecidable. Zbl 0995.03033
Blondel, Vincent D.; Bournez, Olivier; Koiran, Pascal; Tsitsiklis, John N.
11
2001
Saturation and stability in the theory of computation over the reals. Zbl 0930.03044
Chapuis, Olivier; Koiran, Pascal
11
1999
A polynomial time algorithm for diophantine equations in one variable. Zbl 0920.11085
Cucker, Felipe; Koiran, Pascal; Smale, Steve
11
1999
Approximation and learning of convex superpositions. Zbl 0880.68105
Gurvits, Leonid; Koiran, Pascal
11
1997
On the expressive power of planar perfect matching and permanents of bounded treewidth matrices. Zbl 1141.68418
Flarup, Uffe; Koiran, Pascal; Lyaudet, Laurent
10
2007
Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields. Zbl 1356.11093
Kaltofen, Erich; Koiran, Pascal
9
2006
On the complexity of factoring bivariate supersparse (lacunary) polynomials. Zbl 1356.11092
Kaltofen, Erich; Koiran, Pascal
9
2005
Valiant’s model and the cost of computing integers. Zbl 1061.68062
Koiran, Pascal
9
2004
Lower bounds are not easier over the reals: Inside PH. Zbl 0973.68081
Fournier, Hervé; Koiran, Pascal
9
2000
On real Turing machines that toss coins. Zbl 0938.68648
Cucker, Felipe; Karpinski, Marek; Koiran, Pascal; Lickteig, Thomas; Werther, Kai
9
1995
The real dimension problem is \(\text{NP}_{\mathbb R}\)-complete. Zbl 1101.68565
Koiran, Pascal
8
1999
Neural networks with quadratic VC dimension. Zbl 0869.68089
Koiran, Pascal; Sontag, Eduardo D.
8
1997
Are lower bounds easier over the reals? Zbl 1028.68051
Fournier, Hervé; Koiran, Pascal
7
1998
Approximating the volume of definable sets. Zbl 0938.68581
Koiran, Pascal
7
1995
A Wronskian approach to the real \(\tau\)-conjecture. Zbl 1302.68331
Koiran, Pascal; Portier, Natacha; Tavenas, Sébastien
6
2015
VPSPACE and a transfer theorem over the reals. Zbl 1213.68300
Koiran, Pascal; Perifel, Sylvain
6
2009
Lower bounds for sums of powers of low degree univariates. Zbl 1440.12002
Kayal, Neeraj; Koiran, Pascal; Pecatte, Timothée; Saha, Chandan
5
2015
Hidden cliques and the certification of the restricted isometry property. Zbl 1360.94081
Koiran, Pascal; Zouzias, Anastasios
5
2014
The limited power of powering: polynomial identity testing and a depth-four lower bound for the permanent. Zbl 1246.68123
Grenet, Bruno; Koiran, Pascal; Portier, Natacha; Strozecki, Yann
5
2011
On the expressive power of CNF formulas of bounded tree- and clique-width. Zbl 1207.05093
Briquel, Irenée; Koiran, Pascal; Meer, Klaus
5
2011
The topological entropy of iterated piecewise affine maps is uncomputable. Zbl 1112.37301
Koiran, Pascal
5
2001
A family of universal recurrent networks. Zbl 0874.68250
Koiran, Pascal
5
1996
Factoring bivariate lacunary polynomials without heights. Zbl 1360.68926
Chattopadhyay, Arkadev; Grenet, Bruno; Koiran, Pascal; Portier, Natacha; Strozecki, Yann
4
2013
On the complexity of the multivariate resultant. Zbl 1260.14074
Grenet, Bruno; Koiran, Pascal; Portier, Natacha
4
2013
Interpolation in Valiant’s theory. Zbl 1246.68120
Koiran, Pascal; Perifel, Sylvain
4
2011
A dichotomy theorem for polynomial evaluation. Zbl 1250.68123
Briquel, Irénée; Koiran, Pascal
4
2009
VPSPACE and a transfer theorem over the reals. Zbl 1146.68379
Koiran, Pascal; Perifel, Sylvain
4
2007
The quantum query complexity of the abelian hidden subgroup problem. Zbl 1118.68068
Koiran, Pascal; Nesme, Vincent; Portier, Natacha
4
2007
Circuits versus trees in algebraic complexity. Zbl 0959.68045
Koiran, Pascal
4
2000
Complexity and dimension. Zbl 1337.68117
Cucker, Felipe; Koiran, Pascal; Matamala, Martín
4
1997
Elimination of constants from machines over algebraically closed fields. Zbl 0878.68066
Koiran, Pascal
4
1997
Computability properties of low-dimensional dynamical systems. Zbl 0791.68056
Cosnard, Michel; Garzon, Max; Koiran, Pascal
4
1993
A \(\tau \)-conjecture for Newton polygons. Zbl 1327.68135
Koiran, Pascal; Portier, Natacha; Tavenas, Sébastien; Thomassé, Stéphan
3
2015
On the intersection of a sparse curve and a low-degree curve: a polynomial version of the lost theorem. Zbl 1325.14074
Koiran, Pascal; Portier, Natacha; Tavenas, Sébastien
3
2014
Symmetric determinantal representation of formulas and weakly skew circuits. Zbl 1261.68070
Grenet, Bruno; Kaltofen, Erich L.; Koiran, Pascal; Portier, Natacha
3
2011
The complexity of two problems on arithmetic circuits. Zbl 1154.68564
Koiran, Pascal; Perifel, Sylvain
3
2007
A quantum lower bound for the query complexity of Simon’s problem. Zbl 1081.68027
Koiran, Pascal; Nesme, Vincent; Portier, Natacha
3
2005
The limit theory of generic polynomials. Zbl 1081.03034
Koiran, Pascal
3
2005
The theory of Liouville functions. Zbl 1059.03023
Koiran, Pascal
3
2003
Limitation of theories of generic curves. Zbl 1023.03029
Chapuis, Olivier; Hrushovski, Ehud; Koiran, Pascal; Poizat, Bruno
3
2002
Back-and-forth systems for generic curves and a decision algorithm for the limit theory. Zbl 0985.03024
Koiran, Pascal; Portier, Natacha
3
2001
Elimination of parameters in the polynomial hierarchy. Zbl 0913.68081
Koiran, Pascal
3
1999
Vapnik-Chervonenkis dimension of recurrent neural networks. Zbl 0907.68156
Koiran, Pascal; Sontag, Eduardo D.
3
1998
Lower bounds by Birkhoff interpolation. Zbl 1357.41002
García-Marco, Ignacio; Koiran, Pascal
2
2017
VPSPACE and a transfer theorem over the complex field. Zbl 1176.68091
Koiran, Pascal; Perifel, Sylvain
2
2009
On the expressive power of CNF formulas of bounded tree- and clique-width. Zbl 1198.68183
Koiran, Pascal; Meer, Klaus
2
2008
On the construction of a family of transversal subspaces over finite fields. Zbl 1143.15002
Chistov, Alexander; Fournier, Hervé; Koiran, Pascal; Perifel, Sylvain
2
2008
Finding a vector orthogonal to roughly half a collection of vectors. Zbl 1140.65033
Charbit, Pierre; Jeandel, Emmanuel; Koiran, Pascal; Perifel, Sylvain; Thomassé, Stéphan
2
2008
Valiant’s model: from exponential sums to exponential products. Zbl 1132.68414
Koiran, Pascal; Perifel, Sylvain
2
2006
Definability of geometric properties in algebraically closed fields. Zbl 0937.03048
Chapuis, Olivier; Koiran, Pascal
2
1999
The multivariate resultant is NP-hard in any characteristic. Zbl 1287.68056
Grenet, Bruno; Koiran, Pascal; Portier, Natacha
1
2010
Adversary lower bounds for nonadaptive quantum algorithms. Zbl 1206.68127
Koiran, Pascal; Landes, Jürgen; Portier, Natacha; Yao, Penghui
1
2010
Adversary lower bounds for nonadaptive quantum algorithms. Zbl 1155.68398
Koiran, Pascal; Landes, Jürgen; Portier, Natacha; Yao, Penghui
1
2008
A rank theorem for Vandermonde matrices. Zbl 1059.15002
Koiran, Pascal; Portier, Natacha; Villard, Gilles
1
2004
The stability of saturated linear dynamical systems is undecidable. Zbl 0963.93070
Blondel, Vincent D.; Bournez, Olivier; Koiran, Pascal; Tsitsiklis, John N.
1
2000
Lower bounds by Birkhoff interpolation. Zbl 1357.41002
García-Marco, Ignacio; Koiran, Pascal
2
2017
A Wronskian approach to the real \(\tau\)-conjecture. Zbl 1302.68331
Koiran, Pascal; Portier, Natacha; Tavenas, Sébastien
6
2015
Lower bounds for sums of powers of low degree univariates. Zbl 1440.12002
Kayal, Neeraj; Koiran, Pascal; Pecatte, Timothée; Saha, Chandan
5
2015
A \(\tau \)-conjecture for Newton polygons. Zbl 1327.68135
Koiran, Pascal; Portier, Natacha; Tavenas, Sébastien; Thomassé, Stéphan
3
2015
Hidden cliques and the certification of the restricted isometry property. Zbl 1360.94081
Koiran, Pascal; Zouzias, Anastasios
5
2014
On the intersection of a sparse curve and a low-degree curve: a polynomial version of the lost theorem. Zbl 1325.14074
Koiran, Pascal; Portier, Natacha; Tavenas, Sébastien
3
2014
Factoring bivariate lacunary polynomials without heights. Zbl 1360.68926
Chattopadhyay, Arkadev; Grenet, Bruno; Koiran, Pascal; Portier, Natacha; Strozecki, Yann
4
2013
On the complexity of the multivariate resultant. Zbl 1260.14074
Grenet, Bruno; Koiran, Pascal; Portier, Natacha
4
2013
Arithmetic circuits: the chasm at depth four gets wider. Zbl 1253.68139
Koiran, Pascal
28
2012
The limited power of powering: polynomial identity testing and a depth-four lower bound for the permanent. Zbl 1246.68123
Grenet, Bruno; Koiran, Pascal; Portier, Natacha; Strozecki, Yann
5
2011
On the expressive power of CNF formulas of bounded tree- and clique-width. Zbl 1207.05093
Briquel, Irenée; Koiran, Pascal; Meer, Klaus
5
2011
Interpolation in Valiant’s theory. Zbl 1246.68120
Koiran, Pascal; Perifel, Sylvain
4
2011
Symmetric determinantal representation of formulas and weakly skew circuits. Zbl 1261.68070
Grenet, Bruno; Kaltofen, Erich L.; Koiran, Pascal; Portier, Natacha
3
2011
The multivariate resultant is NP-hard in any characteristic. Zbl 1287.68056
Grenet, Bruno; Koiran, Pascal; Portier, Natacha
1
2010
Adversary lower bounds for nonadaptive quantum algorithms. Zbl 1206.68127
Koiran, Pascal; Landes, Jürgen; Portier, Natacha; Yao, Penghui
1
2010
VPSPACE and a transfer theorem over the reals. Zbl 1213.68300
Koiran, Pascal; Perifel, Sylvain
6
2009
A dichotomy theorem for polynomial evaluation. Zbl 1250.68123
Briquel, Irénée; Koiran, Pascal
4
2009
VPSPACE and a transfer theorem over the complex field. Zbl 1176.68091
Koiran, Pascal; Perifel, Sylvain
2
2009
On the expressive power of CNF formulas of bounded tree- and clique-width. Zbl 1198.68183
Koiran, Pascal; Meer, Klaus
2
2008
On the construction of a family of transversal subspaces over finite fields. Zbl 1143.15002
Chistov, Alexander; Fournier, Hervé; Koiran, Pascal; Perifel, Sylvain
2
2008
Finding a vector orthogonal to roughly half a collection of vectors. Zbl 1140.65033
Charbit, Pierre; Jeandel, Emmanuel; Koiran, Pascal; Perifel, Sylvain; Thomassé, Stéphan
2
2008
Adversary lower bounds for nonadaptive quantum algorithms. Zbl 1155.68398
Koiran, Pascal; Landes, Jürgen; Portier, Natacha; Yao, Penghui
1
2008
On the expressive power of planar perfect matching and permanents of bounded treewidth matrices. Zbl 1141.68418
Flarup, Uffe; Koiran, Pascal; Lyaudet, Laurent
10
2007
VPSPACE and a transfer theorem over the reals. Zbl 1146.68379
Koiran, Pascal; Perifel, Sylvain
4
2007
The quantum query complexity of the abelian hidden subgroup problem. Zbl 1118.68068
Koiran, Pascal; Nesme, Vincent; Portier, Natacha
4
2007
The complexity of two problems on arithmetic circuits. Zbl 1154.68564
Koiran, Pascal; Perifel, Sylvain
3
2007
Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields. Zbl 1356.11093
Kaltofen, Erich; Koiran, Pascal
9
2006
Valiant’s model: from exponential sums to exponential products. Zbl 1132.68414
Koiran, Pascal; Perifel, Sylvain
2
2006
Decidable and undecidable problems about quantum automata. Zbl 1078.81012
Blondel, Vincent D.; Jeandel, Emmanuel; Koiran, Pascal; Portier, Natacha
14
2005
Quantum automata and algebraic groups. Zbl 1124.81004
Derksen, Harm; Jeandel, Emmanuel; Koiran, Pascal
13
2005
On the complexity of factoring bivariate supersparse (lacunary) polynomials. Zbl 1356.11092
Kaltofen, Erich; Koiran, Pascal
9
2005
A quantum lower bound for the query complexity of Simon’s problem. Zbl 1081.68027
Koiran, Pascal; Nesme, Vincent; Portier, Natacha
3
2005
The limit theory of generic polynomials. Zbl 1081.03034
Koiran, Pascal
3
2005
Valiant’s model and the cost of computing integers. Zbl 1061.68062
Koiran, Pascal
9
2004
A rank theorem for Vandermonde matrices. Zbl 1059.15002
Koiran, Pascal; Portier, Natacha; Villard, Gilles
1
2004
Vandermonde matrices, NP-completeness and transversal subspaces. Zbl 1050.15001
Chistov, Alexander; Fournier, Hervé; Gurvits, Leonid; Koiran, Pascal
15
2003
The theory of Liouville functions. Zbl 1059.03023
Koiran, Pascal
3
2003
Limitation of theories of generic curves. Zbl 1023.03029
Chapuis, Olivier; Hrushovski, Ehud; Koiran, Pascal; Poizat, Bruno
3
2002
Deciding stability and mortality of piecewise affine dynamical systems. Zbl 0973.68067
Blondel, V. D.; Bournez, O.; Koiran, P.; Papadimitriou, C. H.; Tsitsiklis, J. N.
18
2001
The stability of saturated linear dynamical systems is undecidable. Zbl 0995.03033
Blondel, Vincent D.; Bournez, Olivier; Koiran, Pascal; Tsitsiklis, John N.
11
2001
The topological entropy of iterated piecewise affine maps is uncomputable. Zbl 1112.37301
Koiran, Pascal
5
2001
Back-and-forth systems for generic curves and a decision algorithm for the limit theory. Zbl 0985.03024
Koiran, Pascal; Portier, Natacha
3
2001
Lower bounds are not easier over the reals: Inside PH. Zbl 0973.68081
Fournier, Hervé; Koiran, Pascal
9
2000
Circuits versus trees in algebraic complexity. Zbl 0959.68045
Koiran, Pascal
4
2000
The stability of saturated linear dynamical systems is undecidable. Zbl 0963.93070
Blondel, Vincent D.; Bournez, Olivier; Koiran, Pascal; Tsitsiklis, John N.
1
2000
Closed-form analytic maps in one and two dimensions can simulate universal Turing machines. Zbl 0912.68033
Koiran, Pascal; Moore, Cristopher
21
1999
Saturation and stability in the theory of computation over the reals. Zbl 0930.03044
Chapuis, Olivier; Koiran, Pascal
11
1999
A polynomial time algorithm for diophantine equations in one variable. Zbl 0920.11085
Cucker, Felipe; Koiran, Pascal; Smale, Steve
11
1999
The real dimension problem is \(\text{NP}_{\mathbb R}\)-complete. Zbl 1101.68565
Koiran, Pascal
8
1999
Elimination of parameters in the polynomial hierarchy. Zbl 0913.68081
Koiran, Pascal
3
1999
Definability of geometric properties in algebraically closed fields. Zbl 0937.03048
Chapuis, Olivier; Koiran, Pascal
2
1999
Are lower bounds easier over the reals? Zbl 1028.68051
Fournier, Hervé; Koiran, Pascal
7
1998
Vapnik-Chervonenkis dimension of recurrent neural networks. Zbl 0907.68156
Koiran, Pascal; Sontag, Eduardo D.
3
1998
A weak version of the Blum, Shub, and Smale model. Zbl 0869.68049
Koiran, Pascal
15
1997
Approximation and learning of convex superpositions. Zbl 0880.68105
Gurvits, Leonid; Koiran, Pascal
11
1997
Neural networks with quadratic VC dimension. Zbl 0869.68089
Koiran, Pascal; Sontag, Eduardo D.
8
1997
Complexity and dimension. Zbl 1337.68117
Cucker, Felipe; Koiran, Pascal; Matamala, Martín
4
1997
Elimination of constants from machines over algebraically closed fields. Zbl 0878.68066
Koiran, Pascal
4
1997
Hilbert’s Nullstellensatz is in the polynomial hierarchy. Zbl 0862.68053
Koiran, Pascal
15
1996
A family of universal recurrent networks. Zbl 0874.68250
Koiran, Pascal
5
1996
Computing over the reals with addition and order: Higher complexity classes. Zbl 0843.68033
Cucker, Felipe; Koiran, Pascal
16
1995
On real Turing machines that toss coins. Zbl 0938.68648
Cucker, Felipe; Karpinski, Marek; Koiran, Pascal; Lickteig, Thomas; Werther, Kai
9
1995
Approximating the volume of definable sets. Zbl 0938.68581
Koiran, Pascal
7
1995
Computability with low-dimensional dynamical systems. Zbl 0821.68053
Koiran, Pascal; Cosnard, Michel; Garzon, Max
32
1994
Computing over the reals with addition and order. Zbl 0822.68028
Koiran, P.
21
1994
Computability properties of low-dimensional dynamical systems. Zbl 0791.68056
Cosnard, Michel; Garzon, Max; Koiran, Pascal
4
1993
all top 5

Cited by 367 Authors

35 Koiran, Pascal
14 Cucker, Felipe
13 Meer, Klaus
9 Bournez, Olivier
9 Chistov, Alexandre L.
8 Kayal, Neeraj
8 Kůrková, Věra
8 Portier, Natacha
8 Saha, Chandan
7 Graça, Daniel Silva
7 Potapov, Igor
6 Fournier, Hervé
5 Blondel, Vincent D.
5 Bürgisser, Peter
5 Kainen, Paul C.
5 Kuijpers, Bart H. M.
5 Mahajan, Meena
5 Mengel, Stefan
5 Perifel, Sylvain
5 Raghavendra Rao, B. V.
5 Rojas, J. Maurice
5 Saptharishi, Ramprasad
5 Schmitt, Michael
5 Tavenas, Sébastien
4 Bell, Paul C.
4 Costa, José Félix
4 Gaßner, Christine
4 Grigor’ev, Dmitriĭ Yur’evich
4 Kumar, Mrinal
4 Malod, Guillaume
4 Moore, Cristopher
4 Šíma, Jiří
3 Asarin, Eugene
3 Buescu, Jorge
3 Campagnolo, Manuel Lameiras
3 García-Marco, Ignacio
3 Jeandel, Emmanuel
3 Mycka, Jerzy
3 Pardo, Luis Miguel
3 Pecatte, Timothée
3 Qiu, Daowen
3 Sanguineti, Marcello
3 Say, A. C. Cem
3 Siegelmann, Hava T.
3 Sombra, Martín
3 Sontag, Eduardo D.
3 Tsitsiklis, John N.
3 Vogt, Andrew
3 Yakaryılmaz, Abuzer
3 Zhong, Ning
3 Ziegler, Martin
2 Agrawal, Manindra
2 Avendano, Martin
2 Baartse, Martijn
2 Ben-Hur, Asa
2 Benedikt, Michael A.
2 Bertoni, Alberto
2 Briquel, Irénée
2 Chapuis, Olivier
2 Chen, Jingwei
2 Cheng, Qi
2 Chillara, Suryajith
2 de Graaf, Willem Adriaan
2 Delvenne, Jean-Charles
2 Detinko, Alla S.
2 Durand, Arnaud
2 Engels, Christian
2 Feng, Yong
2 Flannery, Dane Laurence
2 Gamarnik, David
2 Gangloff, Silvère
2 Geerts, Floris
2 Gnang, Edinah K.
2 Grenet, Bruno
2 Grimson, Rafael
2 Heintz, Joos
2 Ikenmeyer, Christian
2 Jansen, Maurice J.
2 Kamath, Pritish
2 Kurganskyy, Oleksiy
2 Landsberg, Joseph Montague
2 Lecerf, Grégoire
2 Li, Lvzhou
2 Limaye, Nutan
2 Maler, Oded
2 Matamala, Martín
2 McCauley, Joseph L.
2 Mereghetti, Carlo
2 Mukhopadhyay, Partha
2 Orponen, Pekka
2 Palano, Beatrice
2 Peatfield, Nick
2 Pnueli, Amir
2 Pouly, Amaury
2 Ressayre, Jean-Pierre
2 Saraf, Shubhangi
2 Saxena, Nitin
2 Semukhin, Pavel
2 Shpilka, Amir
2 Shub, Michael
...and 267 more Authors
all top 5

Cited in 82 Serials

42 Theoretical Computer Science
27 Journal of Complexity
15 Journal of Computer and System Sciences
14 Journal of Symbolic Computation
13 Computational Complexity
10 SIAM Journal on Computing
10 Theory of Computing Systems
9 Information and Computation
9 Journal of Mathematical Sciences (New York)
8 Neural Computation
7 Information Processing Letters
6 Discrete Applied Mathematics
6 Linear Algebra and its Applications
6 Foundations of Computational Mathematics
5 Applied Mathematics and Computation
4 Mathematics of Computation
4 The Journal of Symbolic Logic
4 Annals of Pure and Applied Logic
4 International Journal of Foundations of Computer Science
3 Journal of Approximation Theory
3 Transactions of the American Mathematical Society
3 Neural Networks
3 Mathematical Logic Quarterly (MLQ)
3 Theory of Computing
2 Physica A
2 The Annals of Statistics
2 Automatica
2 Journal of Pure and Applied Algebra
2 European Journal of Combinatorics
2 Advances in Applied Mathematics
2 Systems & Control Letters
2 Discrete & Computational Geometry
2 Journal of the American Mathematical Society
2 Discrete and Continuous Dynamical Systems
2 Chaos
2 Natural Computing
2 Logical Methods in Computer Science
2 Forum of Mathematics, Sigma
1 Acta Mechanica
1 Reviews of Modern Physics
1 Chaos, Solitons and Fractals
1 The Mathematical Intelligencer
1 Acta Arithmetica
1 Advances in Mathematics
1 Computing
1 Journal of Algebra
1 Journal of Computational and Applied Mathematics
1 Michigan Mathematical Journal
1 Ergodic Theory and Dynamical Systems
1 Chinese Annals of Mathematics. Series B
1 Graphs and Combinatorics
1 Computers & Operations Research
1 Queueing Systems
1 Real-Time Systems
1 The Annals of Applied Probability
1 International Journal of Algebra and Computation
1 MSCS. Mathematical Structures in Computer Science
1 Designs, Codes and Cryptography
1 European Journal of Operational Research
1 International Journal of Computer Mathematics
1 Expositiones Mathematicae
1 RAIRO. Informatique Théorique et Applications
1 Archive for Mathematical Logic
1 Applicable Algebra in Engineering, Communication and Computing
1 Computational Optimization and Applications
1 Tatra Mountains Mathematical Publications
1 St. Petersburg Mathematical Journal
1 The Bulletin of Symbolic Logic
1 Mathematical Problems in Engineering
1 European Series in Applied and Industrial Mathematics (ESAIM): Probability and Statistics
1 Journal of the ACM
1 LMS Journal of Computation and Mathematics
1 Annales Henri Poincaré
1 Journal of Systems Science and Complexity
1 JP Journal of Algebra, Number Theory and Applications
1 JMMA. Journal of Mathematical Modelling and Algorithms
1 Computer Languages, Systems & Structures
1 Annali dell’Università di Ferrara. Sezione VII. Scienze Matematiche
1 ACM Communications in Computer Algebra
1 Science China. Mathematics
1 Frontiers of Computer Science in China
1 SIAM Journal on Applied Algebra and Geometry
all top 5

Cited in 39 Fields

229 Computer science (68-XX)
57 Mathematical logic and foundations (03-XX)
37 Field theory and polynomials (12-XX)
29 Algebraic geometry (14-XX)
22 Numerical analysis (65-XX)
21 Commutative algebra (13-XX)
19 Dynamical systems and ergodic theory (37-XX)
18 Combinatorics (05-XX)
18 Number theory (11-XX)
16 Linear and multilinear algebra; matrix theory (15-XX)
15 Group theory and generalizations (20-XX)
14 Quantum theory (81-XX)
14 Operations research, mathematical programming (90-XX)
12 Systems theory; control (93-XX)
11 Information and communication theory, circuits (94-XX)
8 Biology and other natural sciences (92-XX)
7 Ordinary differential equations (34-XX)
5 History and biography (01-XX)
5 Approximations and expansions (41-XX)
4 Difference and functional equations (39-XX)
4 Convex and discrete geometry (52-XX)
4 Probability theory and stochastic processes (60-XX)
4 Statistics (62-XX)
3 Nonassociative rings and algebras (17-XX)
3 Manifolds and cell complexes (57-XX)
2 Real functions (26-XX)
2 Several complex variables and analytic spaces (32-XX)
2 Game theory, economics, finance, and other social and behavioral sciences (91-XX)
1 General and overarching topics; collections (00-XX)
1 Order, lattices, ordered algebraic structures (06-XX)
1 Topological groups, Lie groups (22-XX)
1 Measure and integration (28-XX)
1 Functions of a complex variable (30-XX)
1 Partial differential equations (35-XX)
1 Integral transforms, operational calculus (44-XX)
1 Integral equations (45-XX)
1 Operator theory (47-XX)
1 Calculus of variations and optimal control; optimization (49-XX)
1 Geometry (51-XX)

Citations by Year

Wikidata Timeline

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.