Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Computer Science and Artificial Intelligence Lab (CSAIL)
  3. LCS Publications
  4. LCS Technical Reports (1974 - 2003)
  5. The Complexity of Finite Functions

The Complexity of Finite Functions

Thumbnail Image
Download
Name

MIT-LCS-TR-097.pdf

Size

3.28 MB

Format

Adobe PDF

Checksum (MD5)

a196444bea6277e15fc69d1d55a81d7f

Author(s)
Vilfan, Bostjan
Date Issued
March 1972
Series/Report no.
MIT-LCS-TR-097
MAC-TR-097
Abstract
Lower bounds on the length of formulas for finite functions are obtained from a generalization of a theorem of Specker. Let f: (0,1,...,d-1) [0,1,...,d-1] be a function which can be represented by a formula of length < c.n. For any m, if n is sufficiently large, there is a restriction f': {0,1,...,d-1}m > {0,...,d-1} of f which, is representable by special class of formulas called homogeneous e-complexes.
Persistent DSpace Link
https://hdl.handle.net/1721.1/149409
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.