Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?

2010

Theory of Computing Systems , Volume 46 - Issue 1 p. 143- 156

Additional Metadata
THEME	Life Sciences (theme 5), Logistics (theme 3)
Publisher	Springer
Journal	Theory of Computing Systems
Project	Quantum Information Processing
Organisation	Algorithms and Complexity
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Buhrman, H., Fortnow, L., Koucký, 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.

Publication