The complexity of semilinear problems in succinct representation
From MaRDI portal
Publication:862341
DOI10.1007/s00037-006-0213-6zbMath1113.68057OpenAlexW2043457210WikidataQ57733201 ScholiaQ57733201MaRDI QIDQ862341
Paulin Jacobé de Naurois, Peter Bürgisser, Felipe Cucker
Publication date: 24 January 2007
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00037-006-0213-6
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety ⋮ Computational complexity of kernel-based density-ratio estimation: a condition number analysis ⋮ Exotic quantifiers, complexity classes, and complete problems ⋮ On the complexity of counting components of algebraic varieties
This page was built for publication: The complexity of semilinear problems in succinct representation
