The following pages link to Peter Bürgisser (Q254894):
Displaying 50 items.
- Distribution of the eigenvalues of a random system of homogeneous polynomials (Q254895) (← links)
- Condition length and complexity for the solution of polynomial systems (Q506608) (← links)
- Fundamental invariants of orbit closures (Q517074) (← links)
- Even partitions in plethysms. (Q536182) (← links)
- Nonvanishing of Kronecker coefficients for rectangular shapes. (Q549219) (← links)
- Counting irreducible components of complex algebraic varieties (Q623497) (← links)
- On defining integers and proving arithmetic circuit lower bounds (Q626611) (← links)
- On a problem posed by Steve Smale (Q661924) (← links)
- Robust smoothed analysis of a condition number for linear programming (Q662310) (← links)
- Some computational problems in linear algebra as hard as matrix multiplication (Q685718) (← links)
- Permanent versus determinant, obstructions, and Kronecker coefficients (Q726486) (← links)
- Correction to: ``The complexity of factors of multivariate polynomials'' (Q827013) (← links)
- The complexity of semilinear problems in succinct representation (Q862341) (← links)
- Smoothed analysis of complex conic condition numbers (Q864180) (← links)
- The complexity of computing the Hilbert polynomial of smooth equidimensional complex projective varieties (Q870482) (← links)
- Coverage processes on spheres and condition numbers for linear programming (Q964778) (← links)
- Exotic quantifiers, complexity classes, and complete problems (Q1022429) (← links)
- On the complexity of counting components of algebraic varieties (Q1030247) (← links)
- Test complexity of generic polynomials (Q1201154) (← links)
- Verification complexity of linear prime ideals (Q1207526) (← links)
- On randomized semi-algebraic test complexity (Q1260656) (← links)
- On the parallel complexity of the polynomial ideal membership problem (Q1271168) (← links)
- Algebraic complexity theory. I: An introduction (Q1380696) (← links)
- Algebraic complexity theory. II: Tast matrix multiplication and combinatorics. (Q1380697) (← links)
- Completeness and reduction in algebraic complexity theory (Q1567446) (← links)
- A stable, polynomial-time algorithm for the eigenpair problem (Q1644000) (← links)
- The complexity of factors of multivariate polynomials (Q1764397) (← links)
- The complexity to compute the Euler characteristic of complex varieties (Q1886973) (← links)
- Cook's versus Valiant's hypothesis (Q1978701) (← links)
- Computing the homology of semialgebraic sets. II: General formulas (Q2052718) (← links)
- The zonoid algebra, generalized mixed volumes, and random determinants (Q2136565) (← links)
- Computing the homology of semialgebraic sets. I: Lax formulas (Q2291730) (← links)
- Probabilistic Schubert calculus (Q2303066) (← links)
- Probabilistic analysis of the Grassmann condition number (Q2340501) (← links)
- On the condition of the zeros of characteristic polynomials (Q2402421) (← links)
- Average Euler characteristic of random real algebraic varieties (Q2464262) (← links)
- Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets (Q2489141) (← links)
- General formulas for the smoothed analysis of condition numbers (Q2499745) (← links)
- Counting complexity classes for numeric computations. III: Complex projective sets (Q2505650) (← links)
- Intrinsic volumes of symmetric cones and applications in convex programming (Q2515035) (← links)
- Computing the Chow Variety of Quadratic Space Curves (Q2807825) (← links)
- Condition (Q2837795) (← links)
- Solving polynomial equations in smoothed polynomial time and a near solution to smale's 17th problem (Q2875178) (← links)
- Permanent versus determinant: Not via saturations (Q2951164) (← links)
- Smoothed Analysis of Moore–Penrose Inversion (Q3079770) (← links)
- An Overview of Mathematical Issues Arising in the Geometric Complexity Theory Approach to $\mathbf{VP}\neq\mathbf{VNP}$ (Q3096098) (← links)
- (Q3096710) (← links)
- (Q3176573) (← links)
- The probability that a slightly perturbed numerical analysis problem is difficult (Q3577011) (← links)
- Counting complexity classes for numeric computations II (Q3580991) (← links)
