Skip to main content
SpringerLink
Log in
Book cover

International Conference on Fundamentals of Computation Theory

FCT 1977: Fundamentals of Computation Theory pp 452–458Cite as

Two NP-complete problems related to information retrieval

  • Section C Computability, Decidability & Arithmetic Complexity
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 56))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. 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. 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. Codd, E. F., A relational model of data for large shared data banks. Comm. ACM 13 (1970) 377–387.

    Google Scholar 

  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. Fagin, R., Dependency in a relational database and propositional logic. IBM Research Rep. RJ 1776, San Jose, California, 1976.

    Google Scholar 

  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. Ghosh, S. P., File organization: the consecutive retrieval property. Comm. ACM 15 (1972) 802–808.

    Google Scholar 

  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. 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. 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. Lipski, W., Information storage and retrieval — mathematical foundations II (Combinatorial problems). Theoretical Computer Science 3 (1976) 183–211.

    Google Scholar 

  13. Lipski, W., Three-queries file organizations. Fundamenta Informaticae 1 (1977) 51–60.

    Google Scholar 

  14. Stockmeyer, L., Planar 3-colorability is polynomial complete. SIGACT News, No. 3 (1973) 19–25.

    Google Scholar 

  15. Traczyk, T., Jr., On consecutive retrieval from drum-type storage. ICS PAS Report 285, Warsaw, 1977.

    Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Polish Academy of Sciences, P. O. Box 22, 00-901, Warsaw PKiN

    Witold Lipski Jr.

Authors
  1. Witold Lipski Jr.
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marek Karpiński

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lipski, W. (1977). Two NP-complete problems related to information retrieval. In: Karpiński, M. (eds) Fundamentals of Computation Theory. FCT 1977. Lecture Notes in Computer Science, vol 56. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08442-8_115

Download citation

  • DOI: https://doi.org/10.1007/3-540-08442-8_115

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08442-6

  • Online ISBN: 978-3-540-37084-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation