Simulation Theorems via Pseudo-random Properties
来源期刊:computational complexityDOI:10.1007/s00037-019-00190-7
Prediction from Partial Information and Hindsight, with Application to Circuit Lower Bounds
来源期刊:computational complexityDOI:10.1007/s00037-019-00177-4
Average-case linear matrix factorization and reconstruction of low width algebraic branching programs
来源期刊:computational complexityDOI:10.1007/s00037-019-00189-0
A decidable dichotomy theorem on directed graph homomorphisms with non-negative weights
来源期刊:computational complexityDOI:10.1007/s00037-019-00184-5
Hierarchy Theorems for Testing Properties in Size-Oblivious Query Complexity
来源期刊:computational complexityDOI:10.1007/s00037-019-00187-2
Depth-4 Lower Bounds, Determinantal Complexity: A Unified Approach
来源期刊:computational complexityDOI:10.1007/s00037-019-00185-4
A quadratic lower bound for homogeneous algebraic branching programs
来源期刊:computational complexityDOI:10.1007/s00037-019-00186-3
On Derandomized Composition of Boolean Functions
来源期刊:computational complexityDOI:10.1007/s00037-019-00188-1
Vanishing of Littlewood–Richardson polynomials is in P
来源期刊:computational complexityDOI:10.1007/s00037-019-00183-6
Correction to: Query-to-Communication Lifting for PNP
来源期刊:computational complexityDOI:10.1007/s00037-019-00180-9
Random resolution refutations
来源期刊:computational complexityDOI:10.1007/s00037-019-00182-7
Improved Bounds for Quantified Derandomization of Constant-Depth Circuits and Polynomials
来源期刊:computational complexityDOI:10.1007/s00037-019-00179-2