BibTeX record conf/dagstuhl/ArpeM06

download as .bib file

@inproceedings{DBLP:conf/dagstuhl/ArpeM06,
  author    = {Jan Arpe and
               Bodo Manthey},
  title     = {Approximability of Minimum AND-Circuits},
  booktitle = {Complexity of Boolean Functions, 12.03. - 17.03.2006},
  year      = {2006},
  crossref  = {DBLP:conf/dagstuhl/2006P6111},
  url       = {http://drops.dagstuhl.de/opus/volltexte/2006/603},
  timestamp = {Fri, 10 Apr 2015 16:51:58 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/dagstuhl/ArpeM06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2006P6111,
  editor    = {Matthias Krause and
               Pavel Pudl{\'{a}}k and
               R{\"{u}}diger Reischuk and
               Dieter van Melkebeek},
  title     = {Complexity of Boolean Functions, 12.03. - 17.03.2006},
  series    = {Dagstuhl Seminar Proceedings},
  volume    = {06111},
  publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
               (IBFI), Schloss Dagstuhl, Germany},
  year      = {2006},
  url       = {http://drops.dagstuhl.de/portals/06111/},
  timestamp = {Sun, 22 Dec 2013 14:10:20 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/dagstuhl/2006P6111},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}