Search dblp for Publications

export results for "Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs"

 download as .bib file

@article{DBLP:journals/toct/AndersonFSSV18,
  author       = {Matthew Anderson and
                  Michael A. Forbes and
                  Ramprasad Saptharishi and
                  Amir Shpilka and
                  Ben Lee Volk},
  title        = {Identity Testing and Lower Bounds for Read-\emph{k} Oblivious Algebraic
                  Branching Programs},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {10},
  number       = {1},
  pages        = {3:1--3:30},
  year         = {2018},
  url          = {https://doi.org/10.1145/3170709},
  doi          = {10.1145/3170709},
  timestamp    = {Mon, 26 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/AndersonFSSV18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AndersonFSSV16,
  author       = {Matthew Anderson and
                  Michael A. Forbes and
                  Ramprasad Saptharishi and
                  Amir Shpilka and
                  Ben Lee Volk},
  editor       = {Ran Raz},
  title        = {Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching
                  Programs},
  booktitle    = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
                  June 1, 2016, Tokyo, Japan},
  series       = {LIPIcs},
  volume       = {50},
  pages        = {30:1--30:25},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2016},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2016.30},
  doi          = {10.4230/LIPICS.CCC.2016.30},
  timestamp    = {Mon, 26 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/coco/AndersonFSSV16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AndersonFSSV15,
  author       = {Matthew Anderson and
                  Michael A. Forbes and
                  Ramprasad Saptharishi and
                  Amir Shpilka and
                  Ben Lee Volk},
  title        = {Identity Testing and Lower Bounds for Read-{\textdollar}k{\textdollar}
                  Oblivious Algebraic Branching Programs},
  journal      = {CoRR},
  volume       = {abs/1511.07136},
  year         = {2015},
  url          = {http://arxiv.org/abs/1511.07136},
  eprinttype    = {arXiv},
  eprint       = {1511.07136},
  timestamp    = {Tue, 30 May 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/AndersonFSSV15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AndersonFSSV15,
  author       = {Matthew Anderson and
                  Michael A. Forbes and
                  Ramprasad Saptharishi and
                  Amir Shpilka and
                  Ben Lee Volk},
  title        = {Identity Testing and Lower Bounds for Read-\emph{k} Oblivious Algebraic
                  Branching Programs},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR15-184}},
  year         = {2015},
  url          = {https://eccc.weizmann.ac.il/report/2015/184},
  eprinttype    = {ECCC},
  eprint       = {TR15-184},
  timestamp    = {Tue, 30 May 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/AndersonFSSV15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics