Maurice J. Jansen

According to our database, Maurice J. Jansen authored at least 15 papers between 2007 and 2013.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2013

Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits.

Maurice J. Jansen, Meena Mahajan, B. V. Raghavendra Rao

Comput. Complex., 2013

2012

Stronger Lower Bounds and Randomness-Hardness Trade-Offs Using Associated Algebraic Complexity Classes.

Maurice J. Jansen, Rahul Santhanam

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

Marginal hitting sets imply super-polynomial lower bounds for permanent.

Maurice J. Jansen, Rahul Santhanam

Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

2011

Stronger Lower Bounds and Randomness-Hardness Tradeoffs using Associated Algebraic Complexity Classes.

Maurice J. Jansen, Rahul Santhanam

Electron. Colloquium Comput. Complex., 2011

Extracting Roots of Arithmetic Circuits by Adapting Numerical Methods.

Maurice J. Jansen

Proceedings of the Innovations in Computer Science, 2011

Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth.

Maurice J. Jansen, Rahul Santhanam

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010

Deterministic Identity Testing of Read-Once Algebraic Branching Programs.

Maurice J. Jansen, Youming Qiao, Jayalal Sarma

Electron. Colloquium Comput. Complex., 2010

Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion.

Maurice J. Jansen

Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Deterministic Black-Box Identity Testing $pi$-Ordered Algebraic Branching Programs.

Maurice J. Jansen, Youming Qiao, Jayalal Sarma

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

Balancing Bounded Treewidth Circuits.

Maurice J. Jansen, Jayalal Sarma

Proceedings of the Computer Science, 2010

2009

Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity.

Maurice J. Jansen, B. V. Raghavendra Rao

Proceedings of the Computer Science, 2009

Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials.

Maurice J. Jansen

Proceedings of the Computer Science, 2009

2008

A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle.

Maurice J. Jansen, Kenneth W. Regan

Theor. Comput. Sci., 2008

Lower Bounds for Syntactically Multilinear Algebraic Branching Programs.

Maurice J. Jansen

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

2007

"Resistant" Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas.

Maurice J. Jansen, Kenneth W. Regan

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007