average-case hard problem
C50275
concept
An average-case hard problem is a computational problem for which solving randomly chosen instances (under some natural input distribution) is believed to be infeasible for any efficient algorithm, not just the worst-case instances.
All labels observed (1)
| Label | Occurrences |
|---|---|
| average-case hard problem canonical | 1 |
Description generation (CDg)
The one-sentence description above was generated by prompting gpt-5.1 with the class name and this instruction.
Instruction
generate a one-sentence description for a given conceptual class. # Response Format Return only the sentence: "Description: [one-sentence description of the conceptional class]"
Input
Class: average-case hard problem
Generated description
An average-case hard problem is a computational problem for which solving randomly chosen instances (under some natural input distribution) is believed to be infeasible for any efficient algorithm, not just the worst-case instances.
Instances (1)
| Instance | Via concept surface |
|---|---|
|
short integer solution (SIS) problem
surface form:
short integer solution problem
|
— |