Loading jsMath...
Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > MURILO SILVA:
All reports by Author Murilo Silva:

TR18-193 | 14th November 2018
Nicollas Sdroievski, Murilo Silva, André Vignatti

The Hidden Subgroup Problem and MKTP

We show that the Hidden Subgroup Problem for black-box groups is in \mathrm{BPP}^\mathrm{MKTP} (where \mathrm{MKTP} is the Minimum \mathrm{KT} Problem) using the techniques of Allender et al (2018). We also show that the problem is in \mathrm{ZPP}^\mathrm{MKTP} provided that there is a \emph{pac overestimator} computable in \mathrm{ZPP}^\mathrm{MKTP} for the logarithm ... more >>>




ISSN 1433-8092 | Imprint