Skip to content

Author

Julius Zhang

We have 1 of 3 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

2026

Spain: Succinct proofs for numerical computations

The starting insight of Spain is that since numerical computations inherently have approximation error, the constraint formalism should likewise allow for approximate satisfiability, and this paper introduces a new proof protocol and new ways to translate computations to constraints.

Zachary DeStefano, N. Golub, Zile Huang et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.