Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs

DOI10.4086/toc.2017.v013a002zbMath1378.68080arXiv1601.08031OpenAlexW2787135910MaRDI QIDQ5368905

Rohit Gurjar, Nitin Saxena, Arpita Korwar

Publication date: 11 October 2017

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.08031

zbMATH Keywords

hitting setspolynomial identity testingarithmetic branching programs

Mathematics Subject Classification ID

Related Items (7)

Unnamed Item ⋮ Unnamed Item ⋮ Improved Explicit Hitting-Sets for ROABPs ⋮ Unnamed Item ⋮ Blackbox identity testing for sum of special ROABPs and its border class ⋮ Unnamed Item ⋮ Improved hitting set for orbit of ROABPs

This page was built for publication: Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs