Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 conf/coco/AndersonFSSV16
%A Anderson, Matthew
%A Forbes, Michael A.
%A Saptharishi, Ramprasad
%A Shpilka, Amir
%A Volk, Ben Lee
%B CCC
%D 2016
%E Raz, Ran
%I Schloss Dagstuhl - Leibniz-Zentrum für Informatik
%K dblp
%P 30:1-30:25
%T Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs.
%U http://dblp.uni-trier.de/db/conf/coco/coco2016.html#AndersonFSSV16
%V 50
%@ 978-3-95977-008-8
@inproceedings{conf/coco/AndersonFSSV16,
added-at = {2023-06-26T00:00:00.000+0200},
author = {Anderson, Matthew and Forbes, Michael A. and Saptharishi, Ramprasad and Shpilka, Amir and Volk, Ben Lee},
biburl = {https://www.bibsonomy.org/bibtex/2badb7d1ab731bd9c2d51718584b759bf/dblp},
booktitle = {CCC},
crossref = {conf/coco/2016},
editor = {Raz, Ran},
ee = {https://doi.org/10.4230/LIPIcs.CCC.2016.30},
interhash = {eeb2095ffa6f6d694450ed491523f38f},
intrahash = {badb7d1ab731bd9c2d51718584b759bf},
isbn = {978-3-95977-008-8},
keywords = {dblp},
pages = {30:1-30:25},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
series = {LIPIcs},
timestamp = {2024-04-10T01:31:11.000+0200},
title = {Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs.},
url = {http://dblp.uni-trier.de/db/conf/coco/coco2016.html#AndersonFSSV16},
volume = 50,
year = 2016
}