Equivalence in the complexity of several problems

DOI10.1007/BF01068564zbMath0586.68041OpenAlexW2009131784MaRDI QIDQ3711747

Evgeniĭ Alekseevich Ivanov

Publication date: 1983

Published in: Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01068564

zbMATH Keywords

parallel algorithmstime complexitycomplex data structuresminimization of finite automata

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Connectivity (05C40) Theory of operating systems (68N25)

Cites Work

• Parallel Matrix and Graph Algorithms
• Fast, Efficient Parallel Algorithms for Some Graph Problems
• Macroconveyor computations of functions on data structures
• Cellular arrays for the solution of graph problems

This page was built for publication: Equivalence in the complexity of several problems