Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > MINIMUM MONOTONE SATISFYING ASSIGNMENT:
Reports tagged with minimum monotone satisfying assignment:
TR26-052 | 7th April 2026
Shuichi Hirahara, Mikito Nanashima

A Sharp Characterization of Pessiland

It is a long-standing open question whether the average-case hardness of NP implies the existence of a one-way function. The hypothetical world in which this does not hold is called Pessiland, which is the most pessimistic among Impagliazzo's five possible worlds. In this paper, we present the first "sharp" characterization ... more >>>




ISSN 1433-8092 | Imprint