zbMATH — the first resource for mathematics

Graph-theoretic properties in computational complexity. (English) Zbl 0354.68071

68Q25 Analysis of algorithms and problem complexity
68N01 General topics in the theory of software
PDF BibTeX Cite
Full Text: DOI
[1] Aho, A.V.; Hopcroft, J.E.; Ullman, J.D., ()
[2] Berge, C., ()
[3] Borodin, A.; Munro, I., ()
[4] Pinsker, M.S., On the complexity of a concentrator, () · Zbl 0078.32402
[5] Pippenger, N.J., Super concentrators, ()
[6] Strassen, V., Vermeidung von divisionen, J. für die reine und angewandte Mathematik, 264, 184-202, (1973) · Zbl 0294.65021
[7] {\scV. Strassen}, Private communication, 1975.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.