Two NP-complete problems related to information retrieval

  • Witold LipskiJr.
Section C Computability, Decidability & Arithmetic Complexity
Part of the Lecture Notes in Computer Science book series (LNCS, volume 56)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aho, A. V., Hopcroft, J. E. and Ullman, J. D., The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.Google Scholar
  2. 2.
    Booth, K. S. and Lueker, G. S., Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-trees. J. Computer System. Sci. 13 (1976) 335–379.Google Scholar
  3. 3.
    Cadiou, J.-M., On semantic issues in the relational model of data. Proc. 5th Symp. on Mathematical Foundations of Computer Science, Gdańsk, Sept. 6–10, 1976 (A. Mazurkiewicz, Ed.), pp. 23–38, Lecture Notes in Computer Science 45, Springer-Verlag, Berlin — Heidelberg — New York, 1976.Google Scholar
  4. 4.
    Codd, E. F., A relational model of data for large shared data banks. Comm. ACM 13 (1970) 377–387.Google Scholar
  5. 5.
    Cook, S. A., The complexity of theorem-proving procedures. Proc. 3rd Annual ACM Symp. on theory of Computing, Shaker Heights, Ohio, 1971, pp. 151–159.Google Scholar
  6. 6.
    Fagin, R., Dependency in a relational database and propositional logic. IBM Research Rep. RJ 1776, San Jose, California, 1976.Google Scholar
  7. 7.
    Garey, M. R., Johnson, D. S. and Stockmeyer, L., Some simplified NP-complete graph problems, Theoretical Computer Science 1 (1976) 237–267.Google Scholar
  8. 8.
    Ghosh, S. P., File organization: the consecutive retrieval property. Comm. ACM 15 (1972) 802–808.Google Scholar
  9. 9.
    Ghosh, S. P., File organization: consecutive storage of relevant records on drum-type storage. Information and Control 25 (1974) 145–165.Google Scholar
  10. 10.
    Karp, R. M., Reducibility among combinatorial problems. In: Complexity of Computer Computations (R. E. Miller and J. W. Thatcher, Eds), pp. 85–104, Plenum Press, New York, 1972.Google Scholar
  11. 11.
    Kou, L. T., Polynomial complete consecutive information retrieval problems. Techn. Rep. TR 74-193, Dept. of Computer Science, Cornell University, Ithaca, N. Y., 1974. To appear in SIAM J. Computing.Google Scholar
  12. 12.
    Lipski, W., Information storage and retrieval — mathematical foundations II (Combinatorial problems). Theoretical Computer Science 3 (1976) 183–211.Google Scholar
  13. 13.
    Lipski, W., Three-queries file organizations. Fundamenta Informaticae 1 (1977) 51–60.Google Scholar
  14. 14.
    Stockmeyer, L., Planar 3-colorability is polynomial complete. SIGACT News, No. 3 (1973) 19–25.Google Scholar
  15. 15.
    Traczyk, T., Jr., On consecutive retrieval from drum-type storage. ICS PAS Report 285, Warsaw, 1977.Google Scholar
  16. 16.
    Yu, C. T. and Johnson, D. T., On the complexity of finding the set of candidate keys for a given set of functional dependencies. Information Processing Lett. 5 (1976) 100–101.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Witold LipskiJr.
    • 1
  1. 1.Institute of Computer SciencePolish Academy of SciencesWarsaw PKiN

Personalised recommendations