Maurice Jansen

Research Fellow, PhD (State University of New York at Buffalo, 2006).

Laboratory for Foundations of Computer Science
School of Informatics, The University of Edinburgh

Room: 5.38, Informatics Forum
10 Crichton Street
Edinburgh, EH8 9AB

Phone : +44 (0)131 650 5138
maurice.julien.jansen AT gmail DOT com

New Manuscripts

  • Stronger Lower Bounds and Randomness-Hardness Tradeoffs using Associated Algebraic Complexity Classes
  • Marginal Hitting Sets Imply Super-Polynomial Lower Bounds for Permanent
  • Towards a Tight Hardness-Randomness Connection Between Permanent and Arithmetic Circuit Identity Testing

  • Published Works


  • Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth
  • Extracting Roots of Arithmetic Circuits by Adapting Numerical Methods
  • 2010

  • Deterministic Black-Box Identity Testing $\pi$-Ordered Algebraic Branching Programs
  • Balancing Bounded Treewidth Circuits
  • Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion
  • 2009

  • Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials
  • Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity
  • 2008

  • 'Lower Bounds for Syntactically Multilinear Algebraic Branching Programs'
  • 'A Non-Linear Lower Bound for Constant Depth Circuits via the Discrete Uncertainty Principle'
  • 2007

  • 'Resistant Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas'

  • Manuscripts

  • Deterministic Identity Testing of Read-Once Algebraic Branching Programs

  • Dissertation

  • Dissertation: 'Lower Bound Frontiers in Arithmetical Circuit Complexity'

  • Slides from my dissertation defense

  • Past Activities

  • Postdoctoral Researcher at the Institute for Theoretical Computer Science (ITCS), Tsinghua University
  • Aarhus University Workshop on Algebraic Complexity Theory
  • Algebra and Computation Seminar (ACS) at Aarhus University