The Mapmaker's dilemma
From MaRDI portal
Publication:1182308
DOI10.1016/0166-218X(91)90077-AzbMath0748.05055MaRDI QIDQ1182308
Richard Beigel, William I. Gasarch
Publication date: 28 June 1992
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items
Cites Work
- Recursive coloration of countable graphs
- Bounded query classes and the difference hierarchy
- The Mapmaker's dilemma
- ``Global graph problems tend to be intractable
- On the complexity of finding the chromatic number of a recursive graph. I: The bounded case
- Effective coloration
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item