Additional Metadata
THEME Life Sciences (theme 5), Logistics (theme 3)
Publisher Springer
Journal Theory of Computing Systems
Project Quantum Information Processing
Citation
Buhrman, H, Fortnow, L, Koucky, M, Rogers, J, & Vereshchagin, N.K. (2010). Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?. Theory of Computing Systems, 46(1), 143–156.