Non-commutative arithmetic circuits with division
From MaRDI portal
Publication:2988867
DOI10.1145/2554797.2554805zbMath1364.68200OpenAlexW2089368046MaRDI QIDQ2988867
Publication date: 19 May 2017
Published in: Proceedings of the 5th conference on Innovations in theoretical computer science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2554797.2554805
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
Characterizing Propositional Proofs as Noncommutative Formulas ⋮ Ranks of linear matrix pencils separate simultaneous similarity orbits ⋮ Algorithms for orbit closure separation for invariants and semi-invariants of matrices ⋮ Efficient Black-Box Identity Testing for Free Group Algebras ⋮ On non-commutative rank and tensor rank ⋮ Polynomial degree bounds for matrix semi-invariants ⋮ Characteristic free description of semi-invariants of \(2 \times 2\) matrices ⋮ Operator scaling: theory and applications
Cites Work
- Unnamed Item
- A hierarchy of polynomial time lattice basis reduction algorithms
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- (Leveled) fully homomorphic encryption without bootstrapping
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Trapdoors for hard lattices and new cryptographic constructions
- Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness
- Evaluating Branching Programs on Encrypted Data
- Bounds for Width Two Branching Programs
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
- New lattice-based cryptographic constructions
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- On lattices, learning with errors, random linear codes, and cryptography
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Non-commutative arithmetic circuits with division
