Sciweavers

63 search results - page 4 / 13
» 06111 Abstracts Collection -- Complexity of Boolean Function...
Sort
View
CORR
2006
Springer
108views Education» more  CORR 2006»
13 years 7 months ago
Static Analysis using Parameterised Boolean Equation Systems
The well-known problem of state space explosion in model checking is even more critical when applying this technique to programming languages, mainly due to the presence of complex...
María-del-Mar Gallardo, Christophe Joubert,...
TOC
2008
89views more  TOC 2008»
13 years 7 months ago
Norms, XOR Lemmas, and Lower Bounds for Polynomials and Protocols
Abstract: This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and polynomials over GF(2)....
Emanuele Viola, Avi Wigderson
ECAI
2006
Springer
13 years 11 months ago
Boolean Games Revisited
Abstract. Game theory is a widely used formal model for studying strategical interactions between agents. Boolean games [8] are two players, zero-sum static games where players...
Elise Bonzon, Marie-Christine Lagasquie-Schiex, J&...
SAB
2010
Springer
140views Optimization» more  SAB 2010»
13 years 6 months ago
A Model of Symmetry Breaking in Collective Decision-Making
Abstract. Symmetry breaking is commonly found in self-organized collective decision making. It serves an important functional role, specifically in biological and bio-inspired sys...
Heiko Hamann, Bernd Meyer, Thomas Schmickl, Karl C...
SIAMCOMP
2011
13 years 2 months ago
The Chow Parameters Problem
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...
Ryan O'Donnell, Rocco A. Servedio