Digital Library
Close Browse articles from a journal
 
<< previous    next >>
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
           All articles of the corresponding issues
                                       Details for article 3 of 9 found articles
 
 
  Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?
 
 
Title: Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?
Author: Buhrman, Harry
Fortnow, Lance
Koucký, Michal
Rogers, John D.
Vereshchagin, Nikolay
Appeared in: Theory of computing systems
Paging: Volume 46 (2008) nr. 1 pages 143-156
Year: 2008
Contents:
Publisher: Springer-Verlag, New York
Source file: Elektronische Wetenschappelijke Tijdschriften
 
 

                             Details for article 3 of 9 found articles
 
<< previous    next >>
 
 Koninklijke Bibliotheek - National Library of the Netherlands