MJMaurice Jansen
Maurice Jansen
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Maurice Jansen has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Jayalal Sarma M. N
Institute for Theoretical Computer Science Tsinghua University Beijing China
2 shared publications - Youming Qiao
Centre for Quantum Software and Information, University of Technology Sydney, Sydney, Australia
2 shared publications - B. V. Raghavendra Rao
Universität des Saarlandes, Informatik, Saarbrücken, Germany
1 shared publication - Jayalal Sarma
Indian Inst Technol Madras, Dept Comp Sci & Engn, Chennai 600036, Tamil Nadu, India
1 shared publication - Meena Mahajan
The Institute of Mathematical Sciences (CI of Homi Bhabha National Institute), Chennai, India
1 shared publication
Latest Publications
- 1 December 2013
- Published by Springer Nature in Theory of Computing Systems
- Vol. 54 (2) , 318-336
Balancing Bounded Treewidth Circuits
- 1 December 2013
- Published by Springer Nature in Theory of Computing Systems
- Vol. 54 (2) , 318-336
Balancing Bounded Treewidth Circuits
- 18 June 2013
- Published by Springer Nature in computational complexity
- Vol. 22 (3) , 517-564
Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits
- 18 June 2013
- Published by Springer Nature in computational complexity
- Vol. 22 (3) , 517-564
Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits
- 31 December 2012
- Published by Elsevier in Information Processing Letters
- Vol. 112 (24) , 969-975
Towards a tight hardness–randomness connection between permanent and arithmetic circuit identity testing
- 31 December 2012
- Published by Elsevier in Information Processing Letters
- Vol. 112 (24) , 969-975
Towards a tight hardness–randomness connection between permanent and arithmetic circuit identity testing
- 30 December 2010
- Published by Springer Nature in Theory of Computing Systems
- Vol. 49 (2) , 343-354
Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials
- 30 December 2010
- Published by Springer Nature in Theory of Computing Systems
- Vol. 49 (2) , 343-354
Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials
- Open Access
Deterministic Black-Box Identity Testing $π$-Ordered Algebraic Branching Programs
In this paper we study algebraic branching programs (ABPs) with restrictions on the order and the number of reads of variables in the program. Given a permutation $\pi$ of $n$ variables, for a $\pi$-ordered ABP ($\pi$-OABP), for any directed path $p$ from source to sink, a variable can appear at most once on $p$, and the order in which variables appear on $p$ must respect $\pi$. An ABP $A$ is said to be of read $r$, if any variable appears at most $r$ times in $A$. Our main result pertains to the identity testing problem. Over any field $F$ and in the black-box model, i.e. given only query access to the polynomial, we have the following result: read $r$ $\pi$-OABP computable polynomials can be tested in $\DTIME[2^{O(r\log r \cdot \log^2 n \log\log n)}]$. Our next set of results investigates the computational limitations of OABPs. It is shown that any OABP computing the determinant or permanent requires size $\Omega(2^n/n)$ and read $\Omega(2^n/n^2)$. We give a multilinear polynomial $p$ in $2n+1$ variables over some specifically selected field $G$, such that any OABP computing $p$ must read some variable at least $2^n$ times. We show that the elementary symmetric polynomial of degree $r$ in $n$ variables can be computed by a size $O(rn)$ read $r$ OABP, but not by a read $(r-1)$ OABP, for any $0 < 2r-1 \leq n$. Finally, we give an example of a polynomial $p$ and two variables orders $\pi \neq \pi'$, such that $p$ can be computed by a read-once $\pi$-OABP, but where any $\pi'$-OABP computing $p$ must read some variable at least $2^n$Open AccessDeterministic Black-Box Identity Testing $π$-Ordered Algebraic Branching Programs
In this paper we study algebraic branching programs (ABPs) with restrictions on the order and the number of reads of variables in the program. Given a permutation $\pi$ of $n$ variables, for a $\pi$-ordered ABP ($\pi$-OABP), for any directed path $p$ from source to sink, a variable can appear at most once on $p$, and the order in which variables appear on $p$ must respect $\pi$. An ABP $A$ is said to be of read $r$, if any variable appears at most $r$ times in $A$. Our main result pertains to the identity testing problem. Over any field $F$ and in the black-box model, i.e. given only query access to the polynomial, we have the following result: read $r$ $\pi$-OABP computable polynomials can be tested in $\DTIME[2^{O(r\log r \cdot \log^2 n \log\log n)}]$. Our next set of results investigates the computational limitations of OABPs. It is shown that any OABP computing the determinant or permanent requires size $\Omega(2^n/n)$ and read $\Omega(2^n/n^2)$. We give a multilinear polynomial $p$ in $2n+1$ variables over some specifically selected field $G$, such that any OABP computing $p$ must read some variable at least $2^n$ times. We show that the elementary symmetric polynomial of degree $r$ in $n$ variables can be computed by a size $O(rn)$ read $r$ OABP, but not by a read $(r-1)$ OABP, for any $0 < 2r-1 \leq n$. Finally, we give an example of a polynomial $p$ and two variables orders $\pi \neq \pi'$, such that $p$ can be computed by a read-once $\pi$-OABP, but where any $\pi'$-OABP computing $p$ must read some variable at least $2^n$ - Open Access
Deterministic Identity Testing of Read-Once Algebraic Branching Programs
In this paper we study polynomial identity testing of sums of $k$ read-once algebraic branching programs ($\Sigma_k$-RO-ABPs), generalizing the work in (Shpilka and Volkovich 2008,2009), who considered sums of $k$ read-once formulas ($\Sigma_k$-RO-formulas). We show that $\Sigma_k$-RO-ABPs are strictly more powerful than $\Sigma_k$-RO-formulas, for any $k \leq \lfloor n/2\rfloor$, where $n$ is the number of variables. We obtain the following results: 1) Given free access to the RO-ABPs in the sum, we get a deterministic algorithm that runs in time $O(k^2n^7s) + n^{O(k)}$, where $s$ bounds the size of any largest RO-ABP given on the input. This implies we have a deterministic polynomial time algorithm for testing whether the sum of a constant number of RO-ABPs computes the zero polynomial. 2) Given black-box access to the RO-ABPs computing the individual polynomials in the sum, we get a deterministic algorithm that runs in time $k^2n^{O(\log n)} + n^{O(k)}$. 3) Finally, given only black-box access to the polynomial computed by the sum of the $k$ RO-ABPs, we obtain an $n^{O(k + \log n)}$ time deterministic algorithm.Open AccessDeterministic Identity Testing of Read-Once Algebraic Branching Programs
In this paper we study polynomial identity testing of sums of $k$ read-once algebraic branching programs ($\Sigma_k$-RO-ABPs), generalizing the work in (Shpilka and Volkovich 2008,2009), who considered sums of $k$ read-once formulas ($\Sigma_k$-RO-formulas). We show that $\Sigma_k$-RO-ABPs are strictly more powerful than $\Sigma_k$-RO-formulas, for any $k \leq \lfloor n/2\rfloor$, where $n$ is the number of variables. We obtain the following results: 1) Given free access to the RO-ABPs in the sum, we get a deterministic algorithm that runs in time $O(k^2n^7s) + n^{O(k)}$, where $s$ bounds the size of any largest RO-ABP given on the input. This implies we have a deterministic polynomial time algorithm for testing whether the sum of a constant number of RO-ABPs computes the zero polynomial. 2) Given black-box access to the RO-ABPs computing the individual polynomials in the sum, we get a deterministic algorithm that runs in time $k^2n^{O(\log n)} + n^{O(k)}$. 3) Finally, given only black-box access to the polynomial computed by the sum of the $k$ RO-ABPs, we obtain an $n^{O(k + \log n)}$ time deterministic algorithm.