LWPP and WPP are not uniformly gap-definable

Resolving an issue open since Fenner, Fortnow, and Kurtz raised it in [FFK94], we prove that LWPP is not uniformly gap-definable and that WPP is not uniformly gap-definable. We do so in the context of a broader investigation, via the polynomial degree bound technique, of the lowness, Turing hardness, and inclusion relationships of counting and other central complexity classes.

• Type: Journal
• Year: 2006
• Where: JCSS
• Authors: Holger Spakowski, Rahul Tripathi
• Keywords: Broader Investigation, Central Complexity Classes, Degree Bound Technique, JCSS 2006