|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 17 publication records. Showing 17 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer |
Counting classes and the fine structure between NC1 and L.  |
Theor. Comput. Sci.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, B. V. Raghavendra Rao |
Faster algorithms for finding and counting subgraphs. |
J. Comput. Syst. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | B. V. Raghavendra Rao, Jayalal M. N. Sarma |
On the Complexity of Matroid Isomorphism Problem. |
Theory Comput. Syst. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Bodo Manthey, B. V. Raghavendra Rao |
Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals. |
WADS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | B. V. Raghavendra Rao, Jayalal M. N. Sarma |
Isomorphism testing of read-once functions and polynomials. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer |
Counting Classes and the Fine Structure between NC1 and L. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Nutan Limaye, Meena Mahajan, B. V. Raghavendra Rao |
Arithmetizing Classes Around NC\textsf{NC}1 and L\textsf{L}. |
Theory Comput. Syst. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer |
Counting Classes and the Fine Structure between NC1 and L. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, B. V. Raghavendra Rao, Saket Saurabh |
Faster Algorithms for Finding and Counting Subgraphs |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | B. V. Raghavendra Rao, Jayalal M. N. Sarma |
On the Complexity of Matroid Isomorphism Problems. |
CSR |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Maurice J. Jansen, B. V. Raghavendra Rao |
Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity. |
CSR |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Meena Mahajan, B. V. Raghavendra Rao |
Small-Space Analogues of Valiant's Classes. |
FCT |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Meena Mahajan, B. V. Raghavendra Rao |
Arithmetic circuits, syntactic multilinearity, and the limitations of skew formulae. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | B. V. Raghavendra Rao, Jayalal M. N. Sarma |
On the Complexity of Matroid Isomorphism Problem |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Meena Mahajan, B. V. Raghavendra Rao |
Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae. |
MFCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Nutan Limaye, Meena Mahajan, B. V. Raghavendra Rao |
Arithmetizing classes around NC^1 and L. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Nutan Limaye, Meena Mahajan, B. V. Raghavendra Rao |
Arithmetizing Classes Around NC 1 and L. |
STACS |
2007 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #17 of 17 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")