The following pages link to Maurice Jansen (Q371191):
Displaying 16 items.
- Resource trade-offs in syntactically multilinear arithmetic circuits (Q371194) (← links)
- Lower bounds for the determinantal complexity of explicit low degree polynomials (Q639850) (← links)
- Balancing bounded treewidth circuits (Q1678757) (← links)
- Towards a tight hardness-randomness connection between permanent and arithmetic circuit identity testing (Q1941704) (← links)
- Permanent does not have succinct polynomial size arithmetic circuits of constant depth (Q1951581) (← links)
- A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle (Q2378541) (← links)
- Marginal hitting sets imply super-polynomial lower bounds for permanent (Q2826080) (← links)
- (Q2904790) (← links)
- Deterministic Black-Box Identity Testing $pi$-Ordered Algebraic Branching Programs (Q2908859) (← links)
- Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth (Q3012845) (← links)
- Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion (Q3113772) (← links)
- Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials (Q3392951) (← links)
- Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity (Q3392953) (← links)
- Balancing Bounded Treewidth Circuits (Q3569746) (← links)
- Lower Bounds for Syntactically Multilinear Algebraic Branching Programs (Q3599145) (← links)
- “Resistant” Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas (Q3608871) (← links)
