Search dblp for Publications

export results for "Relational Queries Computable in Polynomial Time"

> Home > Search

download as .bib file

@article{DBLP:journals/iandc/Immerman86,
  author       = {Neil Immerman},
  title        = {Relational Queries Computable in Polynomial Time},
  journal      = {Inf. Control.},
  volume       = {68},
  number       = {1-3},
  pages        = {86--104},
  year         = {1986},
  url          = {https://doi.org/10.1016/S0019-9958(86)80029-8},
  doi          = {10.1016/S0019-9958(86)80029-8},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/Immerman86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stoc/Immerman82,
  author       = {Neil Immerman},
  editor       = {Harry R. Lewis and
                  Barbara B. Simons and
                  Walter A. Burkhard and
                  Lawrence H. Landweber},
  title        = {Relational Queries Computable in Polynomial Time (Extended Abstract)},
  booktitle    = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
                  May 5-7, 1982, San Francisco, California, {USA}},
  pages        = {147--152},
  publisher    = {{ACM}},
  year         = {1982},
  url          = {https://doi.org/10.1145/800070.802187},
  doi          = {10.1145/800070.802187},
  timestamp    = {Wed, 14 Nov 2018 10:51:38 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/Immerman82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

a service of

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.