On efficiently computing the product of two binary relations

DOI10.1080/00207167608803112zbMath0341.65030OpenAlexW1990886352MaRDI QIDQ4109192

Jan van Leeuwen

Publication date: 1976

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207167608803112

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Roundoff error (65G50) Direct numerical methods for linear systems and matrix inversion (65F05) Algorithms in computer science (68W99)

Cites Work

• Unnamed Item
• Unnamed Item
• Gaussian elimination is not optimal
• Efficient determination of the transitive closure of a directed graph
• A fast expected time algorithm for Boolean matrix multiplication and transitive closure

This page was built for publication: On efficiently computing the product of two binary relations