On a Covering Problem for Partially Specified Switching Functions

Abstract

The author considers the problem of finding the minimum number K(n,c) of total switching functions of n variables necessary to cover the set of all switching functions which are specified in at most c positions. Found were an exact solution of K(n,2) and an upper bound for K(n,c) which is better than a previously known upper bound by an exponential factor.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1974
Accession Number
ADA005691

Entities

People

  • M. Schkolnick

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Abstracts
  • Adaptive Systems
  • Air Force
  • Classification
  • Computer Science
  • Construction
  • Contracts
  • Coverings
  • Polynomials
  • Scientific Research
  • Security
  • Switching
  • Universities
  • Vector Spaces

Fields of Study

  • Mathematics

Readers

  • Graph Algorithms and Convex Optimization.