How to assign votes in a distributed system
Journal of the ACM (JACM)
Consistency in a partitioned network: a survey
ACM Computing Surveys (CSUR)
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Disjoint products and efficient computation of reliability
Operations Research
Combinatorial characterization of read-once formulae
Discrete Mathematics - Special issue on combinatorics and algorithms
On read-once threshold formulae and their randomized decision tree complexity
Theoretical Computer Science - Special issue on structure in complexity theory
Selection of relevant features and examples in machine learning
Artificial Intelligence - Special issue on relevance
Bounds to Complexities of Networks for Sorting and for Switching
Journal of the ACM (JACM)
Discrete mathematics of neural networks: selected topics
Discrete mathematics of neural networks: selected topics
Diagnosing double regular systems
Annals of Mathematics and Artificial Intelligence
The Complexity of Symmetric Boolean Functions
Computation Theory and Logic, In Memory of Dieter Rödding
Query strategies for priced information
Journal of Computer and System Sciences - Special issue on STOC 2000
Two applications of information complexity
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A new strategy for querying priced information
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On the competitive ratio of evaluating priced functions
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Boolean Functions
Probabilistic Boolean decision trees and the complexity of evaluating game trees
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Function Evaluation Via Linear Programming in the Priced Information Model
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
| Hi-index | 0.04 |
We study the extremal competitive ratio of Boolean function evaluation. We provide the first non-trivial lower and upper bounds for classes of Boolean functions which are not included in the class of monotone Boolean functions. For the particular case of symmetric functions our bounds are matching and we exactly characterize the best possible competitiveness achievable by a deterministic algorithm. Our upper bound is obtained by a simple polynomial time algorithm.