Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
On the size of weights in randomized search heuristics
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Weights of exact threshold functions
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Lower Bounds for Coin-Weighing Problems
ACM Transactions on Computation Theory (TOCT)
A better upper bound on weights of exact threshold functions
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Incoherent majorities: The McGarvey problem in judgement aggregation
Discrete Applied Mathematics
Sparse weighted voting classifier selection and its linear programming relaxations
Information Processing Letters
Probabilistic existence of rigid combinatorial structures
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Discrete Optimization
Low-weight halfspaces for sparse boolean vectors
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Discrete Applied Mathematics
Improved Approximation of Linear Threshold Functions
Computational Complexity
| Hi-index | 0.00 |