A very personal reminiscence on the problem of computational complexity
type: Item
instance of: scholarly article
title: A very personal reminiscence on the problem of computational complexity
zbMATH Open document ID: 0623.68045
DOI: 10.1016/0166-218X(87)90004-7
author: Masao Iri
published in: Discrete Applied Mathematics
publication date: 1987-01-01T00:00:00Z
review text: By the author's personal reminiscence, the increasing interest is verified in research topics of computational complexity in Japan covering the time since the early 60's. This is exemplified by brief remarks on activities in the areas of synthesis of cutset matrices, matrix multiplication and inversion, and network problems.
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68-03
Mathematics Subject Classification ID: 01A27
Mathematics Subject Classification ID: 01A60
zbMATH DE Number: 4011936
zbMATH Keywords: network algorithms
zbMATH Keywords: computational complexity
zbMATH Keywords: Japan
zbMATH Keywords: cutset matrices
zbMATH Keywords: matrix multiplication
MaRDI profile type: Publication
cites work: Q4773298
cites work: Q5560921
cites work: Q3266932
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: Graphs and Vector Spaces
cites work: Finding All Shortest Distances in a Directed Network
cites work: Efficient Planarity Testing
cites work: Shortcut in the Decomposition Algorithm for Shortest Paths in a Network
cites work: Q5610100
cites work: Network flow, transportation and scheduling. Theory and algorithms
cites work: Q5656786
cites work: Q5592616
cites work: Base tensorielle des matrices de Hankel (ou de Toeplitz). Applications
cites work: Q5596083
cites work: Q3847747
cites work: Synthesis of Switching Functions by Linear Graph Theory
cites work: Q5668632
cites work: Q5560620
cites work: Gaussian elimination is not optimal
cites work: Q4047029
cites work: On some techniques useful for solution of transportation network problems
cites work: An Algorithm for Determining Whether a Given Binary Matroid is Graphic
cites work: From Matrices to Graphs
cites work: A New Algorithm for Inner Product
cites work: On the number of multiplications necessary to compute certain functions
cites work: Technical Note—On Hu's Decomposition Algorithm for Shortest Paths in a Network
full work available at URL: 0166-218x(87)90004-7
OpenAlex ID: W2006841171
description: scientific article; zbMATH DE number 4011936