English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Journal Article

The Binary Network Flow Problem is Logspace Complete for P

MPS-Authors
There are no MPG-Authors in the publication available
External Resource

https://www.sciencedirect.com/science/article/pii/030439759090101M?via%3Dihub
(Publisher version)

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Lengauer, T., & Wagner, K. W. (1990). The Binary Network Flow Problem is Logspace Complete for P. Theoretical computer science, 75(3), 357-363. doi:10.1016/0304-3975(90)90101-M.


Cite as: https://hdl.handle.net/21.11116/0000-000F-9029-0
Abstract
There is no abstract available