Showing 41–60 of 66 results
/ Date/ Name
Jan 31, 2020Essentially Optimal Sparse Polynomial MultiplicationJan 7, 2020Lifting with Simple Gadgets and Applications to Circuit and Proof ComplexityDec 18, 2019Neural Networks Weights Quantization: Target None-retraining Ternary (TNT)Jun 1, 2019On the Efficiency of Entropic Regularized Algorithms for Optimal TransportApr 30, 2019Query-to-Communication Lifting Using Low-Discrepancy GadgetsFeb 8, 2019Generic reductions for in-place polynomial multiplicationFeb 17, 2018Approximate Set Union Via Approximate RandomizationSep 22, 2017Universal points in the asymptotic spectrum of tensorsMay 26, 2017The border support rank of two-by-two matrix multiplication is sevenMar 7, 2017Random CNFs are Hard for Cutting PlanesFeb 17, 2017On algebraic branching programs of small widthOct 1, 2014On the Computational Complexity of MapReduceNov 11, 2013Derandomizing Polynomial Identity over Finite Fields Implies Super-Polynomial Circuit Lower Bounds for NEXPNov 1, 2013Pebbling Arguments for Tree EvaluationAug 16, 2012Computational Complexity in Electronic StructureApr 6, 2012Certifying the restricted isometry property is hardDec 2, 2011On the Complexity of Approximate Sum of Sorted ListSep 22, 2011Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout ProblemsApr 20, 2011Fairness Through AwarenessDec 10, 2010NE is not NP Turing Reducible to Nonexpoentially Dense NP Sets