Now showing items 19-37 of 37

• #### On Edge Coloring Bipartite Graphs ﻿

(Cornell University, 1980-11)
NO ABSTRACT SUPPLIED
• #### On Minimizing the Number of Multiplications Necessary for Matrix Multiplication ﻿

(Cornell University, 1969-09)
This paper develops an algorithm to multiply a px2 matrix by a 2xn matrix in $\lceil (3pn+max(n,p))/2 \rceil$ multiplications for matrix multiplication without commutativity. The algorithm minimizes the number of multiplications ...
• #### On Planar Point Matching Under Affine Transformation ﻿

(Cornell University, 1989-04)
• #### On the Equivalence and Containment Problems for Context-Free Languages ﻿

(Cornell University, 1968-06)
• #### Robust Set Operations on Polyhedral Solids ﻿

(Cornell University, 1987-10)
We describe an algorithm for performing regularized set operations on polyhedral solids. Robustness of this algorithm is achieved by adding symbolic reasoning as a supplemental step that compensates for possible numerical ...
• #### Routing in Networks ﻿

(Cornell University, 1981-11)
NO ABSTRACT SUPPLIED
• #### A Subexponential Algorithm for Trivalent Graph Isomorphism ﻿

(Cornell University, 1980-06)
NO ABSTRACT SUPPLIED
• #### Triangular Factorization and Inversion by Fast Matrix Multiplication ﻿

(Cornell University, 1972-12)
The fast matrix multiplication algorithm by Strassen is used to obtain the triangular factorization of a permutation of any non-singular matrix of order n in "greater than" C sub{1}n sup{log sub{2}7} operations, and hence ...