Maurice Jansen

Available identifiers

zbMath Open jansen.maurice-jMaRDI QIDQ371191

List of research outcomes

Publication	Date of Publication	Type
Balancing bounded treewidth circuits	2017-11-07	Paper
Marginal hitting sets imply super-polynomial lower bounds for permanent	2016-10-07	Paper
Resource trade-offs in syntactically multilinear arithmetic circuits	2013-09-30	Paper
Permanent does not have succinct polynomial size arithmetic circuits of constant depth	2013-06-06	Paper
Towards a tight hardness-randomness connection between permanent and arithmetic circuit identity testing	2013-03-21	Paper
Deterministic Black-Box Identity Testing $pi$-Ordered Algebraic Branching Programs	2012-08-29	Paper
https://portal.mardi4nfdi.de/entity/Q2904790	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	2011-10-11	Paper
Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth	2011-07-06	Paper
Balancing Bounded Treewidth Circuits	2010-06-22	Paper
Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials	2009-08-18	Paper
Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity	2009-08-18	Paper
“Resistant” Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas	2009-03-06	Paper
Lower Bounds for Syntactically Multilinear Algebraic Branching Programs	2009-02-03	Paper
A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle	2009-01-08	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Maurice Jansen