New degree bounds for polynomial threshold functions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On the computational power of Boolean decision lists
Computational Complexity
A note on the circuit complexity of PP
Theoretical Computer Science
LWPP and WPP are not uniformly gap-definable
Journal of Computer and System Sciences
On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P
Information Processing Letters
Error-bounded probabilistic computations between MA and AM
Journal of Computer and System Sciences
Toward Attribute Efficient Learning of Decision Lists and Parities
The Journal of Machine Learning Research
Extremal properties of polynomial threshold functions
Journal of Computer and System Sciences
Polynomials that Sign Represent Parity and Descartes' Rule of Signs
Computational Complexity
Problems of Information Transmission
Optimal bounds for sign-representing the intersection of two halfspaces by polynomials
Proceedings of the forty-second ACM symposium on Theory of computing
A uniform lower bound on weights of perceptrons
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Weights of exact threshold functions
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Complexity classes of equivalence problems revisited
Information and Computation
Representing boolean functions using polynomials: more can offer less
ISNN'11 Proceedings of the 8th international conference on Advances in neural networks - Volume Part III
Unbounded-error quantum query complexity
Theoretical Computer Science
A note on quantum algorithms and the minimal degree of ε-error polynomials for symmetric functions
Quantum Information & Computation
Bounded Independence Fools Halfspaces
SIAM Journal on Computing
SIAM Journal on Computing
Lower bound on weights of large degree threshold functions
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Dual lower bounds for approximate degree and markov-bernstein inequalities
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Improved Approximation of Linear Threshold Functions
Computational Complexity
| Hi-index | 0.00 |