Maurice Jansen

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Balancing Bounded Treewidth Circuits	2013	Maurice Jansen Jayalal Sarma
+	Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials	2010	Maurice Jansen
+	Deterministic Black-Box Identity Testing $\pi$-Ordered Algebraic Branching Programs	2010	Maurice Jansen Youming Qiao Jayalal Sarma
+ PDF Chat	Balancing Bounded Treewidth Circuits	2010	Maurice Jansen Jayalal Sarma M.N.
+	Deterministic Black-Box Identity Testing $π$-Ordered Algebraic Branching Programs	2010	Maurice Jansen Youming Qiao Jayalal Sarma
+	Extracting Roots of Arithmetic Circuits by Adapting Numerical Methods.	2010	Maurice Jansen
+	Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials	2009	Maurice Jansen
+	Deterministic Identity Testing of Read-Once Algebraic Branching Programs	2009	Maurice Jansen Youming Qiao Jayalal Sarma
+	Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion	2009	Maurice Jansen
+	Lower bound frontiers in arithmetical circuit complexity	2006	Kenneth W. Regan Maurice Jansen

Common Coauthors

Coauthor	Papers Together
Jayalal Sarma	4
Youming Qiao	3
Kenneth W. Regan	1
Jayalal Sarma M.N.	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Completeness classes in algebra	1979	Leslie G. Valiant	4
+	The complexity of computing the permanent	1979	Leslie G. Valiant	3
+	Probabilistic algorithms for sparse polynomials	1979	Richard Zippel	3
+	A quadratic bound for the determinant and permanent problem.	2004	Thierry Mignon Nicolas Ressayre	3
+	The complexity of partial derivatives	1983	Walter Bäur Volker Strassen	3
+	Cook's versus Valiant's hypothesis	2000	Peter Bürgisser	2
+	Extremal Combinatorics	2001	Stasys Jukna	2
+	Characterizing Valiant's algebraic complexity classes	2007	Guillaume Malod Natacha Portier	2
+	A quadratic lower bound for the permanent and determinant problem over any characteristic ≠ 2	2008	Jin‐Yi Cai Xi Chen Dong Li	2
+ PDF Chat	On Lower Bounds for Constant Width Arithmetic Circuits	2009	V. Arvind Pushkar S. Joglekar Srikanth Srinivasan	2
+	Undirected ST-connectivity in log-space	2005	Omer Reingold	2
+	Computing algebraic formulas with a constant number of registers	1988	Richard Cleve	2
+ PDF Chat	Uncertainty Principles for Signal Concentrations	2006	Ram Somaraju Leif Hanlen	1
+	Uncertainty Principles and Signal Recovery	1989	David L. Donoho Philip B. Stark	1
+	Toeplitz and circulant matrices	1977	Robert M. Gray	1
+ PDF Chat	Deterministic polynomial factoring and association schemes	2014	Manuel Arora Gábor Ivanyos Marek Karpiński Nitin Saxena	1
+	Geometric Complexity Theory, P vs. NP and Explicit Obstructions	2003	Ketan Mulmuley Milind Sohoni	1
+	Uncertainty principles revisited.	2001	M. Tum Kathi Selig	1
+ PDF Chat	Combinatorial Nullstellensatz	1999	Noga Alon	1
+	Robust Uncertainty Principles: Exact Signal Reconstruction from Highly Incomplete Frequency Information	2004	Emmanuel J. Candès Justin Romberg Terence Tao	1
+	On Lower Bounds for Constant Width Arithmetic Circuits	2009	V. Arvind Pushkar S. Joglekar Srikanth Srinivasan	1
+	Graduate Texts in Mathematics	1977	Rajendra Bhatia Glen Bredon Wolfgang Walter Joseph Rotman M. Ram Murty Jane Gilman Peter Walters Martin Golubitsky Ioannis Karatzas Henri Cohen	1
+	Hilbert's Nullstellensatz Is in the Polynomial Hierarchy	1996	Pascal Koiran	1
+	On the Periodic Discrete Prolate Spheroidal Sequences	1984	Wen Yuan Xu C. Chamzas	1
+	Multi-linear formulas for permanent and determinant are of super-polynomial size	2009	Ran Raz	1
+	Linear decision trees	1992	Anders Björner László Lovász Andrew Chi-Chih Yao	1
+ PDF Chat	An uncertainty principle for cyclic groups of prime order	2005	Terence Tao	1
+	Multi-linear formulas for permanent and determinant are of super-polynomial size	2004	Ran Raz	1
+	Systems of distinct representatives and linear algebra	1967	Jack Edmonds	1
+ PDF Chat	A certain class of incidence matrices	1966	Daniel Henry Gottlieb	1
+	Geometric Complexity Theory I: An Approach to the<i>P</i>vs.<i>NP</i>and Related Problems	2001	Ketan Mulmuley Milind Sohoni	1
+ PDF Chat	A Spectral Approach to Lower Bounds with Applications to Geometric Searching	1998	Bernard Chazelle	1
+	Norm estimates for inverses of Vandermonde matrices	1974	Walter Gautschi	1
+	SUPERRESOLUTION, THE RECOVERY OF MISSING SAMPLES, AND VANDERMONDE MATRICES ON THE UNIT CIRCLE	1999	Paulo J. S. G. Ferreira	1