Author:
Kummer Martin,Stephan Frank
Reference22 articles.
1. Combinatorial Search. Wiley-Teubner Series in Computer Science. John Wiley & Sons Ltd., and B. G. Teubner, Stuttgart, 1988.
2. Query-limited reducibilities. Ph. D. thesis, Stanford University, Stanford, USA, 1987.
3. Unbounded Searching Algorithms
4. On the complexity of finding the chromatic number of a recursive graph I: the bounded case
5. On the complexity of finding the chromatic number of a recursive graph II: the unbounded case
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献