NLTS conjecture
= NLTS conjecture
{wiki=NLTS_conjecture}
The NLTS conjecture, or the "No Low for Random Sets" conjecture, is a hypothesis in computational complexity theory concerning the relationships between various complexity classes, particularly focusing on non-uniform complexity and the existence of certain kinds of reductions.