Cluster Computing and the Power of Edge Recognition
Although complexity theory already extensively studies path-cardinality-based restrictions on the power of nondeterminism, this paper is motivated by a more recent goal: To gain insight into how much of a restriction it is of nondeterminism to limit machines to have just one contiguous (with respect to some simple order) interval of accepting paths. In particular, we study the robustness—the invariance under definition changes—of the cluster class CL#P . This class contains each #P function that is computed by a balanced Turing machine whose accepting paths always form a cluster with respect to some length-respecting total order with efficient adjacency checks. The definition of CL#P is heavily influenced by the defining paper’s focus on (global) orders. In contrast, we define a cluster class, CLU#P, to capture what seems to us a more natural model of cluster computing. We prove that the naturalness is costless: CL#P = CLU#P. Then we exploit the more natural, flexible features of CLU#P to prove new robustness results for CL#P and to expand what is known about the closure properties of CL#P.
The complexity of recognizing edges—of an ordered collection of computation paths or of a cluster of accepting computation paths—is central to this study. Most particularly, our proofs exploit the power of unique discovery of edges—the ability of nondeterministic functions to, in certain settings, discover on exactly one (in some cases, on at most one) computation path a critical piece of information regarding edges of orderings or clusters.
KeywordsTuring Machine Cluster Computing Closure Property Computation Path Unique Discovery
Unable to display preview. Download preview PDF.
- Balcázar, J., Díaz, J., Gabarró, J.: Structural Complexity I, 2nd edn. EATCS Texts in Theoretical Computer Science. Springer, Heidelberg (1995)Google Scholar
- Hemaspaandra, L., Homan, C., Kosub, S.: Cluster computing and the power of edge recognition. Technical Report TR-878, Department of Computer Science, University of Rochester, Rochester, NY (September 2005)Google Scholar
- Hemaspaandra, L., Homan, C., Kosub, S., Wagner, K.: The complexity of computing the size of an interval. Technical Report TR-856, Department of Computer Science, University of Rochester, Rochester, NY (February 2005)  This is an expanded version ofGoogle Scholar
- Meyer, A., Paterson, M.: With what frequency are apparently intractable problems difficult? Technical Report MIT/LCS/TM-126, Laboratory for Computer Science, MIT, Cambridge, MA (1979)Google Scholar
- : Optimal algorithms for self-reducible problems. In: Proceedings of the 3rd International Colloquium on Automata, Languages, and Programming, pp. 322–337. Edinburgh University Press (1976)Google Scholar
- Selman, A.: A note on adaptive vs. nonadaptive reductions to NP. Technical Report 90-20, Department of Computer Science, State University of New York at Buffalo, Buffalo, NY (September 1990)Google Scholar