Number of the records: 1  

Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?

  1. 1.
    BUHRMAN, H., FORTNOW, L., KOUCKÝ, M., ROGERS, J.D., VERESHCHAGIN, N.K. Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible? Theory of Computing Systems. 2010, 46(1), 143-156. ISSN 1432-4350. E-ISSN 1433-0490. Available: doi: 10.1007/s00224-008-9160-8.
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.