Theoretical Foundations of Applied Discrete Mathematics

On lower bounds for complexity over infinite basises for functions of multi-valued logic

A. A. Andreev

Lomonosov Moscow State University, Moscow, Russia

Abstract: The complexity and the depth of multi-valued logic functions realization by formulas and by circuits of functional gates over infinite incomplete basises are estimated. Some examples of infinite basises allowing high (including overexponential) lower bounds for complexity are presented.

Keywords: functions of multi-valued logic, infinite basises, incomplete basises, overexponential complexity bounds, exponential depth bounds.

UDC: 519.7

DOI: 10.17223/20710410/29/1

Bibliographic databases:

•