|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 4 occurrences of 4 keywords
|
|
|
|
|
Results
Found 24 publication records. Showing 24 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev |
Near-Optimal Expanding Generating Sets for Solvable Permutation Groups  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar |
Erdős-Rényi Sequences and Deterministic Construction of Expanding Cayley Graphs. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev |
Expanding Generator Sets for Solvable Permutation Groups. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar |
Erdos-Renyi Sequences and Deterministic construction of Expanding Cayley Graphs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka |
Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Partha Mukhopadhyay |
The ideal membership problem and polynomial identity testing. |
Inf. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan |
New Results on Noncommutative and Commutative Polynomial Identity Testing. |
Computational Complexity |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay |
Isomorphism and canonization of tournaments and hypertournaments. |
J. Comput. Syst. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka |
Pseudorandom Generators for CC0[p] and the Fourier Spectrum of Low-Degree Polynomials over Finite Fields. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Zohar Shay Karnin, Partha Mukhopadhyay, Amir Shpilka, Ilya Volkovich |
Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Zohar Shay Karnin, Partha Mukhopadhyay, Amir Shpilka, Ilya Volkovich |
Deterministic identity testing of depth 4 multilinear circuits with bounded top fan-in. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Partha Mukhopadhyay |
Quantum Query Complexity of Multilinear Identity Testing. |
STACS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan |
New results on Noncommutative and Commutative Polynomial Identity Testing. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Partha Mukhopadhyay |
Quantum Query Complexity of Multilinear Identity Testing. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Partha Mukhopadhyay |
Derandomizing the Isolation Lemma and Lower Bounds for Noncommutative Circuit Size. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Partha Mukhopadhyay |
Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Partha Mukhopadhyay |
Quantum Query Complexity of Multilinear Identity Testing |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan |
New results on Noncommutative and Commutative Polynomial Identity Testing |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Partha Mukhopadhyay |
Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan |
New Results on Noncommutative and Commutative Polynomial Identity Testing. |
IEEE Conference on Computational Complexity |
2008 |
DBLP DOI BibTeX RDF |
randomized, polynomial time, deterministic, polynomial identity testing |
| 1 | Vikraman Arvind, Partha Mukhopadhyay |
The Ideal Membership Problem and Polynomial Identity Testing. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Partha Mukhopadhyay |
The Monomial Ideal Membership Problem and Polynomial Identity Testing. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay |
The Complexity of Black-Box Ring Problems. |
COCOON |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay |
On Isomorphism and Canonization of Tournaments and Hypertournaments. |
ISAAC |
2006 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #24 of 24 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")