On hard instances of non-commutative permanent | 0 | 0.34 | 2020 |
Parameterized Valiant's Classes. | 0 | 0.34 | 2019 |
A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits | 0 | 0.34 | 2018 |
ON EXPRESSING MAJORITY AS A MAJORITY OF MAJORITIES | 0 | 0.34 | 2017 |
Dichotomy Theorems for Homomorphism Polynomials of Graph Classes. | 0 | 0.34 | 2016 |
Lower Bounds and Identity Testing for Projections of Power Symmetric Polynomials. | 0 | 0.34 | 2016 |
New Algorithms and Hard Instances for Non-Commutative Computation. | 0 | 0.34 | 2014 |
Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems. | 1 | 0.37 | 2013 |
Random Shortest Path Metrics with Applications. | 0 | 0.34 | 2012 |
Randomness Efficient Testing of Sparse Black Box Identities of Unbounded Degree over the Reals | 1 | 0.36 | 2011 |
Average-case approximation ratio of the 2-opt algorithm for the TSP | 8 | 0.52 | 2009 |