A very personal reminiscence on the problem of computational complexity

DOI10.1016/0166-218X(87)90004-7zbMath0623.68045OpenAlexW2006841171MaRDI QIDQ1091818

Masao Iri

Publication date: 1987

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(87)90004-7

zbMATH Keywords

Japancomputational complexitynetwork algorithmsmatrix multiplicationcutset matrices

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) History of mathematics in the 20th century (01A60) History of computer science (68-03) History of Japanese mathematics (01A27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Base tensorielle des matrices de Hankel (ou de Toeplitz). Applications
• Network flow, transportation and scheduling. Theory and algorithms
• Gaussian elimination is not optimal
• Graphs and Vector Spaces
• An Algorithm for Determining Whether a Given Binary Matroid is Graphic
• Synthesis of Switching Functions by Linear Graph Theory
• Efficient Planarity Testing
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Finding All Shortest Distances in a Directed Network
• From Matrices to Graphs
• A New Algorithm for Inner Product
• On the number of multiplications necessary to compute certain functions
• Shortcut in the Decomposition Algorithm for Shortest Paths in a Network
• Technical Note—On Hu's Decomposition Algorithm for Shortest Paths in a Network
• On some techniques useful for solution of transportation network problems

This page was built for publication: A very personal reminiscence on the problem of computational complexity