The 1-Versus-2 Queries Problem Revisited

The 1-versus-2 queries problem, which has been extensively studied in computational complexity theory, asks in its generality whether every efficient algorithm that makes at most 2 queries to a p k -complete set Lk has an efficient simulation that makes at most 1 query to Lk. We obtain solutions to this problem under hypotheses weaker than previously considered. We prove that:

• Type: Journal
• Year: 2010
• Where: MST
• Authors: Rahul Tripathi
• Keywords: Computational Complexity Theory, Efficient Algorithm, Efficient Simulation, Hardware, MST 2010