Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Koiran, Pascal"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Factoring bivariate lacunary polynomials without heights
Arkadev Chattopadhyay
,
Bruno Grenet
,
Pascal Koiran
,
Natacha Portier
,
Yann Strozecki
Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation, ISSAC'2013 (Boston, Massachusetts, USA, June 26-29, 2013)
, 2013, pp. 141-148
On the complexity of the multivariate resultant
Bruno Grenet
,
Pascal Koiran
,
Natacha Portier
Journal of Complexity
29
(2), 2013, pp. 142-157
Upper bounds on real roots and lower bounds for the permanent
Pascal Koiran
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, ISSAC'2012 (Grenoble, France, July 22-25, 2012)
, 2012, pp. 8-8
Arithmetic circuits: The chasm at depth four gets wider
Pascal Koiran
Theoretical Computer Science
448
, 2012, pp. 56-65
Symmetric determinantal representation of weakly-skew circuits
Bruno Grenet
,
Erich L. Kaltofen
,
Pascal Koiran
,
Natacha Portier
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 543-554
The limited power of powering: Polynomial identity testing and a depth-four lower bound for the permanent
Bruno Grenet
,
Pascal Koiran
,
Natacha Portier
,
Yann Strozecki
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 127-139
The multivariate resultant is
NP
-hard in any characteristic
Bruno Grenet
,
Pascal Koiran
,
Natacha Portier
Lecture Notes in Computer Science
6281
, 2010, pp. 477-488
Adversary lower bounds for nonadaptive quantum algorithms
Pascal Koiran
,
Jürgen Landes
,
Natacha Portier
,
Penghui Yao
Journal of Computer and System Sciences
76
(5), 2010, pp. 347-355
A dichotomy theorem for polynomial evaluation
Irénée Briquel
,
Pascal Koiran
Lecture Notes in Computer Science
5734
, 2009, pp. 187-198
VPSPACE and a transfer theorem over the complex field
Pascal Koiran
,
Sylvain Perifel
Theoretical Computer Science
410
(50), 2009, pp. 5244-5251
Finding a vector orthogonal to roughly half a collection of vectors
Pierre Charbit
,
Emmanuel Jeandel
,
Pascal Koiran
,
Sylvain Perifel
,
Stéphan Thomassé
Journal of Complexity
24
(1), 2008, pp. 39-53
Expressing a fraction of two determinants as a determinant
Erich Kaltofen
,
Pascal Koiran
Proceedings of the 2008 International Symposium on Symbolic and Algebraic Computation, ISSAC'2008 (Hagenberg, Austria, July 20-23, 2008)
, 2008, pp. 141-146
On the expressive power of CNF formulas of bounded tree- and clique-width
Pascal Koiran
,
Klaus Meer
Lecture Notes in Computer Science
5344
, 2008, pp. 252-263
On the expressive power of planar perfect matching and permanents of bounded treewidth matrices
Uffe Flarup
,
Pascal Koiran
,
Laurent Lyaudet
Lecture Notes in Computer Science
4835
, 2007, pp. 124-136
The quantum query complexity of the Abelian hidden subgroup problem
Pascal Koiran
,
Vincent Nesme
,
Natacha Portier
Theoretical Computer Science
380
(1-2), 2007, pp. 115-126
VP
SPACE and a transfer theorem over the reals
Pascal Koiran
,
Sylvain Perifel
Lecture Notes in Computer Science
4393
, 2007, pp. 417-428
VPSPACE and a transfer theorem over the complex field
Pascal Koiran
,
Sylvain Perifel
Lecture Notes in Computer Science
4708
, 2007, pp. 359-370
The complexity of two problems on arithmetic circuits
Pascal Koiran
,
Sylvain Perifel
Theoretical Computer Science
389
(1-2), 2007, pp. 172-181
Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields
Erich Kaltofen
,
Pascal Koiran
Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation, ISSAC'2006 (Università degli Studi di Genova, Genova, Italy, July 9-12, 2006)
, 2006, pp. 162-168
Valiant's model: From exponential sums to exponential products
Pascal Koiran
,
Sylvain Perifel
Lecture Notes in Computer Science
4162
, 2006, pp. 596-607
Decidable and undecidable problems about quantum automata
Vincent D. Blondel
,
Emmanuel Jeandel
,
Pascal Koiran
,
Natacha Portier
SIAM Journal on Computing
34
(6), 2005, pp. 1464-1473
Quantum automata and algebraic groups
Harm Derksen
,
Emmanuel Jeandel
,
Pascal Koiran
Journal Symbolic Computation
39
(3-4), 2005, pp. 357-371
A quantum lower bound for the query complexity of Simon's problem
Pascal Koiran
,
Vincent Nesme
,
Natacha Portier
Lecture Notes in Computer Science
3580
, 2005, pp. 1287-1298
On the complexity of factoring bivariate supersparse (lacunary) polynomials
Erich Kaltofen
,
Pascal Koiran
Proceedings of the 2005 International Symposium on Symbolic and Algebraic Computation, ISSAC'2005 (Beijing, China, July 24-27, 2005)
, 2004, pp. 208-215
Transfer theorems via sign conditions
Pascal Koiran
Information Processing Letters
81
(2), 2002, pp. 65-69
Seiten 1
2
3
>