Peter Bürgisser

Bürgisser at [[Mathematisches Forschungsinstitut Oberwolfach|Oberwolfach]] in 2015 Peter Bürgisser (born 1962) is a Swiss mathematician and theoretical computer scientist who deals with algorithmic algebra and algebraic complexity theory. Provided by Wikipedia
Showing 1 - 4 results of 4 for search 'Peter Bürgisser', query time: 0.04s Refine Results
  1. 1
    On the Structure of Valiant's Complexity Classes

    On the Structure of Valiant's Complexity Classes by Peter Bürgisser

    Published 1999-01-01
    Get full text
    Article
  2. 2
    The complexity of computing Kronecker coefficients

    The complexity of computing Kronecker coefficients by Peter Bürgisser, Christian Ikenmeyer

    Published 2008-01-01
    Get full text
    Article
  3. 3
    A max-flow algorithm for positivity of Littlewood-Richardson coefficients

    A max-flow algorithm for positivity of Littlewood-Richardson coefficients by Peter Bürgisser, Christian Ikenmeyer

    Published 2009-01-01
    Get full text
    Article
  4. 4
    Rigid continuation paths II. structured polynomial systems

    Rigid continuation paths II. structured polynomial systems by Peter Bürgisser, Felipe Cucker, Pierre Lairez

    Published 2023-01-01
    Get full text
    Article

Search Tools: