Counting Complexity of Solvable Black-Box Group Problems

DOI10.1137/S0097539703420651zbMath1105.68046OpenAlexW2114529219MaRDI QIDQ4651496

N. V. Vinodchandran

Publication date: 21 February 2005

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539703420651

zbMATH Keywords

complexity classescomputational group theorycomputational complexity theory

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (3)

LWPP and WPP are not uniformly gap-definable ⋮ Graph Isomorphism is in SPP ⋮ The robustness of LWPP and WPP, with an application to graph reconstruction

This page was built for publication: Counting Complexity of Solvable Black-Box Group Problems