Add to ORKGThesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1985.MICROFICHE COPY AVAILABLE IN ARCHIVES AND SCIENCE.Bibliography: leaves 206-212.Stephen Wayne Boyack.Ph.D
Complexity of boolean functions can be computed in many ways. Various complexity measures exist whic...
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty...
AbstractThe parity decision tree model extends the decision tree model by allowing the computation o...
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...
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
AbstractWe define two measures, γ and c, of complexity for Boolean functions. These measures are rel...
The central focus of computational complexity theory is to measure the "hardness" of computing diffe...
AbstractThe computation of Boolean functions by parallel computers with shared memory (PRAMs and WRA...
torics. Of course, these two subjects are no strangers: combinatorics is often used as a tool in the...
this paper we shall assume that S is a commutative ring with identity. Then each instruction f i can...
133 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1987.Traditional theories measure ...
We give an algorithm that learns any monotone Boolean function f: {−1, 1}n → {−1, 1} to any constant...
This thesis consists of 6 chapters (the first being an introduction). Two chapters relate to local c...
We analyze Boolean functions using a recently proposed measure of their complexity. This complexity ...
Complexity of boolean functions can be computed in many ways. Various complexity measures exist whic...
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty...
AbstractThe parity decision tree model extends the decision tree model by allowing the computation o...
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...
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
AbstractWe define two measures, γ and c, of complexity for Boolean functions. These measures are rel...
The central focus of computational complexity theory is to measure the "hardness" of computing diffe...
AbstractThe computation of Boolean functions by parallel computers with shared memory (PRAMs and WRA...
torics. Of course, these two subjects are no strangers: combinatorics is often used as a tool in the...
this paper we shall assume that S is a commutative ring with identity. Then each instruction f i can...
133 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1987.Traditional theories measure ...
We give an algorithm that learns any monotone Boolean function f: {−1, 1}n → {−1, 1} to any constant...
This thesis consists of 6 chapters (the first being an introduction). Two chapters relate to local c...
We analyze Boolean functions using a recently proposed measure of their complexity. This complexity ...
Complexity of boolean functions can be computed in many ways. Various complexity measures exist whic...
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty...
AbstractThe parity decision tree model extends the decision tree model by allowing the computation o...