Dissection: A New Paradigm For Solving Bicomposite Search Problems
In this paper, we introduce the new notion of bicomposite search problems, and show that they can be solved with improved combinations of time and space complexities by using a new algorithmic paradigm called dissection.
