The Complexity of Finite Functions

Abstract

The topics covered are the length of formulas for finite functions, the order of cyclic perceptrons, and pattern counting machines.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1972
Accession Number
AD0739678

Entities

People

  • Bostjan Vilfan

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • C4I
  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Artificial Intelligence
  • Automata
  • Automata Theory
  • Boundaries
  • Classification
  • Computational Complexity
  • Computations
  • Control Systems
  • Decoding
  • Electrical Engineering
  • Engineering
  • Identities
  • Massachusetts
  • Notation
  • Standards