Maurice Jansen

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Balancing bounded treewidth circuits Theory of Computing Systems	2017-11-07	Paper
Marginal hitting sets imply super-polynomial lower bounds for permanent Proceedings of the 3rd Innovations in Theoretical Computer Science Conference	2016-10-07	Paper
Resource trade-offs in syntactically multilinear arithmetic circuits Computational Complexity	2013-09-30	Paper
Permanent does not have succinct polynomial size arithmetic circuits of constant depth Information and Computation	2013-06-06	Paper
Towards a tight hardness-randomness connection between permanent and arithmetic circuit identity testing Information Processing Letters	2013-03-21	Paper
Deterministic black-box identity testing \(\pi\)-ordered algebraic branching programs	2012-08-29	Paper
Stronger lower bounds and randomness-hardness trade-offs using associated algebraic complexity classes	2012-08-23	Paper
Weakening assumptions for deterministic subexponential time non-singular matrix completion	2012-01-23	Paper
Lower bounds for the determinantal complexity of explicit low degree polynomials Theory of Computing Systems	2011-10-11	Paper
Permanent does not have succinct polynomial size arithmetic circuits of constant depth Automata, Languages and Programming	2011-07-06	Paper
Balancing Bounded Treewidth Circuits Computer Science – Theory and Applications	2010-06-22	Paper
Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity Computer Science - Theory and Applications	2009-08-18	Paper
Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials Computer Science - Theory and Applications	2009-08-18	Paper
“Resistant” Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas Lecture Notes in Computer Science	2009-03-06	Paper
Lower Bounds for Syntactically Multilinear Algebraic Branching Programs Lecture Notes in Computer Science	2009-02-03	Paper
A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle Theoretical Computer Science	2009-01-08	Paper

Research outcomes over time

This page was built for person: Maurice Jansen