<?xml version="1.0"?>
<dblp>
<article key="journals/eccc/Bollig08" mdate="2009-02-13">
<author>Beate Bollig</author>
<title>On the OBDD complexity of the most significant bit of integer multiplication.</title>
<year>2008</year>
<volume>15</volume>
<journal>Electronic Colloquium on Computational Complexity (ECCC)</journal>
<ee>http://eccc.hpi-web.de/eccc-reports/2008/TR08-056/index.html</ee>
<number>056</number>
<url>db/journals/eccc/eccc15.html#Bollig08</url>
</article>
</dblp>
