%0 Conference Paper %1 conf/isaac/Buchfuhrer08 %A Buchfuhrer, David %B ISAAC %D 2008 %E Hong, Seok-Hee %E Nagamochi, Hiroshi %E Fukunaga, Takuro %I Springer %K dblp %P 580-591 %T The Complexity of SPP Formula Minimization. %U http://dblp.uni-trier.de/db/conf/isaac/isaac2008.html#Buchfuhrer08 %V 5369 %@ 978-3-540-92181-3

@inproceedings{conf/isaac/Buchfuhrer08, added-at = {2017-05-19T00:00:00.000+0200}, author = {Buchfuhrer, David}, biburl = {https://www.bibsonomy.org/bibtex/26db4798fc6963338578a4c536b4ed08d/dblp}, booktitle = {ISAAC}, crossref = {conf/isaac/2008}, editor = {Hong, Seok-Hee and Nagamochi, Hiroshi and Fukunaga, Takuro}, ee = {https://doi.org/10.1007/978-3-540-92182-0_52}, interhash = {d90d31155247c20d10d7987b451ae326}, intrahash = {6db4798fc6963338578a4c536b4ed08d}, isbn = {978-3-540-92181-3}, keywords = {dblp}, pages = {580-591}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2024-04-09T09:48:09.000+0200}, title = {The Complexity of SPP Formula Minimization.}, url = {http://dblp.uni-trier.de/db/conf/isaac/isaac2008.html#Buchfuhrer08}, volume = 5369, year = 2008 }