BibTeX record conf/icalp/GoldbergJ12

• > Home > conf/icalp/GoldbergJ12

@inproceedings{DBLP:conf/icalp/GoldbergJ12,
  author       = {Leslie Ann Goldberg and
                  Mark Jerrum},
  editor       = {Artur Czumaj and
                  Kurt Mehlhorn and
                  Andrew M. Pitts and
                  Roger Wattenhofer},
  title        = {The Complexity of Computing the Sign of the Tutte Polynomial (and
                  Consequent {\#}P-hardness of Approximation)},
  booktitle    = {Automata, Languages, and Programming - 39th International Colloquium,
                  {ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {7391},
  pages        = {399--410},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-31594-7\_34},
  doi          = {10.1007/978-3-642-31594-7\_34},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/GoldbergJ12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}