Author of the publication

The Binary Network Flow Problem is Logspace Complete for P.

, and . Theor. Comput. Sci., 75 (3): 357-363 (1990)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers., and . Computational Complexity, 16 (3): 211-244 (2007)Editorial., and . Theory Comput. Syst., 49 (2): 225-226 (2011)The Correlation between the Complexities of the Nonhierarchical and Hierarchical Versions of Graph Problems., and . J. Comput. Syst. Sci., 44 (1): 63-93 (1992)The Complexity of Finding Middle Elements., and . Int. J. Found. Comput. Sci., 4 (4): 293-307 (1993)Monotonic Coverings of Finite Sets.. Elektronische Informationsverarbeitung und Kybernetik, 20 (12): 633-639 (1984)Akzeptierbarkeitsgrade regulärer Folgemengen.. Elektronische Informationsverarbeitung und Kybernetik, 11 (10-12): 626-630 (1975)Eine Bemerkung zu einer Arbeit von Monien über Kopfzahl-Hierarchien für Zweiweg-Automaten., and . Elektronische Informationsverarbeitung und Kybernetik, 18 (1/2): 69-74 (1982)On boolean lowness and boolean highness., and . Theor. Comput. Sci., 261 (2): 305-321 (2001)Generation problems., , , and . Theor. Comput. Sci., 345 (2-3): 260-295 (2005)Counting Hierarchies: Polynomial Time and Constant Depth Circuits., and . Current Trends in Theoretical Computer Science, volume 40 of World Scientific Series in Computer Science, World Scientific, (1993)