LCS Technical Memos (1974 - 2003): Recent submissions

Now showing items 310-312 of 486

    • Circuit-size Lower Bounds and Non-reducibility to Sparse Sets 

      Kannan, Ravindran (1981-10)
      As remarked in Cook (1980), we do not know any nonlinear lower bound on the circuit-size of a language in P or even in NP. The best known lower bound seems to be due to Paul (1975). In this paper we show that first for ...

    • On the Expressive Power of Dynamic Logic, II 

      Halpern, Joseph Y. (1981-08)

    • Maclisp Extensions 

      Bawden, Alan; Burke, Glenn S.; Hoffman, Carl W. (1981-07)
      This document describes a common subset of selected facilities available in Maclisp and its derivatives: PDP-10 and Multics Maclisp., List Machine Lisp (Zetalisp), and NIL. The object of this document is to aid people in ...