Algebraic Properties for Selector Functions

@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}
}
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

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 41 REFERENCES

On optimal advice for P-selective sets

  • M. Thakur
  • Technical Report TR-819, Department of Computer…
  • 2003

Some Karp–Lipton-type theorems based on S2

  • J. Cai, V. Chakaravarthy, L. Hemaspaandra, M. Ogihara
  • In Proceedings of the 20th Annual Symposium on…
  • 2003

Similar Papers

Loading similar papers…