Deterministic Black-Box Identity Testing $pi$-Ordered Algebraic Branching Programs
From MaRDI portal
Publication:2908859
DOI10.4230/LIPIcs.FSTTCS.2010.296zbMath1245.68109OpenAlexW2963570027MaRDI QIDQ2908859
M. N. Jayalal Sarma, Youming Qiao, Maurice Jansen
Publication date: 29 August 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_7049.html
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
Monomials, multilinearity and identity testing in simple read-restricted circuits ⋮ On the Expressive Power of Read-Once Determinants ⋮ Deterministic identity testing for sum of read-once oblivious arithmetic branching programs ⋮ Algebraic proofs over noncommutative formulas ⋮ Read-once polynomial identity testing ⋮ Unnamed Item ⋮ Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits ⋮ Limitations of sums of bounded read formulas and ABPs
This page was built for publication: Deterministic Black-Box Identity Testing $pi$-Ordered Algebraic Branching Programs
