MAC Memos (1963 - 1974): Recent submissions

Now showing items 25-27 of 57

    • Super-exponential Complexity of Presburger Arithmetic 

      Fischer, Michael J.; Rabin, Michael O. (1974-02)
      Lower bounds are established on the computational complexity of the decision problem and on the inherent lengths of proofs for two classical decidable theories of logic: the first order theory of the real numbers under ...

    • On the Complexity of the Theories of Weak Direct Products 

      Rackoff, Charles (1974-01)
      Let N be the set of nonnegative integers and let < N ,+> be the weak direct product of < N,+> with itself. Mostowski[ 9 ] shows that the theory of < N ,*> is decidable, but his decision procedure isn't elementary recursive. ...

    • String-matching and Other Products 

      Fischer, Michael J.; Paterson, Michael S. (1974-01)
      The string-matching problem considered here is to find all occurrences of a given pattern as a substring of another longer string. When the pattern is simply a given string of symbols, there is an algorithm due to Morris, ...