ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a finite solvable group. An nn-input GG-program is a sequence of group elements selected according to the values of input bits, and it computes the nn-input AND{\mathrm{AND}} function when membership in some subset of GG agrees with the function's value. Polynomial-exponent AND-weakness conjecture. Every GG-program for the nn-input AND{\mathrm{AND}} function has length

2nΩ(1).2^{n^{\Omega(1)}}.

This is proposed as a possible weaker form of the AND-weakness conjecture after the paper explains that stronger and certain refined forms are false or unsupported; its resolution is left open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.