1. Science
  2. Publications
  3. Information Processing Systems
  4. 6(87)'2010
  5. The static complexity estimation of boolean functions on linear binary graph

The static complexity estimation of boolean functions on linear binary graph

O.G. Oxijuk
Annotations languages:

The article highlights the algorithms for criteria complexity estimation of Boolean functions.
Keywords: Boolean function, linear binary graph
Reference:
Oksiiuk, O.H. (2010), "Statychna otsinka skladnosti bulevykh funktsii za dopomohoiu liniinoho binarnoho hrafu" , Information Processing Systems, Vol. 6(87), pp. 222-224.