Skip to main content

Random matroids

Publication ,  Journal Article
Reif, JH; Spirakis, PG
Published in: Proceedings of the Annual ACM Symposium on Theory of Computing
April 28, 1980

We introduce a new random structure generalizing matroids. These random matroids allow us to develop general techniques for solving hard combinatorial optimization problems with random inputs.

Duke Scholars

Published In

Proceedings of the Annual ACM Symposium on Theory of Computing

DOI

ISSN

0737-8017

Publication Date

April 28, 1980

Volume

1980-April

Start / End Page

385 / 397
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Reif, J. H., & Spirakis, P. G. (1980). Random matroids. Proceedings of the Annual ACM Symposium on Theory of Computing, 1980-April, 385–397. https://doi.org/10.1145/800141.804688
Reif, J. H., and P. G. Spirakis. “Random matroids.” Proceedings of the Annual ACM Symposium on Theory of Computing 1980-April (April 28, 1980): 385–97. https://doi.org/10.1145/800141.804688.
Reif JH, Spirakis PG. Random matroids. Proceedings of the Annual ACM Symposium on Theory of Computing. 1980 Apr 28;1980-April:385–97.
Reif, J. H., and P. G. Spirakis. “Random matroids.” Proceedings of the Annual ACM Symposium on Theory of Computing, vol. 1980-April, Apr. 1980, pp. 385–97. Scopus, doi:10.1145/800141.804688.
Reif JH, Spirakis PG. Random matroids. Proceedings of the Annual ACM Symposium on Theory of Computing. 1980 Apr 28;1980-April:385–397.

Published In

Proceedings of the Annual ACM Symposium on Theory of Computing

DOI

ISSN

0737-8017

Publication Date

April 28, 1980

Volume

1980-April

Start / End Page

385 / 397