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
[1]
Hilfe
Suche: Author="B{\"{u}}rgisser, Peter"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Explicit lower bounds via geometric complexity theory
Peter Bürgisser
,
Christian Ikenmeyer
Proceedings of the 45th ACM Symposium on Theory of Computing, STOC'2013 (Palo Alto, California, USA, June 1-4, 2013)
, 2013, pp. 141-150
Geometric complexity theory and tensor rank
Peter Bürgisser
,
Christian Ikenmeyer
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011)
, 2011, pp. 509-518
Solving polynomial equations in smoothed polynomial time and a near solution to Smale's 17th problem
Peter Bürgisser
,
Felipe Cucker
Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC'2010 (Cambridge, Massachusetts, June 5-8, 2010)
, 2010, pp. 503-512
On the complexity of counting components of algebraic varieties
Peter Bürgisser
,
Peter Scheiblechner
Journal Symbolic Computation
44
(9), 2009, pp. 1114-1136
Differential forms in computational algebraic geometry
Peter Bürgisser
,
Peter Scheiblechner
Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation, ISSAC'2007 (Waterloo, Ontario, Canada, July 29 - August 01, 2007)
, 2007, pp. 61-68
Lower bounds on the bounded coefficient complexity of bilinear maps
Peter Bürgisser
,
Martin Lotz
Journal of the ACM
51
(3), 2004, pp. 464-482
Counting complexity classes for numeric computations I: Semilinear sets
Peter Bürgisser
,
Felipe Cucker
SIAM Journal on Computing
33
(1), 2003, pp. 227-260
The computational complexity to evaluate representations of general linear groups
Peter Bürgisser
SIAM Journal on Computing
30
(3), 2000, pp. 1010-1022
The computational complexity of immanants
Peter Bürgisser
SIAM Journal on Computing
30
(3), 2000, pp. 1023-1040