BibTeX record journals/acta/KapurNRZ91

download as .bib file

@article{DBLP:journals/acta/KapurNRZ91,
  author       = {Deepak Kapur and
                  Paliath Narendran and
                  Daniel J. Rosenkrantz and
                  Hantao Zhang},
  title        = {Sufficient-Completeness, Ground-Reducibility and their Complexity},
  journal      = {Acta Informatica},
  volume       = {28},
  number       = {4},
  pages        = {311--350},
  year         = {1991},
  url          = {https://doi.org/10.1007/BF01893885},
  doi          = {10.1007/BF01893885},
  timestamp    = {Tue, 17 Jan 2023 12:12:51 +0100},
  biburl       = {https://dblp.org/rec/journals/acta/KapurNRZ91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.