Sturtivant, Carl
-
DAIMI Report Series Nr. 306 (1990): PB-306 Are There Elimination Algorithms for the Permanent? - Articles
Are There Elimination Algorithms for the Permanent?
Resumé PDF (English) -
DAIMI Report Series Nr. 227 (1987): PB-227 The Computational Efficacy of Finite Field Arithmetic - Articles
The Computational Efficacy of Finite Field Arithmetic
Resumé PDF (English) -
DAIMI Report Series Nr. 265 (1988): PB-265 A Note on the Complexity of the Transpose of a Matrix - Articles
A Note on the Complexity of the Transpose of a Matrix
Resumé PDF (English) -
DAIMI Report Series Nr. 241 (1988): PB-241 An Exact and Efficient Implementation of Threshold Gates with Arbitrary Real Weights - Articles
An Exact and Efficient Implementation of Threshold Gates with Arbitrary Real Weights
Resumé PDF (English) -
DAIMI Report Series Nr. 344 (1991): PB-344 What is an Efficient Implementation of the lambda-calculus? - Articles
What is an Efficient Implementation of the lambda-calculus?
Resumé PDF (English) -
DAIMI Report Series Nr. 240 (1988): PB-240 The Depth Efficacy of Unbounded Characteristic Finite Field Arithmetic - Articles
The Depth Efficacy of Unbounded: Characteristic Finite Field Arithmetic
Resumé PDF (English) -
DAIMI Report Series Nr. 239 (1988): PB-239 An Algebraic Model for Bounding Threshold Circuit Depth - Articles
An Algebraic Model for Bounding Threshold Circuit Depth
Resumé PDF (English)