Arpita Korwar

According to our database, Arpita Korwar authored at least 10 papers between 2011 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2022

The Complexity of Poset Games.

Stephen A. Fenner, Daniel Grier, Rohit Gurjar, Arpita Korwar, Thomas Thierauf

J. Graph Algorithms Appl., 2022

2017

Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs.

Rohit Gurjar, Arpita Korwar, Nitin Saxena

Theory Comput., 2017

Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs.

Rohit Gurjar, Arpita Korwar, Nitin Saxena, Thomas Thierauf

Comput. Complex., 2017

2016

Identity Testing for constant-width, and commutative, read-once oblivious ABPs.

Rohit Gurjar, Arpita Korwar, Nitin Saxena

Electron. Colloquium Comput. Complex., 2016

2015

Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits.

Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena

SIAM J. Comput., 2015

2014

Deterministic Identity Testing for Sum of Read Once ABPs.

Rohit Gurjar, Arpita Korwar, Nitin Saxena, Thomas Thierauf

Electron. Colloquium Comput. Complex., 2014

2013

Exact Perfect Matching in Complete Graphs.

Rohit Gurjar, Arpita Korwar, Jochen Messner, Thomas Thierauf

Electron. Colloquium Comput. Complex., 2013

On Two-Level Poset Games.

Stephen A. Fenner, Rohit Gurjar, Arpita Korwar, Thomas Thierauf

Electron. Colloquium Comput. Complex., 2013

Hitting-sets for low-distance multilinear depth-3.

Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena

Electron. Colloquium Comput. Complex., 2013

2011

Planarizing Gadgets for Perfect Matching do not Exist.

Rohit Gurjar, Arpita Korwar, Jochen Messner, Simon Straub, Thomas Thierauf

Electron. Colloquium Comput. Complex., 2011