Abstract

A general theorem is proved which can be used to show that for a large number of matroid properties there is no good algorithm of a certain type for determining whether these properties hold for general matroids. Specifically, there exists no algorithm in which the matroid is represented by an independence test oracle (or an oracle polynomially related to an independence test oracle) and which solves the problem in question after a number of calls on the oracle which is bounded by a polynomial in the number of elements of the ground set of the matroid.

Keywords

  1. Computational complexity
  2. lower bounds
  3. oracle algorithms
  4. matroid properties

Get full access to this article

View all available purchase options and get full access to this article.

References

1.
Elwyn R. Berlekamp, Robert J. McEliece, Henk C. A. van Tilborg, On the inherent intractability of certain coding problems, IEEE Trans. Information Theory, IT-24 (1978), 384–386
2.
Robert E. Bixby, William H. Cunningham, J. A. Bondy, U. S. R. Murty, Matroids, graphs, and 3-connectivityGraph theory and related topics (Proc. Conf., Univ. Waterloo, Waterloo, Ont., 1977), Academic Press, New York, 1979, 91–103
3.
Robert G. Bland, Michel Las Vergnas, Orientability of matroids, J. Combinatorial Theory Ser. B., 24 (1978), 94–123
4.
W. H. Cunningham, J. Edmonds, Decomposition of linear systems, to appear
5.
Jack Edmonds, Minimum partition of a matroid into independent subsets, J. Res. Nat. Bur. Standards Sect. B, 69B (1965), 67–72
6.
F. R. Giles, private communication
7.
Dirk Hausmann, Bernhard Korte, Lower bounds on the worst-case complexity of some oracle algorithms, Discrete Math., 24 (1978), 261–276
8.
D. Hausmann, B. Korte, R. Henn, B. Korte, W. Oettli, Oracle algorithms for fixed-point problems—an axiomatic approachOptimization and operations research (Proc. Workshop, Univ. Bonn, Bonn, 1977), Lecture Notes in Econom. and Math. Systems, Vol. 157, Springer, Berlin, 1978, 137–156, Proc. Workshop in Bad Honnef, Heidelberg-New York
9.
D. Hausmann, B. Korte, J. Stoer, Worst-case analysis for a class of combinatorial optimization algorithms, Proc. 8th IFIP Conference on Optimization Techniques, Würzburg, 1977, Optimization Techniques, Part 2, Springer-Verlag, Berlin-Heidelberg-New York, 1978, 216–224
10.
D. Hausmann, B. Korte, Algorithmic versus axiomatic definitions of matroids, Math. Programming Stud., (1981), 98–111
11.
L. Lovász, L. Lovasz, V. T. Sos, The matroid matching problemAlgebraic methods in graph theory, Vol. I, II (Szeged, 1978), Colloq. Math. Soc. János Bolyai, Vol. 25, North-Holland, Amsterdam, 1981, 495–517
12.
L. Lovász, Matroid matching and some applications, J. Combin. Theory Ser. B, 28 (1980), 208–236
13.
G. C. Robinson, D. J. A. Welsh, The computational complexity of matroid properties, Math. Proc. Cambridge Philos. Soc., 87 (1980), 29–45
14.
P. D. Seymour, Recognizing graphic matroids, Combinatorica, 1 (1981), 75–78
15.
D. J. A. Welsh, Matroid theory, Academic Press [Harcourt Brace Jovanovich Publishers], London, 1976xi+433, New York-San Francisco

Information & Authors

Information

Published In

cover image SIAM Journal on Computing
SIAM Journal on Computing
Pages: 184 - 190
ISSN (online): 1095-7111

History

Submitted: 4 December 1979
Accepted: 8 April 1981
Published online: 31 July 2006

Keywords

  1. Computational complexity
  2. lower bounds
  3. oracle algorithms
  4. matroid properties

Authors

Affiliations

Metrics & Citations

Metrics

Citations

If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

Cited By

Media

Figures

Other

Tables

Share

Share

Copy the content Link

Share with email

Email a colleague

Share on social media

The SIAM Publications Library now uses SIAM Single Sign-On for individuals. If you do not have existing SIAM credentials, create your SIAM account https://my.siam.org.