%0 Report %1 TR196 %A Reith, Steffen %A Vollmer, Heribert %C Department of Computer Science %D 1998 %K myown %N 196 %T The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae. %U http://www1.pub.informatik.uni-wuerzburg.de/pub/TRs/re-vo98.ps.gz

@techreport{TR196, added-at = {2015-06-18T10:00:28.000+0200}, address = {Department of Computer Science}, author = {Reith, Steffen and Vollmer, Heribert}, biburl = {https://www.bibsonomy.org/bibtex/2e953858506851d80ddb1848a4189b077/trcsuniwue}, interhash = {2d5e521ed92e6184c4e9a9f2166e629e}, intrahash = {e953858506851d80ddb1848a4189b077}, keywords = {myown}, month = {March}, number = 196, timestamp = {2015-06-18T10:00:28.000+0200}, title = {The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae.}, type = {Technical Report}, url = {http://www1.pub.informatik.uni-wuerzburg.de/pub/TRs/re-vo98.ps.gz}, year = 1998 }