Highly Influenced

10 Excerpts

@article{Hemaspaandra2004AlgebraicPF, title={Algebraic Properties for Selector Functions}, author={Lane A. Hemaspaandra and Harald Hempel and Arfst Nickelsen}, journal={SIAM J. Comput.}, year={2004}, volume={33}, pages={1309-1337} }

- Published in SIAM J. Comput. 2004
DOI:10.1137/S0097539703427550

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 [Ko83] and the best current lower bound is linear [HT96]. We prove that every associatively P-selective set is commutatively, associatively P-selective. Using this, we establish an… CONTINUE READING