On arithmetic branching programs
From MaRDI portal
Publication:1961372
zbMath0948.68071MaRDI QIDQ1961372
Publication date: 22 November 2000
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks ⋮ On approximation by \(^{\oplus}\)-OBDDs ⋮ From private simultaneous messages to zero-information Arthur-Merlin protocols and back ⋮ Arithmetic circuits: the chasm at depth four gets wider ⋮ On Linear Secret Sharing for Connectivity in Directed Graphs ⋮ Key-dependent message security: generic amplification and completeness ⋮ New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
Cites Work
- Lower bounds for monotone span programs
- On computing the determinant in small parallel time using a small number of processors
- A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
- On lower bounds for read-\(k\)-times branching programs
- Structure and importance of logspace-MOD class
- Fast parallel matrix and GCD computations
- Making Nondeterminism Unambiguous
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On arithmetic branching programs
