The SCEAS System
| |||||||

## Search the dblp DataBase
Peter Bürgisser:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen
**On the Complexity of Numerical Analysis.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2006, pp:331-339 [Conf] - Peter Bürgisser
**Lower Bounds and Real Algebraic Geometry.**[Citation Graph (0, 0)][DBLP] Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science, 2001, pp:35-54 [Conf] - Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois
**The Complexity of Semilinear Problems in Succinct Representation.**[Citation Graph (0, 0)][DBLP] FCT, 2005, pp:479-490 [Conf] - Peter Bürgisser
**The Complexity of Factors of Multivariate Polynomials.**[Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:378-385 [Conf] - Peter Bürgisser, Martin Lotz
**Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps.**[Citation Graph (0, 0)][DBLP] FOCS, 2002, pp:659-668 [Conf] - Peter Bürgisser, Felipe Cucker
**Counting Complexity Classes over the Reals I: The Additive Case.**[Citation Graph (0, 0)][DBLP] ISAAC, 2003, pp:625-634 [Conf] - Peter Bürgisser
**On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity.**[Citation Graph (0, 0)][DBLP] MFCS, 2001, pp:3-17 [Conf] - Peter Bürgisser
**On the Structure of Valiant's Complexity Classes.**[Citation Graph (0, 0)][DBLP] STACS, 1998, pp:194-204 [Conf] - Peter Bürgisser
**On Defining Integers in the Counting Hierarchy and Proving Arithmetic Circuit Lower Bounds.**[Citation Graph (0, 0)][DBLP] STACS, 2007, pp:133-144 [Conf] - Peter Bürgisser, Felipe Cucker
**Counting complexity classes for numeric computations II: algebraic and semialgebraic sets.**[Citation Graph (0, 0)][DBLP] STOC, 2004, pp:475-485 [Conf] - Peter Bürgisser, Marek Karpinski, Thomas Lickteig
**Some Computational Problems in Linear Algebra as Hard as Matrix Multiplication.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 1991, v:1, n:, pp:131-155 [Journal] - Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois
**The complexity of semilinear problems in succinct representation.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 2006, v:15, n:3, pp:197-235 [Journal] - Peter Bürgisser, Martin Lotz
**Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps**[Citation Graph (0, 0)][DBLP] CoRR, 2003, v:0, n:, pp:- [Journal] - Peter Bürgisser, Felipe Cucker
**Counting complexity classes for numeric computations II: algebraic and semialgebraic sets**[Citation Graph (0, 0)][DBLP] CoRR, 2003, v:0, n:, pp:- [Journal] - Peter Bürgisser
**On the Structure of Valiant's Complexity Classes.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics & Theoretical Computer Science, 1999, v:3, n:3, pp:73-94 [Journal] - Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen
**On the Complexity of Numerical Analysis**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:037, pp:- [Journal] - Peter Bürgisser, Felipe Cucker
**Exotic quantifiers, complexity classes, and complete problems**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:138, pp:- [Journal] - Peter Bürgisser
**The Complexity of Factors of Multivariate Polynomials.**[Citation Graph (0, 0)][DBLP] Foundations of Computational Mathematics, 2004, v:4, n:4, pp:369-396 [Journal] - Peter Bürgisser, Felipe Cucker, Martin Lotz
**Counting Complexity Classes for Numeric Computations. III: Complex Projective Sets.**[Citation Graph (0, 0)][DBLP] Foundations of Computational Mathematics, 2005, v:5, n:4, pp:351-387 [Journal] - Peter Bürgisser, Martin Lotz
**Lower bounds on the bounded coefficient complexity of bilinear maps.**[Citation Graph (0, 0)][DBLP] J. ACM, 2004, v:51, n:3, pp:464-482 [Journal] - Peter Bürgisser, Marek Karpinski, Thomas Lickteig
**On Randomized Semi-algebraic Test Complexity.**[Citation Graph (0, 0)][DBLP] J. Complexity, 1993, v:9, n:2, pp:231-251 [Journal] - Peter Bürgisser, Thomas Lickteig, Michael Shub
**Test complexity of generic polynomials.**[Citation Graph (0, 0)][DBLP] J. Complexity, 1992, v:8, n:3, pp:203-215 [Journal] - Peter Bürgisser
**On the Parallel Complexity of the Polynomial Ideal Membership Problem.**[Citation Graph (0, 0)][DBLP] J. Complexity, 1998, v:14, n:2, pp:176-189 [Journal] - Peter Bürgisser, Felipe Cucker
**Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets.**[Citation Graph (0, 0)][DBLP] J. Complexity, 2006, v:22, n:2, pp:147-191 [Journal] - Peter Bürgisser
**The Computational Complexity to Evaluate Representations of General Linear Groups.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2000, v:30, n:3, pp:1010-1022 [Journal] - Peter Bürgisser
**The Computational Complexity of Immanants.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2000, v:30, n:3, pp:1023-1040 [Journal] - Peter Bürgisser
**Cook's versus Valiant's hypothesis.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2000, v:235, n:1, pp:71-88 [Journal] - Peter Bürgisser, Felipe Cucker
**Exotic Quantifiers, Complexity Classes, and Complete Problems.**[Citation Graph (0, 0)][DBLP] ICALP, 2007, pp:207-218 [Conf] - Peter Bürgisser, Peter Scheiblechner
**Differential forms in computational algebraic geometry.**[Citation Graph (0, 0)][DBLP] ISSAC, 2007, pp:61-68 [Conf] - Peter Bürgisser, Martin Lotz
**The complexity of computing the Hilbert polynomial of smooth equidimensional complex projective varieties**[Citation Graph (0, 0)][DBLP] CoRR, 2005, v:0, n:, pp:- [Journal] - Peter Bürgisser, Martin Lotz
**The Complexity of Computing the Hilbert Polynomial of Smooth Equidimensional Complex Projective Varieties.**[Citation Graph (0, 0)][DBLP] Foundations of Computational Mathematics, 2007, v:7, n:1, pp:59-86 [Journal] **On the Complexity of Numerical Analysis.**[Citation Graph (, )][DBLP]**Solving polynomial equations in smoothed polynomial time and a near solution to smale's 17th problem.**[Citation Graph (, )][DBLP]**On Defining Integers And Proving Arithmetic Circuit Lower Bounds.**[Citation Graph (, )][DBLP]**Counting Irreducible Components of Complex Algebraic Varieties.**[Citation Graph (, )][DBLP]**On defining integers in the counting hierarchy and proving lower bounds in algebraic complexity.**[Citation Graph (, )][DBLP]
Search in 0.020secs, Finished in 0.022secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |