No article text was recorded for this version.
algebraic circuit representation
Version 1 of 128 papers34 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Algebraic Proof Complexity: Progress, Frontiers and Challenges
- Blog: Circuit complexity, proof complexity, and polynomial identity testing
- Blog: Quantifier Elimination over Finite Fields Using Gröbner Bases
- Blog: An And-Sum Circuit with Signed Edges That Is More Succinct than SDD
- Blog: Proving UNSAT in Zero Knowledge
- Blog: Zombie: Middleboxes that Don't Snoop
- Blog: Making $$\textsf {IP}=\textsf {PSPACE}$$ Practical: Efficient Interactive Protocols for BDD Algorithms
- Blog: Solving MAX-r-SAT Above a Tight Lower Bound
- Blog: Homomorphic Hashing for Sparse Coefficient Extraction
- Blog: Quadratic Span Programs and Succinct NIZKs without PCPs
- Blog: Synthesis for Polynomial Lasso Programs
- Blog: $\text{P}^4$Bench: Contamination-Proof, Publicly Verifiable, and Privacy-Preserving LLM Evaluation via Zero-Knowledge Proofs
- Blog: Learning Plaintext-Ciphertext Cryptographic Problems via ANF-based SAT Instance Representation
- Blog: Reducing Communication Complexity of Random Number Bitwise-Sharing for Efficient Multi-party Computation
- Blog: Practically Efficient Proof of Retrievability in Cloud Storage
- Blog: On the Evolution of Boolean Functions with the Algebraic Normal Form Representation
- Blog: Privacy when Everyone is Watching: An SOK on Anonymity on the Blockchain
- Blog: Verifiable computation using multiple provers
- Blog: Efficient Parallel Verification of Galois Field Multipliers
- Blog: A verified algebraic representation of Cairo program execution
- Blog: The Existential Theory of the Reals with Summation Operators
- Blog: An Equational Approach to Theorem Proving in First-Order Predicate Calculus
- Blog: The Hardness of Reasoning about Probabilities and Causality
- Blog: A General Design of Stochastic Circuit and Its Synthesis
- Blog: Quantum Algorithm for Optimization and Polynomial System Solving over Finite Field and Application to Cryptanalysis
- Blog: Practical Verified Computation with Streaming Interactive Proofs
- Blog: Border basis detection is NP-complete
- Blog: Coded State Machine - Scaling State Machine Execution under Byzantine Faults
History & citation
Current · Permanent link
- Algebraic Reductions for Succinct Verified Computation merged into this direction (50% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_algebraic_circuit_representation_13ada193,
title = {algebraic circuit representation},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/algebraic-circuit-representation/rdr_13ada193dab64192a295e7b3be9df189},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_algebraic_circuit_representation_13ada193_v1,
title = {algebraic circuit representation},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/algebraic-circuit-representation/rdr_13ada193dab64192a295e7b3be9df189/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}