#### Filter Results:

- Full text PDF available (11)

#### Publication Year

2010

2016

- This year (0)
- Last 5 years (11)
- Last 10 years (16)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Rohit Gurjar, Arpita Korwar, Nitin Saxena, Thomas Thierauf
- computational complexity
- 2016

A read-once oblivious arithmetic branching program (ROABP) is an arithmetic branching program (ABP) where each variable occurs in at most one layer. We give the first polynomial-time whiteboxâ€¦ (More)

- Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena
- Electronic Colloquium on Computational Complexity
- 2014

We give a nO(logn)-time (n is the input size) blackbox polynomial identity testing algorithm for unknown-order read-once oblivious arithmetic branching programs (ROABP). The best time-complexityâ€¦ (More)

- Rohit Gurjar, Arpita Korwar, Nitin Saxena
- Conference on Computational Complexity
- 2016

- Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena
- Electronic Colloquium on Computational Complexity
- 2013

The depth-3 model has recently gained much importance, as it has become a stepping-stone to understanding general arithmetic circuits. Its restriction to multilinearity has known exponential lowerâ€¦ (More)

- Rohit Gurjar, Arpita Korwar, Nitin Saxena, Thomas Thierauf
- Electronic Colloquium on Computational Complexity
- 2014

A read once ABP is an arithmetic branching program with each variable occurring in at most one layer. We give the first polynomial time whitebox identity test for a polynomial computed by a sum ofâ€¦ (More)

- Rohit Gurjar, Arpita Korwar, Jochen Messner, Thomas Thierauf
- Electronic Colloquium on Computational Complexity
- 2013

A red-blue graph is a graph where every edge is colored either red or blue. The exact perfect matching problem asks for a perfect matching in a red-blue graph that has exactly a given number of redâ€¦ (More)

- Arpita Korwar
- 2010

Bloom filters are used for answering queries on set membership. In this data structure, the whole element is not stored at the hashed address. Only a few bits are set in an array. Given a set S ofâ€¦ (More)

- Arpita Korwar
- 2010

Each of the key values x comes from a universe U , i.e. x âˆˆ U . In this document, we assume U = {1, 2, . . . N}. Observe that the set S is a dynamic set. Each of the Insert and Delete operations mayâ€¦ (More)

- Arpita Korwar
- 2016

A read-once oblivious arithmetic branching program (ROABP) is an arithmetic branching program (ABP) where each variable occurs in at most one layer. In this chapter, we give the first polynomial timeâ€¦ (More)