The following pages link to Markus Bläser (Q172539):
Displaying 50 items.
- Complexity and approximability of the cover polynomial (Q445242) (← links)
- Fast evaluation of interlace polynomials on graphs of bounded treewidth (Q634679) (← links)
- Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems (Q833572) (← links)
- Private computation: \(k\)-connected versus 1-connected networks (Q850501) (← links)
- An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality (Q866548) (← links)
- (Q927407) (redirect page) (← links)
- Approximately fair cost allocation in metric traveling salesman games (Q927408) (← links)
- Deterministically testing sparse polynomial identities of unbounded degree (Q976069) (← links)
- Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions (Q987376) (← links)
- Computing small partial coverings (Q1007552) (← links)
- Semisimple algebras of almost minimal rank over the reals (Q1034526) (← links)
- On the complexity of the multiplication of matrices of small formats (Q1394936) (← links)
- The complexity of bivariate power series arithmetic. (Q1401232) (← links)
- Lower bounds for the multiplicative complexity of matrix multiplication (Q1590075) (← links)
- Uniform computational complexity of the derivatives of \(C^{\infty}\)-functions. (Q1607286) (← links)
- On the multiplicative complexity of the inversion and division of Hamiltonian quaternions (Q1611099) (← links)
- Ulrich complexity (Q1679674) (← links)
- Testing polynomial equivalence by scaling matrices (Q1679963) (← links)
- Beyond the Alder-Strassen bound. (Q1770421) (← links)
- Smoothed analysis of partitioning algorithms for Euclidean functionals (Q1950395) (← links)
- Noncommutativity makes determinants hard (Q2347802) (← links)
- Adding cardinality constraints to integer programs with applications to maximum satisfiability (Q2380072) (← links)
- On the number of multiplications needed to invert a monic power series over fields of characteristic two (Q2387412) (← links)
- Privacy in non-private environments (Q2429730) (← links)
- Approximating maximum weight cycle covers in directed graphs with weights zero and one (Q2483998) (← links)
- (Q2762793) (← links)
- Explicit Tensors (Q2821697) (← links)
- A Probabilistic Analysis of Christofides’ Algorithm (Q2904559) (← links)
- The Complexity of the Cover Polynomials for Planar Graphs of Bounded Degree (Q3088032) (← links)
- Randomness efficient testing of sparse black box identities of unbounded degree over the reals (Q3113719) (← links)
- A new deterministic algorithm for sparse multivariate polynomial interpolation (Q3452377) (← links)
- Complexity of the Bollobás-Riordan Polynomial (Q3503627) (← links)
- Asymptotically Optimal Hitting Sets Against Polynomials (Q3521931) (← links)
- Semisimple Algebras of Almost Minimal Rank over the Reals (Q3525610) (← links)
- Approximating Multi-criteria Max-TSP (Q3541086) (← links)
- Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth (Q3639277) (← links)
- (Q4409119) (← links)
- (Q4411276) (← links)
- (Q4418668) (← links)
- (Q4425953) (← links)
- (Q4449172) (← links)
- (Q4471353) (← links)
- (Q4535011) (← links)
- (Q4551338) (← links)
- A deterministic PTAS for the commutative rank of matrix spaces (Q4568108) (← links)
- On degeneration of tensors and algebras (Q4608578) (← links)
- The border support rank of two-by-two matrix multiplication is seven (Q4615808) (← links)
- A Complete Characterization of the Algebras of Minimal Bilinear Complexity (Q4651535) (← links)
- (Q4779144) (← links)
- (Q4796188) (← links)
