Binary search and recursive graph problems

DOI10.1016/S0304-3975(96)00266-6zbMath0901.68038MaRDI QIDQ1391302

William I. Gasarch, Katia S. Guimarães

Publication date: 22 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

binary search probleminfinite recursive graph

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Related Items

The complexity of finding SUBSEQ\((A)\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of finding the chromatic number of a recursive graph. II: The unbounded case
• An almost optimal algorithm for unbounded searching
• Terse, superterse, and verbose sets
• On the complexity of finding the chromatic number of a recursive graph. I: The bounded case
• Unbounded Searching Algorithms
• A proof of Beigel's cardinality conjecture
• Effective coloration
• Recursively enumerable sets and degrees
• Effective Matchmaking and k-Chromatic Graphs