Počet záznamů: 1
Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?
- 1.Buhrman, H. - Fortnow, L. - Koucký, Michal - Rogers, J.D. - Vereshchagin, N.K.
Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?
Theory of Computing Systems. Roč. 46, č. 1 (2010), s. 143-156. ISSN 1432-4350. E-ISSN 1433-0490.
[2nd International Computer Science Symposium in Russia (CSR 2007). Ekaterinburg, 03.09.2007-07.09.2007]
Impakt faktor: 0.600, rok: 2010
http://link.springer.com/article/10.1007%2Fs00224-008-9160-8
http://hdl.handle.net/11104/0192010
Počet záznamů: 1