Flow graph reducibility

Hecht, Matthew S.; Ullman, Jeffrey D.

doi:10.1145/800152.804919

Record: found
Abstract: not found
Conference Proceedings: not found

Flow graph reducibility

proceedings-article

Author(s): Matthew S. Hecht , Jeffrey D. Ullman

Publication date (Print): 1972

Conference name: the fourth annual ACM symposium (STOC '72)

Conference date: June 01, 1972 - June 03, 1972

Read this article at

ScienceOpenPublisher

Bookmark

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Author and article information

Conference

Publication date (Print): 1972

Pages: 238-250

Article

DOI: 10.1145/800152.804919

SO-VID: 0f411e25-593d-4b68-a029-e575676b9c40

Conference name: the fourth annual ACM symposium

Conference acronym: STOC '72

Conference number: 4

Conference location: Denver, Colorado, United States

Conference date: June 01, 1972 - June 03, 1972

Conference sponsor: SIGACT, ACM Special Interest Group on Algorithms and Computation Theory

History

Data availability:

Flow graph reducibility

Read this article at

Related collections

Exponential Random Graph Models

Author and article information

Conference

Article

History

Comments

Comment on this article

Similar content 3,846

Cited by 5