|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 14 occurrences of 8 keywords
|
|
|
|
|
Results
Found 35 publication records. Showing 35 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Zeev Dvir, Anup Rao, Avi Wigderson, Amir Yehudayoff |
Restriction access.  |
ITCS  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Dvir, Guillaume Malod, Sylvain Perifel, Amir Yehudayoff |
Separating multilinear branching programs and formulas.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Zeev Dvir, Anup Rao, Avi Wigderson, Amir Yehudayoff |
Restriction Access.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Pavel Hrubes, Amir Yehudayoff |
Arithmetic Complexity in Ring Extensions.  |
Theory of Computing  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ron Peled, Ariel Yadin, Amir Yehudayoff |
The maximal probability that k-wise independent bits are all 1.  |
Random Struct. Algorithms  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Amir Yehudayoff |
Affine extractors over prime fields.  |
Combinatorica  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavel Hrubes, Amir Yehudayoff |
Homogeneous Formulas and Symmetric Polynomials.  |
Computational Complexity  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz, Amir Yehudayoff |
Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors.  |
J. Comput. Syst. Sci.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Boaz Barak, Zeev Dvir, Amir Yehudayoff, Avi Wigderson |
Rank bounds for design matrices with applications toc ombinatorial geometry and locally correctable codes.  |
STOC  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavel Hrubes, Avi Wigderson, Amir Yehudayoff |
Non-commutative circuits and the sum-of-squares problem.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Mark Braverman, Anup Rao, Ran Raz, Amir Yehudayoff |
Pseudorandom Generators for Regular Branching Programs.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Pavel Hrubes, Avi Wigderson, Amir Yehudayoff |
Relationless completeness and separations.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Boaz Barak, Zeev Dvir, Avi Wigderson, Amir Yehudayoff |
Rank Bounds for Design Matrices with Applications to Combinatorial Geometry and Locally Correctable Codes.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Amir Shpilka, Amir Yehudayoff |
Arithmetic Circuits: A survey of recent results and open questions.  |
Foundations and Trends in Theoretical Computer Science  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Boaz Barak, Zeev Dvir, Avi Wigderson, Amir Yehudayoff |
Rank Bounds for Design Matrices with Applications to Combinatorial Geometry and Locally Correctable Codes  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Mark Braverman, Anup Rao, Ran Raz, Amir Yehudayoff |
Pseudorandom Generators for Regular Branching Programs.  |
FOCS  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavel Hrubes, Avi Wigderson, Amir Yehudayoff |
Relationless Completeness and Separations.  |
IEEE Conference on Computational Complexity  |
2010 |
DBLP DOI BibTeX RDF |
Completeness, Separations, Algebraic complexity |
| 1 | Pavel Hrubes, Avi Wigderson, Amir Yehudayoff |
Non-commutative circuits and the sum-of-squares problem.  |
STOC  |
2010 |
DBLP DOI BibTeX RDF |
lower bounds, algebraic complexity |
| 1 | Pavel Hrubes, Amir Yehudayoff |
Monotone separations for constant degree polynomials.  |
Inf. Process. Lett.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrej Bogdanov, Zeev Dvir, Elad Verbin, Amir Yehudayoff |
Pseudorandomness for Width 2 Branching Programs.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Ronen Gradwohl, Omer Reingold, Ariel Yadin, Amir Yehudayoff |
Players' Effects Under Limited Independence.  |
Math. Oper. Res.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz, Amir Yehudayoff |
Lower Bounds and Separations for Constant Depth Multilinear Circuits.  |
Computational Complexity  |
2009 |
DBLP DOI BibTeX RDF |
68Q17, Subject classification |
| 1 | Pavel Hrubes, Amir Yehudayoff |
Homogeneous formulas and symmetric polynomials  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Zeev Dvir, Amir Shpilka, Amir Yehudayoff |
Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits.  |
SIAM J. Comput.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronen Gradwohl, Amir Yehudayoff |
t-Wise independence with local dependencies.  |
Inf. Process. Lett.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz, Amir Yehudayoff |
Lower Bounds and Separations for Constant Depth Multilinear Circuits.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Ran Raz, Amir Yehudayoff |
Balancing Syntactically Multilinear Arithmetic Circuits.  |
Computational Complexity  |
2008 |
DBLP DOI BibTeX RDF |
Subject classification, 68W30 |
| 1 | Ran Raz, Amir Shpilka, Amir Yehudayoff |
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits.  |
SIAM J. Comput.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz, Amir Yehudayoff |
Multilinear Formulas, Maximal-Partition Discrepancy and Mixed-Sources Extractors.  |
FOCS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz, Amir Yehudayoff |
Lower Bounds and Separations for Constant Depth Multilinear Circuits.  |
IEEE Conference on Computational Complexity  |
2008 |
DBLP DOI BibTeX RDF |
Constant Depth, Lower Bounds, Separations, Arithmetic Circuits |
| 1 | Zeev Dvir, Amir Shpilka, Amir Yehudayoff |
Hardness-randomness tradeoffs for bounded depth arithmetic circuits.  |
STOC  |
2008 |
DBLP DOI BibTeX RDF |
bounded depth circuits, hardness-randomness tradeoffs, identity testing, lower bounds, arithmetic circuits |
| 1 | Ran Raz, Amir Yehudayoff |
Multilinear Formulas, Maximal-Partition Discrepancy and Mixed-Sources Extractors.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Zeev Dvir, Amir Shpilka, Amir Yehudayoff |
Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Ran Raz, Amir Shpilka, Amir Yehudayoff |
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits.  |
FOCS  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz, Amir Shpilka, Amir Yehudayoff |
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2006 |
DBLP BibTeX RDF |
|
Displaying result #1 - #35 of 35 (100 per page; Change: )
|
|