Formularless Logic Function  

作　　者：Alexey Nikolayevitch Teterin 

机构地区：[1]Izhevsk, Russia

出　　处：《Open Journal of Discrete Mathematics》2013年第1期21-24,共4页离散数学期刊（英文）

摘　　要：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.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.

关 键 词：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 

分 类 号：O1[理学—数学]