Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Jansen, Maurice - School of Informatics, University of Edinburgh
Deterministic Black-Box Identity Testing -Ordered Algebraic Branching Programs
Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion
Lower Bound Frontiers in Arithmetical Circuit Complexity
Extracting Roots of Arithmetic Circuits by Adapting Numerical Maurice Jansen
Marginal Hitting Sets Imply Super-Polynomial Lower Bounds for Maurice Jansen
Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials
Towards a Tight Hardness-Randomness Connection Between Permanent and Arithmetic Circuit Identity Testing
Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth
LOWER BOUND FRONTIERS IN ARITHMETICAL CIRCUIT COMPLEXITY Maurice Julien Jansen
A Non-Linear Lower Bound for Constant Depth Arithmetical Circuits via the Discrete Uncertainty Principle
"Resistant" Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas
Simulation of Arithmetical Circuits by Branching Programs with Preservation of
Lower Bounds for Syntactically Multilinear Algebraic Branching Programs
Balancing Bounded Treewidth Circuits Maurice Jansen
