Roots of N - Valued Switching Functions,

Abstract

A root of order u of a transformation f of a finite set is a transformation of this set which iterated for u times gives f. The existence of such roots is discussed. The paper offers a new insight on the existence of square roots of Boolean functions as well as an algorithm for extracting the roots of q - ary,p- valued switching functions. (Author)

Document Details

Document Type
Technical Report
Publication Date
May 01, 1983
Accession Number
ADP002350

Entities

People

  • C. Reischer
  • D. A. Simovici

Organizations

  • UniversitĂ© du QuĂ©bec

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Complex Variables
  • Functions (Mathematics)
  • Mathematics
  • Square Roots
  • Switching

Fields of Study

  • Mathematics

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Linear Algebra