Now showing items 17-36 of 37

• #### A Note on Cryptography and NP$\cap$ CoNP-P ﻿

(Cornell University, 1978-04)
Diffie and Hellman [2] propose the use of the exponential function in a finite field for cryptographic purposes. The proposal is based on the conjecture that the inverse function, the logarithm, is not feasibly computable. ...
• #### A Note on Rabin's Nearest-Neighbor Algorithm ﻿

(Cornell University, 1978-04)
Rabin has proposed a probabilistic algorithm for finding the closest pair of a set of points in Euclidean space. His algorithm is asymtomatically linear whereas the best of the known deterministic algorithms take order ...
• #### 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