Sciweavers

707 search results - page 117 / 142
» The Nonhomomorphicity of Boolean Functions
Sort
View
COLT
2001
Springer
14 years 12 days ago
On Using Extended Statistical Queries to Avoid Membership Queries
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...
Nader H. Bshouty, Vitaly Feldman
JSAT
2006
91views more  JSAT 2006»
13 years 7 months ago
Extending Existential Quantification in Conjunctions of BDDs
Abstract. We introduce new approaches intended to speed up determining the satisfiability of a given Boolean formula expressed as a conjunction of Boolean functions. A common prac...
Sean Weaver, John V. Franco, John S. Schlipf
FUIN
2008
108views more  FUIN 2008»
13 years 8 months ago
Radial View of Continuous Cellular Automata
Continuous cellular automata (or coupled map lattices) are cellular automata where the state of the cells are real values in [0, 1] and the local transition rule is a real function...
Paola Flocchini, Vladimir Cezar
STTT
2008
90views more  STTT 2008»
13 years 7 months ago
A uniform framework for weighted decision diagrams and its implementation
1 This papers introduces a generic framework for OBDD variants with weighted edges. It covers many boolean and multi-valued OBDD-variants that have been studied in the literature a...
Jörn Ossowski, Christel Baier
STOC
1996
ACM
100views Algorithms» more  STOC 1996»
14 years 1 days ago
The Linear-Array Conjecture in Communication Complexity is False
A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...
Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky