The (Non)enumerability of the determinant and the rank

DOI10.1007/S00224-003-1091-9zbMath1040.68047OpenAlexW2085244703MaRDI QIDQ1405783

Alina Beygelzimer, Ogihara, Mitsunori

Publication date: 26 August 2003

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-003-1091-9

zbMATH Keywords

enumerative approximation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (2)

On the reducibility of sets inside NP to sets with low information content ⋮ The enumerability of P collapses P to NC

This page was built for publication: The (Non)enumerability of the determinant and the rank