<?xml version="1.0"?>
<dblp>
<article key="journals/cc/AllenderBDGSS03" mdate="2005-01-25">
<author>Eric Allender</author>
<author>Anna Bernasconi</author>
<author>Carsten Damm</author>
<author>Joachim von zur Gathen</author>
<author>Michael E. Saks</author>
<author>Igor Shparlinski</author>
<title>Complexity of some arithmetic problems for binary polynomials.</title>
<pages>23-47</pages>
<year>2003</year>
<volume>12</volume>
<journal>Computational Complexity</journal>
<number>1-2</number>
<ee>http://dx.doi.org/10.1007/s00037-003-0176-9</ee>
<url>db/journals/cc/cc12.html#AllenderBDGSS03</url>
</article>
</dblp>
