#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2011

2018

- This year (4)
- Last 5 years (17)
- Last 10 years (24)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Olaf Beyersdorff, Leroy Chew, Karteek Sreenivasaiah
- Electronic Colloquium on Computational Complexity
- 2014

We provide a characterisation for the size of proofs in tree-like Q-Resolution by a Prover-Delayer game, which is inspired by a similar characterisation for the proof size in classical tree-like… (More)

We study the problem of testing if the polynomial computed by an arithmetic circuit is identically zero (ACIT). We give a deterministic polynomial time algorithm for this problem when the inputs are… (More)

- Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
- Electronic Colloquium on Computational Complexity
- 2018

In this work we prove the first Fixed-depth Size-Hierarchy Theorem for uniform AC[⊕]. In particular, we show that for any fixed d, the class Cd,k of functions that have uniform AC[⊕] formulas of… (More)

The problem of constructing hazard-free Boolean circuits dates back to the 1940s and is an important problem in circuit design. Our main lower-bound result unconditionally shows the existence of… (More)

- Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah
- COCOON
- 2012

Given a stream of n numbers and a number B, the subset sum problem deals with checking whether there exists a subset of the stream that adds to exactly B. The unary subset sum problem, USS, is the… (More)

- Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah
- Theor. Comput. Sci.
- 2014

We study the problem of testing if the polynomial computed by an arithmetic circuit is identically zero. We give a deterministic polynomial time algorithm for this problem when the inputs are… (More)

- Olaf Beyersdorff, Samir Datta, +4 authors Heribert Vollmer
- MFCS
- 2011

- Meena Mahajan, Nitin Saurabh, Karteek Sreenivasaiah
- CATS
- 2012

We revisit the problem of counting paths in width-2 planar branching programs. We show that this is hard for Boolean NC under ACC[5] reductions, completing a proof strategy outlined in [3]. On the… (More)