Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Bläser, Markus - Department of Informatics, Universität des Saarlandes
Complete Problems for Valiant's Class of qpComputable Families of Polynomials
SIIM TR A 0209 SIIM Technical Report
SIIM TR A 0113 SIIM Technical Report
n 2 --Lower Bound for the Rank of n n--Matrix Multiplication over Arbitrary Fields
SIIM TR A 0221 SIIM Technical Report
Algebras of Minimal Rank over Perfect Fields Markus Blaser
Bivariate Polynomial Multiplication \Lambda Markus Blaser
Algebras of Minimal Rank over Arbitrary Fields Markus Blaser
Improvements of the Alder--Strassen Bound: Algebras with Nonzero Radical
SIIM TR A 0302 SIIM Technical Report
Untere Schranken f ur den Rang assoziativer Algebren
Approximate Budget Balanced Mechanisms with Low Communication Costs for the Multicast Cost-Sharing Problem
13 Approximation Algorithm for the Asymmetric Maximum TSP Markus Blaser \Lambda
SIIM TR A 0220 SIIM Technical Report
Two Approximation Algorithms for 3Cycle Covers
Computing Reciprocals of Bivariate Power Series Markus Blaser
An Improved Approximation Algorithm for the Asymmetric TSP with
Improved Approximation Algorithms for Max2SAT with Cardinality Constraint
Computing Cycle Covers without Short Cycles Markus Blaser and Bodo Siebert ?
Budget Balanced Mechanisms for the Multicast Pricing Problem with Rates
2 n 2 --Lower Bound for the Multiplicative Complexity of
A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One
