We are experiencing some difficulties with our submission forms, which we are working to resolve. If you have any issues, please contact us at dspace-lib@mit.edu.

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
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.