Pascal Koiran - RankMe

143 papers A* 9A 9B 14C 3Journal 99Unranked 9

Year	Rank	Type	Title / Venue / Authors
2025	A*	`conf`	An Efficient Uniqueness Theorem for Overcomplete Tensor Decomposition. SODA Pascal Koiran
2025	J	`jnl`	Complete decomposition of symmetric tensors in linear time and polylogarithmic precision. Theor. Comput. Sci. Pascal Koiran, Subhayan Saha
2025	J	`jnl`	Tensor decomposition beyond uniqueness, with an application to the minrank problem. CoRR Pascal Koiran, Rafael Oliveira
2024	J	`jnl`	An efficient uniqueness theorem for overcomplete tensor decomposition. CoRR Pascal Koiran
2024	J	`jnl`	On the uniqueness and computation of commuting extensions. CoRR Pascal Koiran
2024	J	`jnl`	Undercomplete Decomposition of Symmetric Tensors in Linear Time, and Smoothed Analysis of the Condition Number. CoRR Pascal Koiran, Subhayan Saha
2023	J	`jnl`	Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond. Comput. Complex. Pascal Koiran, Subhayan Saha
2023	C	`conf`	Complete Decomposition of Symmetric Tensors in Linear Time and Polylogarithmic Precision. CIAC Pascal Koiran, Subhayan Saha
2022	—	`conf`	Black Box Absolute Reconstruction for Sums of Powers of Linear Forms. FSTTCS Pascal Koiran, Subhayan Saha
2022	J	`jnl`	Complete Decomposition of Symmetric Tensors in Linear Time and Polylogarithmic Precision. CoRR Pascal Koiran, Subhayan Saha
2021	J	`jnl`	Black Box Absolute Reconstruction for Sums of Powers of Linear Forms. CoRR Pascal Koiran, Subhayan Saha
2021	J	`jnl`	Computing the multilinear factors of lacunary polynomials without heights. J. Symb. Comput. Arkadev Chattopadhyay, Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki
2021	J	`jnl`	Derandomization and absolute reconstruction for sums of powers of linear forms. Theor. Comput. Sci. Pascal Koiran, Mateusz Skomra
2020	J	`jnl`	On tensor rank and commuting matrices. CoRR Pascal Koiran
2020	J	`jnl`	Reconstruction algorithms for sums of affine powers. J. Symb. Comput. Ignacio García-Marco, Pascal Koiran, Timothée Pecatte
2019	J	`jnl`	Derandomization and absolute reconstruction for sums of powers of linear forms. CoRR Pascal Koiran, Mateusz Skomra
2019	J	`jnl`	Intersection multiplicity of a sparse curve and a low-degree curve. CoRR Pascal Koiran, Mateusz Skomra
2019	J	`jnl`	Orthogonal tensor decomposition and orbit closures from a linear algebraic perspective. CoRR Pascal Koiran
2019	J	`jnl`	Root separation for trinomials. J. Symb. Comput. Pascal Koiran
2018	J	`jnl`	On the linear independence of shifted powers. J. Complex. Pascal Koiran, Timothée Pecatte, Ignacio García-Marco
2018	J	`jnl`	Orbits of monomials and factorization into products of linear forms. CoRR Pascal Koiran, Nicolas Ressayre
2018	B	`conf`	Polynomial Equivalence Problems for Sum of Affine Powers. ISSAC Ignacio García-Marco, Pascal Koiran, Timothée Pecatte
2017	J	`jnl`	Lower bounds by Birkhoff interpolation. J. Complex. Ignacio García-Marco, Pascal Koiran
2017	A	`conf`	On the Complexity of Partial Derivatives. STACS Ignacio García-Marco, Pascal Koiran, Timothée Pecatte, Stéphan Thomassé
2017	J	`jnl`	On the linear independence of shifted powers. CoRR Ignacio García-Marco, Pascal Koiran, Timothée Pecatte
2017	B	`conf`	Reconstruction Algorithms for Sums of Affine Powers. ISSAC Ignacio García-Marco, Pascal Koiran, Timothée Pecatte
2017	J	`jnl`	Root Separation for Trinomials. CoRR Pascal Koiran
2016	J	`jnl`	On the complexity of partial derivatives. CoRR Ignacio García-Marco, Pascal Koiran, Timothée Pecatte, Stéphan Thomassé
2016	J	`jnl`	Reconstruction Algorithms for Sums of Affine Powers. CoRR Ignacio García-Marco, Pascal Koiran, Timothée Pecatte
2015	J	`jnl`	A $$\tau $$ τ -Conjecture for Newton Polygons. Found. Comput. Math. Pascal Koiran, Natacha Portier, Sébastien Tavenas, Stéphan Thomassé
2015	J	`jnl`	A Wronskian approach to the real τ-conjecture. J. Symb. Comput. Pascal Koiran, Natacha Portier, Sébastien Tavenas
2015	—	`conf`	Log-Concavity and Lower Bounds for Arithmetic Circuits. MFCS (2) Ignacio García-Marco, Pascal Koiran, Sébastien Tavenas
2015	J	`jnl`	Log-concavity and lower bounds for arithmetic circuits. CoRR Ignacio García-Marco, Pascal Koiran, Sébastien Tavenas
2015	J	`jnl`	Lower Bounds by Birkhoff Interpolation. CoRR Ignacio García-Marco, Pascal Koiran
2015	—	`conf`	Lower Bounds for Sums of Powers of Low Degree Univariates. ICALP (1) Neeraj Kayal, Pascal Koiran, Timothée Pecatte, Chandan Saha
2015	J	`jnl`	On the Intersection of a Sparse Curve and a Low-Degree Curve: A Polynomial Version of the Lost Theorem. Discret. Comput. Geom. Pascal Koiran, Natacha Portier, Sébastien Tavenas
2014	J	`jnl`	Hidden Cliques and the Certification of the Restricted Isometry Property. IEEE Trans. Inf. Theory Pascal Koiran, Anastasios Zouzias
2013	J	`jnl`	A tau-conjecture for Newton polygons. CoRR Pascal Koiran, Natacha Portier, Sébastien Tavenas, Stéphan Thomassé
2013	J	`jnl`	Computational Counting (Dagstuhl Seminar 13031). Dagstuhl Reports Peter Bürgisser, Leslie Ann Goldberg, Mark Jerrum, Pascal Koiran
2013	J	`jnl`	Computing the multilinear factors of lacunary polynomials without heights. CoRR Arkadev Chattopadhyay, Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki
2013	J	`jnl`	Counting Tropically Degenerate Valuations and p-adic Approaches to the Hardness of the Permanent. CoRR Pascal Koiran, Natacha Portier, J. Maurice Rojas
2013	B	`conf`	Factoring bivariate lacunary polynomials without heights. ISSAC Arkadev Chattopadhyay, Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki
2013	J	`jnl`	On the complexity of the multivariate resultant. J. Complex. Bruno Grenet, Pascal Koiran, Natacha Portier
2013	J	`jnl`	On the intersection of a sparse curve and a low-degree curve: A polynomial version of the lost theorem. CoRR Pascal Koiran, Natacha Portier, Sébastien Tavenas
2012	J	`jnl`	A Wronskian Approach to the real τ-conjecture CoRR Pascal Koiran, Natacha Portier, Sébastien Tavenas
2012	J	`jnl`	Arithmetic circuits: The chasm at depth four gets wider. Theor. Comput. Sci. Pascal Koiran
2012	J	`jnl`	Factoring bivariate lacunary polynomials without heights CoRR Arkadev Chattopadhyay, Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki
2012	J	`jnl`	Hidden cliques and the certification of the restricted isometry property CoRR Pascal Koiran, Anastasios Zouzias
2012	J	`jnl`	On the Complexity of the Multivariate Resultant CoRR Bruno Grenet, Pascal Koiran, Natacha Portier
2012	B	`conf`	Upper bounds on real roots and lower bounds for the permanent. ISSAC Pascal Koiran
2011	J	`jnl`	Interpolation in Valiant's Theory. Comput. Complex. Pascal Koiran, Sylvain Perifel
2011	J	`jnl`	On the Certification of the Restricted Isometry Property CoRR Pascal Koiran, Anastasios Zouzias
2011	J	`jnl`	On the expressive power of CNF formulas of bounded tree- and clique-width. Discret. Appl. Math. Irénée Briquel, Pascal Koiran, Klaus Meer
2011	A	`conf`	Shallow circuits with high-powered inputs. ICS Pascal Koiran
2011	A	`conf`	Symmetric Determinantal Representation of Weakly-Skew Circuits. STACS Bruno Grenet, Erich L. Kaltofen, Pascal Koiran, Natacha Portier
2011	J	`jnl`	The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the Permanent CoRR Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki
2011	—	`conf`	The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the Permanent. FSTTCS Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki
2010	J	`jnl`	Adversary lower bounds for nonadaptive quantum algorithms. J. Comput. Syst. Sci. Pascal Koiran, Jürgen Landes, Natacha Portier, Penghui Yao
2010	J	`jnl`	Arithmetic circuits: the chasm at depth four gets wider CoRR Pascal Koiran
2010	J	`jnl`	Shallow Circuits with High-Powered Inputs CoRR Pascal Koiran
2010	J	`jnl`	Symmetric Determinantal Representation of Formulas and Weakly Skew Circuits CoRR Bruno Grenet, Erich L. Kaltofen, Pascal Koiran, Natacha Portier
2010	B	`conf`	The Multivariate Resultant Is NP-hard in Any Characteristic. MFCS Bruno Grenet, Pascal Koiran, Natacha Portier
2009	B	`conf`	A Dichotomy Theorem for Polynomial Evaluation. MFCS Irénée Briquel, Pascal Koiran
2009	J	`jnl`	A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent CoRR Pascal Koiran, Sylvain Perifel
2009	A	`conf`	A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent. CCC Pascal Koiran, Sylvain Perifel
2009	J	`jnl`	A hitting set construction, with application to arithmetic circuit lower bounds CoRR Pascal Koiran
2009	J	`jnl`	The multivariate resultant lies between NP and AM CoRR Bruno Grenet, Pascal Koiran, Natacha Portier
2009	J	`jnl`	Toward a Dichotomy Theorem for Polynomial Evaluation CoRR Irénée Briquel, Pascal Koiran
2009	J	`jnl`	VPSPACE and a Transfer Theorem over the Reals. Comput. Complex. Pascal Koiran, Sylvain Perifel
2009	J	`jnl`	VPSPACE and a transfer theorem over the complex field. Theor. Comput. Sci. Pascal Koiran, Sylvain Perifel
2008	C	`conf`	Adversary Lower Bounds for Nonadaptive Quantum Algorithms. WoLLIC Pascal Koiran, Jürgen Landes, Natacha Portier, Penghui Yao
2008	J	`jnl`	Adversary lower bounds for nonadaptive quantum algorithms CoRR Pascal Koiran, Jürgen Landes, Natacha Portier, Penghui Yao
2008	B	`conf`	Expressing a fraction of two determinants as a determinant. ISSAC Erich L. Kaltofen, Pascal Koiran
2008	J	`jnl`	Finding a vector orthogonal to roughly half a collection of vectors. J. Complex. Pierre Charbit, Emmanuel Jeandel, Pascal Koiran, Sylvain Perifel, Stéphan Thomassé
2008	B	`conf`	On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width. WG Pascal Koiran, Klaus Meer
2007	C	`conf`	Decision Versus Evaluation in Algebraic Complexity. MCU Pascal Koiran
2007	J	`jnl`	Interpolation in Valiant's theory CoRR Pascal Koiran, Sylvain Perifel
2007	B	`conf`	On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices. ISAAC Uffe Flarup, Pascal Koiran, Laurent Lyaudet
2007	J	`jnl`	On the expressive power of planar perfect matching and permanents of bounded treewidth matrices CoRR Laurent Lyaudet, Pascal Koiran, Uffe Flarup
2007	J	`jnl`	The complexity of two problems on arithmetic circuits. Theor. Comput. Sci. Pascal Koiran, Sylvain Perifel
2007	J	`jnl`	The quantum query complexity of the abelian hidden subgroup problem. Theor. Comput. Sci. Pascal Koiran, Vincent Nesme, Natacha Portier
2007	B	`conf`	VPSPACE and a Transfer Theorem over the Complex Field. MFCS Pascal Koiran, Sylvain Perifel
2007	A	`conf`	VPSPACE and a Transfer Theorem over the Reals. STACS Pascal Koiran, Sylvain Perifel
2007	J	`jnl`	VPSPACE and a transfer theorem over the complex field CoRR Pascal Koiran, Sylvain Perifel
2006	B	`conf`	Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields. ISSAC Erich L. Kaltofen, Pascal Koiran
2006	J	`jnl`	VPSPACE and a Transfer Theorem over the Reals CoRR Pascal Koiran, Sylvain Perifel
2006	B	`conf`	Valiant's Model: From Exponential Sums to Exponential Products. MFCS Pascal Koiran, Sylvain Perifel
2005	A*	`conf`	A Quantum Lower Bound for the Query Complexity of Simon's Problem. ICALP Pascal Koiran, Vincent Nesme, Natacha Portier
2005	J	`jnl`	A quantum lower bound for the query complexity of Simon's problem CoRR Pascal Koiran, Vincent Nesme, Natacha Portier
2005	J	`jnl`	Decidable and Undecidable Problems about Quantum Automata. SIAM J. Comput. Vincent D. Blondel, Emmanuel Jeandel, Pascal Koiran, Natacha Portier
2005	J	`jnl`	Guest editors' preface. J. Complex. Askold Khovanskii, Pascal Koiran, Teresa Krick, Gregorio Malajovich, Joseph F. Traub
2005	B	`conf`	On the complexity of factoring bivariate supersparse (Lacunary) polynomials. ISSAC Erich L. Kaltofen, Pascal Koiran
2005	J	`jnl`	Quantum automata and algebraic groups. J. Symb. Comput. Harm Derksen, Emmanuel Jeandel, Pascal Koiran
2005	J	`jnl`	Valiant's model and the cost of computing integers. Comput. Complex. Pascal Koiran
2004	J	`jnl`	Valiant's model and the cost of computing integers Electron. Colloquium Comput. Complex. Pascal Koiran
2003	J	`jnl`	The theory of Liouville functions. J. Symb. Log. Pascal Koiran
2003	J	`jnl`	Vandermonde Matrices, NP-Completeness, and Transversal Subspaces. Found. Comput. Math. Alexander L. Chistov, Hervé Fournier, Leonid Gurvits, Pascal Koiran
2002	J	`jnl`	La Limite des Theories de Courbes Generiques. J. Symb. Log. Olivier Chapuis, Ehud Hrushovski, Pascal Koiran, Bruno Poizat
2002	J	`jnl`	Transfer theorems via sign conditions. Inf. Process. Lett. Pascal Koiran
2001	J	`jnl`	Back-and-forth systems for generic curves and a decision algorithm for the limit theory. Ann. Pure Appl. Log. Pascal Koiran, Natacha Portier
2001	J	`jnl`	Deciding stability and mortality of piecewise affine dynamical systems. Theor. Comput. Sci. Vincent D. Blondel, Olivier Bournez, Pascal Koiran, Christos H. Papadimitriou, John N. Tsitsiklis
2001	J	`jnl`	The Stability of Saturated Linear Dynamical Systems Is Undecidable. J. Comput. Syst. Sci. Vincent D. Blondel, Olivier Bournez, Pascal Koiran, John N. Tsitsiklis
2001	J	`jnl`	The topological entropy of iterated piecewise affine maps is uncomputable. Discret. Math. Theor. Comput. Sci. Pascal Koiran
2000	A	`conf`	Circuits versus Trees in Algebraic Complexity. STACS Pascal Koiran
2000	J	`jnl`	Guest Editors' Preface. J. Complex. Jean-Pierre Dedieu, Pascal Koiran
2000	A*	`conf`	Lower Bounds Are Not Easier over the Reals: Inside PH. ICALP Hervé Fournier, Pascal Koiran
2000	J	`jnl`	The Complexity of Local Dimensions for Constructible Sets. J. Complex. Pascal Koiran
2000	A	`conf`	The Stability of Saturated Linear Dynamical Systems Is Undecidable. STACS Vincent D. Blondel, Olivier Bournez, Pascal Koiran, John N. Tsitsiklis
1999	J	`jnl`	A Polynomial Time Algorithm for Diophantine Equations in One Variable. J. Symb. Comput. Felipe Cucker, Pascal Koiran, Steve Smale
1999	J	`jnl`	Closed-for Analytic Maps in One and Two Dimensions can Simulate Universal Turing Machines. Theor. Comput. Sci. Pascal Koiran, Cristopher Moore
1999	J	`jnl`	Definability of Geometric Properties in Algebraically Closed Fields. Math. Log. Q. Olivier Chapuis, Pascal Koiran
1999	J	`jnl`	Elimination of Parameters in the Polynomial Hierarchy. Theor. Comput. Sci. Pascal Koiran
1999	J	`jnl`	Saturation and Stability in the Theory of Computation over the Reals. Ann. Pure Appl. Log. Olivier Chapuis, Pascal Koiran
1999	J	`jnl`	The Real Dimension Problem Is NPR-Complete. J. Complex. Pascal Koiran
1998	A*	`conf`	Are Lower Bounds Easier over the Reals? STOC Hervé Fournier, Pascal Koiran
1998	J	`jnl`	Vapnik-Chervonenkis Dimension of Recurrent Neural Networks. Discret. Appl. Math. Pascal Koiran, Eduardo D. Sontag
1997	J	`jnl`	A Weak Version of the Blum, Shub, and Smale Model. J. Comput. Syst. Sci. Pascal Koiran
1997	J	`jnl`	Approximation and Learning of Convex Superpositions. J. Comput. Syst. Sci. Leonid Gurvits, Pascal Koiran
1997	J	`jnl`	Complexity and Dimension. Inf. Process. Lett. Felipe Cucker, Pascal Koiran, Martín Matamala
1997	J	`jnl`	Elimination of Constants from Machines over Algebraically Closed Fields. J. Complex. Pascal Koiran
1997	J	`jnl`	Neural Networks with Quadratic VC Dimension. J. Comput. Syst. Sci. Pascal Koiran, Eduardo D. Sontag
1997	A*	`conf`	Randomized and Deterministic Algorithms for the Dimension of Algebraic Varieties. FOCS Pascal Koiran
1997	—	`conf`	Vapnik-Chervonenkis Dimension of Recurrent Neural Networks. EuroCOLT Pascal Koiran, Eduardo D. Sontag
1996	J	`jnl`	A Family of Universal Recurrent Networks. Theor. Comput. Sci. Pascal Koiran
1996	J	`jnl`	Hilbert's Nullstellensatz Is in the Polynomial Hierarchy. J. Complex. Pascal Koiran
1996	A	`conf`	VC Dimension in Circuit Complexity. CCC Pascal Koiran
1995	A*	`conf`	Approximating the Volume of Definable Sets. FOCS Pascal Koiran
1995	—	`conf`	Approximation and learning of convex superpositions. EuroCOLT Leonid Gurvits, Pascal Koiran
1995	J	`jnl`	Computing over the Reals with Addition and Order: Higher Complexity Classes. J. Complex. Felipe Cucker, Pascal Koiran
1995	—	`conf`	Neural Networks with Quadratic VC Dimension. NIPS Pascal Koiran, Eduardo D. Sontag
1995	A*	`conf`	On real Turing machines that toss coins. STOC Felipe Cucker, Marek Karpinski, Pascal Koiran, Thomas Lickteig, Kai Werther
1995	J	`jnl`	VC Dimension in Circuit Complexity Electron. Colloquium Comput. Complex. Pascal Koiran
1994	J	`jnl`	Bounds on the Number of Units for Computing Arbitrary Dichotomies by Multilayer Perceptrons. J. Complex. Michel Cosnard, Pascal Koiran, Hélène Paugam-Moisy
1994	J	`jnl`	Computability with Low-Dimensional Dynamical Systems. Theor. Comput. Sci. Pascal Koiran, Michel Cosnard, Max H. Garzon
1994	J	`jnl`	Computing over the Reals with Addition and Order. Theor. Comput. Sci. Pascal Koiran
1994	J	`jnl`	Dynamics of Discrete Time, Continuous State Hopfield Networks. Neural Comput. Pascal Koiran
1994	A*	`conf`	Efficient Learning of Continuous Neural Networks. COLT Pascal Koiran
1993	A*	`conf`	A Weak Version of the Blum, Shub & Smale model FOCS Pascal Koiran
1993	A	`conf`	Computability Properties of Low-dimensional Dynamical Systems. STACS Michel Cosnard, Max H. Garzon, Pascal Koiran
1993	J	`jnl`	On the complexity of approximating mappings using feedforward networks. Neural Networks Pascal Koiran
1992	B	`conf`	Complexity Issues in Neural Network Computations. LATIN Michel Cosnard, Pascal Koiran, Hélène Paugam-Moisy
1992	—	`conf`	Relations between Models of Parallel Abstract Machines. Heinz Nixdorf Symposium Michel Cosnard, Pascal Koiran
1991	—	`conf`	Meta-Level Interpretation of CLP(Lists). WCLP Jacques Cohen, Pascal Koiran, Catherine Perrin