1. Uwe Schöning (1991). Computational Complexity Theory, Edited by Hartmanis Juris, Proceedings of Symposia in Applied Mathematics, Vol. 38, American Mathematical Society, Providence 1989, Ix+ 128 Pp. [REVIEW] Journal of Symbolic Logic 56 (1):335-336.
    Direct download  
     
    My bibliography  
     
    Export citation  
  2. Uwe Schoning (1991). Review: Juris Hartmanis, Computational Complexity Theory. [REVIEW] Journal of Symbolic Logic 56 (1):335-336.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  3. Uwe Schöning (1989). Logic for Computer Scientists. Birkhäuser.
    This book introduces the notions and methods of formal logic from a computer science standpoint, covering propositional logic, predicate logic, and foundations ...
    Direct download  
     
    My bibliography  
     
    Export citation