BibTeX record conf/socs/BackstromJ11

• > Home > conf/socs/BackstromJ11

@inproceedings{DBLP:conf/socs/BackstromJ11,
  author       = {Christer B{\"{a}}ckstr{\"{o}}m and
                  Peter Jonsson},
  editor       = {Daniel Borrajo and
                  Maxim Likhachev and
                  Carlos Linares L{\'{o}}pez},
  title        = {All PSPACE-Complete Planning Problems Are Equal but Some Are More
                  Equal than Others},
  booktitle    = {Proceedings of the Fourth Annual Symposium on Combinatorial Search,
                  {SOCS} 2011, Castell de Cardona, Barcelona, Spain, July 15.16, 2011},
  pages        = {10--17},
  publisher    = {{AAAI} Press},
  year         = {2011},
  url          = {https://doi.org/10.1609/socs.v2i1.18186},
  doi          = {10.1609/SOCS.V2I1.18186},
  timestamp    = {Mon, 18 Dec 2023 16:58:34 +0100},
  biburl       = {https://dblp.org/rec/conf/socs/BackstromJ11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}