Sciweavers

112 search results - page 14 / 23
» On the nonlinearity of monotone Boolean functions
Sort
View
COCO
1997
Springer
144views Algorithms» more  COCO 1997»
15 years 1 months ago
Polynomial Vicinity Circuits and Nonlinear Lower Bounds
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
Kenneth W. Regan
79
Voted
SIAMCO
2010
93views more  SIAMCO 2010»
14 years 8 months ago
Small Gain Theorems for Large Scale Systems and Construction of ISS Lyapunov Functions
We consider a network consisting of n interconnected nonlinear subsystems. For each subsystem an ISS Lyapunov function is given that treats the other subsystems as independent inpu...
Sergey Dashkovskiy, Björn Sebastian Rüff...
ECCC
2010
124views more  ECCC 2010»
14 years 9 months ago
Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas
Much work has been done on learning various classes of "simple" monotone functions under the uniform distribution. In this paper we give the first unconditional lower bo...
Vitaly Feldman, Homin K. Lee, Rocco A. Servedio
ECAI
2000
Springer
15 years 1 months ago
Search Pruning Conditions for Boolean Optimization
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Com...
Vasco M. Manquinho, João P. Marques Silva
AMAI
2000
Springer
15 years 1 months ago
On Solving Boolean Optimization with Satisfiability-Based Algorithms
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...
Vasco M. Manquinho, João P. Marques Silva