Sciweavers

FCT
2005
Springer
14 years 26 days ago
The Complexity of Semilinear Problems in Succinct Representation
We prove completeness results for twenty-three problems in semilinear geometry. These results involve semilinear sets given by additive circuits as input data. If arbitrary real co...
Peter Bürgisser, Felipe Cucker, Paulin Jacob&...