On the complexity of the parity argument and other inefficient proofs of existence
- 1 June 1994
- journal article
- Published by Elsevier BV in Journal of Computer and System Sciences
- Vol. 48 (3), 498-532
- https://doi.org/10.1016/s0022-0000(05)80063-7
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Exponential lower bounds for finding Brouwer fix pointsJournal of Complexity, 1989
- How easy is local search?Journal of Computer and System Sciences, 1988
- Variable Dimension Complexes Part I: Basic TheoryMathematics of Operations Research, 1984
- Regular subgraphs of almost regular graphsJournal of Combinatorial Theory, Series B, 1984
- A constructive proof of Tucker's combinatorial lemmaJournal of Combinatorial Theory, Series A, 1981
- Hamiltonian Cycles and Uniquely Edge Colourable GraphsPublished by Elsevier BV ,1978
- Orientation in Complementary Pivot AlgorithmsMathematics of Operations Research, 1976
- Complementary pivot theory of mathematical programmingLinear Algebra and its Applications, 1968
- The Jacobian matrix and global univalence of mappingsMathematische Annalen, 1965
- Existence of an Equilibrium for a Competitive EconomyEconometrica, 1954