Pages that link to "Item:Q4277541"
From MaRDI portal
The following pages link to On the Computational Complexity of Small Descriptions (Q4277541):
Displaying 6 items.
- All superlinear inverse schemes are coNP-hard (Q2575753) (← links)
- Monotonous and randomized reductions to sparse sets (Q4717050) (← links)
- Upper bounds for the complexity of sparse and tally descriptions (Q4864446) (← links)
- On monotonous oracle machines (Q5096350) (← links)
- On the complexity of small description and related topics (Q5096821) (← links)
- Reductions to sets of low information content (Q5204315) (← links)
