Formularless Logic Function - Open Journal of Discrete Mathematics

OJDM > Vol.3 No.1, January 2013

Formularless Logic Function ()

HTML XML

Download as PDF (Size: 117KB) PP. 21-24

DOI: 10.4236/ojdm.2013.31005 3,915 Downloads 6,070 Views

Author(s)

Alexey Nikolayevitch Teterin

Affiliation(s)

Izhevsk, Russia.

ABSTRACT

The concept of computability is defined more exactly and illustrated as an example of Boolean functions and cryptanalysis. To define a Boolean function is not necessary to record its formula. To do that the reduced (compact) description of values is determined in the truth table or in the statement of the problem. We obtain estimates of computation time, the volume of a compact descriptions and the range of variables under which it takes the value 0 or 1, depending polynomially on the number of arguments.

KEYWORDS

Complexity of Computation(03D15); Models of Computation(68Q05); Analysis of Algorithms and Problem Complexity(68Q25); Computational Learning Theory(68Q32); Separability; Satisfiability; Fuzziness; Dynamical Systems; Computability

Share and Cite:

A. Teterin, "Formularless Logic Function," Open Journal of Discrete Mathematics, Vol. 3 No. 1, 2013, pp. 21-24. doi: 10.4236/ojdm.2013.31005.

Journals Menu