Bitte melden Sie sich an um selbst Rezensionen oder Kommentare zu erstellen.
Zitieren Sie diese Publikation
Mehr Zitationsstile
- bitte auswählen -
%0 Conference Paper
%1 conf/iwpec/CrowstonGJY10
%A Crowston, Robert
%A Gutin, Gregory Z.
%A Jones, Mark
%A Yeo, Anders
%B IPEC
%D 2010
%E Raman, Venkatesh
%E Saurabh, Saket
%I Springer
%K dblp
%P 84-94
%T A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application.
%U http://dblp.uni-trier.de/db/conf/iwpec/ipec2010.html#CrowstonGJY10
%V 6478
%@ 978-3-642-17492-6
@inproceedings{conf/iwpec/CrowstonGJY10,
added-at = {2020-03-05T00:00:00.000+0100},
author = {Crowston, Robert and Gutin, Gregory Z. and Jones, Mark and Yeo, Anders},
biburl = {https://www.bibsonomy.org/bibtex/22e2babb5a2dd4b2038faf94892658e83/dblp},
booktitle = {IPEC},
crossref = {conf/iwpec/2010},
editor = {Raman, Venkatesh and Saurabh, Saket},
ee = {https://doi.org/10.1007/978-3-642-17493-3_10},
interhash = {945f1568c7996eb831e4261c966f906c},
intrahash = {2e2babb5a2dd4b2038faf94892658e83},
isbn = {978-3-642-17492-6},
keywords = {dblp},
pages = {84-94},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2020-03-06T11:44:57.000+0100},
title = {A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application.},
url = {http://dblp.uni-trier.de/db/conf/iwpec/ipec2010.html#CrowstonGJY10},
volume = 6478,
year = 2010
}