Semantic Scholar uses AI to extract papers important to this topic.
The aim of the paper is to examine the computational complexity and algorithmics of enumeration, the task to output all solutions… Expand Abstract We study closed choice principles for different spaces. Given information about what does not constitute a solution… Expand Abstract In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural… Expand We study reducibilities that act as measures of relative randomness on reals, concentrating particularly on their behavior on the… Expand AbstractTwo natural classes of counting problems that are interreducible
under approximation-preserving reductions are: (i) those… Expand For two years, public key encryption has become an essential topic in cryptography, namely with security against chosen… Expand Much structural work on NP-complete sets has exploited SAT's d-self-reducibility. We exploit the additional fact that SAT is a d… Expand In this note, we study NP-selective sets (formally, sets that are selective via NPSVt functions) as a natural generalization of P… Expand In this paper, a new class of zero knowledge interactive proofs, a divertible zero knowledge interactive proof, is presented… Expand The notion of a zero knowledge interactive proof that one party "knows" some secret information is explored. It is shown that any… Expand