How to verify computations with a rational network

DOI10.1142/9789811278631_0011MaRDI QIDQ7033979zbMATH OpenFDO

Authors Sanjay Jain, Prateek Saxena, Frank Stephan, Jason Teutsch

Publication date 3 February 2025

Full work available at URL https://doi.org/10.1142/9789811278631_0011

Mathematics Subject Classification ID

Computability and recursion theory (03Dxx) Theory of computing (68Qxx)

This page was built for publication: How to verify computations with a rational network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7033979)