Algebraic properties for selector functions
The nondeterministic advice complexity of the P-selective sets is known to be exactly linear. Regarding the deterministic advice complexity of the P-selective sets - i.e., the amount of Karp-Lipton advice needed for polynomial-time machines to recognize them in general - the best current upper bound is quadratic [K. Ko, J. Comput. System Sci., 26 (1983), pp. 209 - 221] and the best current lower bound is linear [L. Hemaspaandra and L. Torenvliet, Theoret. Comput. Sci., 154 (1996), pp. 367 - 377]. We prove that every associatively P-selective set is commutatively, associatively P-selective. Using this, we establish an algebraic sufficient condition for the P-selective sets to have a linear upper bound ( which thus would match the existing lower bound) on their deterministic advice complexity: If all P-selective sets are associatively P-selective, then the deterministic advice complexity of the P-selective sets is linear. The weakest previously known sufficient condition was P = NP. We also establish related results for algebraic properties of, and advice complexity of, the non-deterministically selective sets.
algebraic properties selector functions advice complexity p-selectivity associativity commutativity computational complexity theory np-selectivity nondeterministic selectivity nonuniform complexity semifeasible computation immunity printability tournaments digraphs