#### Filter Results:

- Full text PDF available (13)

#### Publication Year

2007

2017

- This year (1)
- Last 5 years (3)
- Last 10 years (16)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Organism

Learn More

- Maurice J. Jansen
- MFCS
- 2008

It is shown that any weakly-skew circuit can be converted into a skew circuit with constant factor overhead, while preserving either syntactic or semantic multilinearity. This leads to consideringâ€¦ (More)

- Maurice J. Jansen, Nico M. Franz
- ZooKeys
- 2015

This contribution adopts the taxonomic concept annotation and alignment approach. Accordingly, and where indicated, previous and newly inferred meanings of taxonomic names are individuated accordingâ€¦ (More)

- Maurice J. Jansen, Jayalal Sarma
- Theory of Computing Systems
- 2010

We use algorithmic tools for graphs of small treewidth to address questions in complexity theory. For our main construction, we prove that multiplicatively disjoint arithmetic circuits of size n O(1)â€¦ (More)

- Maurice J. Jansen, Youming Qiao, Jayalal Sarma
- Electronic Colloquium on Computational Complexity
- 2010

In this paper we study polynomial identity testing of sums of k read-once algebraic branching programs (Î£k-RO-ABPs), generalizing the work of Shpilka and Volkovich [1, 2], who considered sums of kâ€¦ (More)

- Maurice J. Jansen, Rahul Santhanam
- ICALP
- 2011

We show that over fields of characteristic zero there does not exist a polynomial p(n) and a constant-free succinct arithmetic circuit family {Î¦n}, where Î¦n has size at most p(n) and depth O(1), suchâ€¦ (More)

- Maurice J. Jansen, Rahul Santhanam
- STACS
- 2011

We associate to each Boolean language complexity class C the algebraic class aÂ·C consisting of families of polynomials {fn} for which the evaluation problem over Z is in C. We prove the followingâ€¦ (More)

- Maurice J. Jansen
- STACS
- 2010

Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit multilinearâ€¦ (More)

- Maurice J. Jansen, Meena Mahajan, B. V. Raghavendra Rao
- computational complexity
- 2013

The class of polynomials computable by polynomial size log-depth arithmetic circuits (VNC 1) is known to be computable by constant width polynomial degree circuits (VsSC 0), but whether the converseâ€¦ (More)

- Maurice J. Jansen, Rahul Santhanam
- ITCS
- 2011

Suppose <i>f</i> is a univariate polynomial of degree <i>r</i> = <i>r</i>(<i>n</i>) that is computed by a size <i>n</i> arithmetic circuit. It is a basic fact of algebra that a nonzero univariateâ€¦ (More)

- Maurice J. Jansen, Youming Qiao, Jayalal Sarma
- FSTTCS
- 2010

In this paper we study algebraic branching programs (ABPs) with restrictions on the order and the number of reads of variables in the program. An ABP is given by a layered directed acyclic graph withâ€¦ (More)