Welcome to the resource topic for 2008/363
Title:
An argument for Hamiltonicity
Authors: Vadym Fedyukovych
Abstract:A constant-round interactive argument is introduced to show existence of a Hamiltonian cycle in a directed graph. Graph is represented with a characteristic polynomial, top coefficient of a verification polynomial is tested to fit the cycle, soundness follows from Schwartz-Zippel lemma.
ePrint: https://eprint.iacr.org/2008/363
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .