1 citations · 2 across the 6 of their papers we have counts for
1 paper · 1 filter
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…