Interactibility Proofs and the Computational Complexity of Binary Quadratics
L. Adleman and K. Manders
EECS Department, University of California, Berkeley
Technical Report No. UCB/ERL M78/30
, 1978
http://www2.eecs.berkeley.edu/Pubs/TechRpts/1978/ERL-m-78-30.pdf
BibTeX citation:
@techreport{Adleman:M78/30, Author= {Adleman, L. and Manders, K.}, Title= {Interactibility Proofs and the Computational Complexity of Binary Quadratics}, Year= {1978}, Month= {Jun}, Url= {http://www2.eecs.berkeley.edu/Pubs/TechRpts/1978/28932.html}, Number= {UCB/ERL M78/30}, }
EndNote citation:
%0 Report %A Adleman, L. %A Manders, K. %T Interactibility Proofs and the Computational Complexity of Binary Quadratics %I EECS Department, University of California, Berkeley %D 1978 %@ UCB/ERL M78/30 %U http://www2.eecs.berkeley.edu/Pubs/TechRpts/1978/28932.html %F Adleman:M78/30