Prove DepthThree (openai/math family 112: Beyond the square-root exponent for depth-three circuits) in Lean…
Prove DepthThree (openai/math family 112: Beyond the square-root exponent for depth-three circuits) in Lean…: a task in openai/math as Harbor environments (Harbor dataset). Context: this statement belongs to family 112 of the release, Beyond the square-root exponent for depth-three circuits…
The task
Context: this statement belongs to family 112 of the release, *Beyond the square-root exponent for depth-three circuits* (Theoretical computer science). The family as a whole: Constructs a single language in deterministic polynomial time whose $n$-bit membership function requires $2^{\omega(\sqrt n)}$ total gates in…
Part of raising-heart/openai-math.