1 paper
Pavel Hubáček, Jan Václavek
In this work, we study the discrete logarithm problem in the context of TFNP - the complexity class of search problems with a syntactically guaranteed existence of a solution for a…