Add to ORKGDepartment of AlgebraKatedra algebryFaculty of Mathematics and PhysicsMatematicko-fyzikální fakult
The theory of the synthesis and complexity of controlling systems is considered in the paper aiming ...
AbstractWe discuss several complexity measures for Boolean functions: certificate complexity, sensit...
AbstractThe average time of computing Boolean functions by straight-line programs with a conditional...
We briefly describe the state of the art concerning the complexity of discrete functions. Computati...
From 12.03.06 to 17.03.06, the Dagstuhl Seminar 06111 ``Complexity of Boolean Functions\u27\u27 was ...
AbstractWe define two measures, γ and c, of complexity for Boolean functions. These measures are rel...
SIGLETIB: RO 5219 (59) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbib...
Complexity of boolean functions can be computed in many ways. Various complexity measures exist whic...
133 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1987.Traditional theories measure ...
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
AbstractThe multiplicative complexity of a Boolean function f is defined as the minimum number of bi...
Boolean function manipulation is an important component of computer science. This thesis presents r...
Abstract. Multiplicative complexity is a complexity measure defined as the minimum number of AND gat...
We analyze Boolean functions using a recently proposed measure of their complexity. This complexity ...
Abstract: The new exact bounds on the Shannon's functions characterizing the complexity of...
The theory of the synthesis and complexity of controlling systems is considered in the paper aiming ...
AbstractWe discuss several complexity measures for Boolean functions: certificate complexity, sensit...
AbstractThe average time of computing Boolean functions by straight-line programs with a conditional...
We briefly describe the state of the art concerning the complexity of discrete functions. Computati...
From 12.03.06 to 17.03.06, the Dagstuhl Seminar 06111 ``Complexity of Boolean Functions\u27\u27 was ...
AbstractWe define two measures, γ and c, of complexity for Boolean functions. These measures are rel...
SIGLETIB: RO 5219 (59) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbib...
Complexity of boolean functions can be computed in many ways. Various complexity measures exist whic...
133 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1987.Traditional theories measure ...
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
AbstractThe multiplicative complexity of a Boolean function f is defined as the minimum number of bi...
Boolean function manipulation is an important component of computer science. This thesis presents r...
Abstract. Multiplicative complexity is a complexity measure defined as the minimum number of AND gat...
We analyze Boolean functions using a recently proposed measure of their complexity. This complexity ...
Abstract: The new exact bounds on the Shannon's functions characterizing the complexity of...
The theory of the synthesis and complexity of controlling systems is considered in the paper aiming ...
AbstractWe discuss several complexity measures for Boolean functions: certificate complexity, sensit...
AbstractThe average time of computing Boolean functions by straight-line programs with a conditional...