Searching for authors named "Sambuddha Roy" – sorted by Relevance.
-
unknown title
- Sambuddha Roy Research Statement Introduction My research interest lies in theoretical
- Add To MetaCart
-
A nonuniform lower bound for NEXP
- A nonuniform lower bound for NEXP 1 Introduction Sambuddha Roy ∗ June 27, 2005 We try to find
- Add To MetaCart
-
Topology inside NC
- NC Sambuddha Roy Rutgers University, New Brunswick, NJ, USA samroy@(email omitted); Abstract Samir
- Add To MetaCart
-
DETERMINISTICALLY ISOLATING A PERFECT MATCHING IN BIPARTITE PLANAR GRAPHS
- KULKARNI 2 , AND SAMBUDDHA ROY 3 1 Chennai Mathematical Institute, Chennai, India. E-mail address: sdatta
- Add To MetaCart
-
The directed planar reachability problem
- The Directed Planar Reachability Problem Eric Allender 1 , Samir Datta 2 , and Sambuddha Roy 3 1
- Cited by 13 (7 self) – Add To MetaCart
-
Oblivious symmetric alternation
- Oblivious Symmetric Alternation Venkatesan T. Chakaravarthy1 and Sambuddha Roy2 1 IBM India
- Cited by 6 (2 self) – Add To MetaCart
-
Approximating Maximum Weight K-Colorable Subgraphs in Chordal Graphs
- Sambuddha Roy IBM India Research Lab, New Delhi. {vechakra,sambuddha}@(email omitted); Abstract We present a 2
- Add To MetaCart
-
Derandomization and Distinguishing Complexity
- . Michal Kouck´y £ Rutgers University mkoucky@(email omitted); Sambuddha Roy £ Rutgers University samroy
- Cited by 8 (4 self) – Add To MetaCart
-
ABSTRACT Decision Trees for Entity Identification: Approximation Algorithms and Hardness Results
- Venkatesan T. Chakaravarthy Vinayaka Pandit Sambuddha Roy Pranjal Awasthi Mukesh Mohania IBM India Research
- Cited by 2 (1 self) – Add To MetaCart
-
Abstract We study some problems solvable in deterministic polynomial time given oracle access to thepromise version of the Arthur-Merlin class AM. The main result is that BPP
- Arthur and Merlin as Oracles Venkatesan T. Chakaravarthy Sambuddha Roy IBM India Research Lab
- Add To MetaCart

