Advertisement

Generation Problems

  • Elmar Böhler
  • Christian Glaßer
  • Bernhard Schwarz
  • Klaus Wagner
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3153)

Abstract

Given a fixed computable binary operation f, we study the complexity of the following generation problem: The input consists of strings a 1,...,a n ,b. The question is whether b is in the closure of {a 1, ..., a n } under operation f.

For several subclasses of operations we prove tight upper and lower bounds for the generation problems. For example, we prove exponential-time upper and lower bounds for generation problems of length-monotonic polynomial-time computable operations. Other bounds involve classes like NP and PSPACE.

Here the class of bivariate polynomials with positive coefficients turns out to be the most interesting class of operations. We show that many of the corresponding generation problems belong to NP. However, we do not know this for all of them, e.g., for x 2+2y this is an open question. We prove NP-completeness for polynomials x a y b c where a,b,c≥ 1. Also, we show NP-hardness for polynomials like x 2+2y. As a by-product we obtain NP-completeness of the extended sum-of-subset problem SOS c ={(w 1,...,w n ,z): \(\exists I\subseteq\{1,\ldots,n\}({\sum_{i\in I}w_i^{c}=z})\}\) where c≥ 1.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Babai, L.: Trading group theory for randomness. In: Proceedings of the seventeenth annual ACM symposium on Theory of computing, pp. 421–429. ACM Press, New York (1985)CrossRefGoogle Scholar
  2. 2.
    Babai, L., Luks, E., Seress, A.: Permutation groups in NC. In: Proceedings of the nineteenth annual ACM conference on Theory of computing, pp. 409–420. ACM Press, New York (1987)CrossRefGoogle Scholar
  3. 3.
    Babai, L., Szemerédi, E.: On the complexity of matrix group problems. In: 25th Annual Symposium on Foundations of Computer Science, pp. 229–240 (1984)Google Scholar
  4. 4.
    Barrington, D.M., Kadau, P., Lange, K., McKenzie, P.: On the complexity of some problems on groups input as multiplication tables. Journal of Computer and System Sciences 63 (2001)Google Scholar
  5. 5.
    Furst, M., Hopcroft, J., Luks, E.: Polynomial time algorithms for permutation groups. In: 21th Annual Symposium on Foundations of Computer Science, pp. 36–41 (1984)Google Scholar
  6. 6.
    Matiyasevich, Y.V.: Enumerable sets are diophantine. Doklady Akad. Nauk SSSR 191, 279–282 (1970), Translation in Soviet Math. Doklady 11, 354–357 (1970) Google Scholar
  7. 7.
    Sims, C.C.: Computational methods in the study of permutation groups. In: Leech, J. (ed.) mputational problems in abstract algebra, Proc. Conf. Oxford 1967, London, pp. 169–183. Pergamon, Oxford (1970)Google Scholar
  8. 8.
    van Emde Boas, P.: Complexity of linear problems, pp. 117–120 (1979)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Elmar Böhler
    • 1
  • Christian Glaßer
    • 1
  • Bernhard Schwarz
    • 1
  • Klaus Wagner
    • 1
  1. 1.Theoretische InformatikJulius–Maximilians Universität WürzburgWürzburgGermany

Personalised recommendations