Back to search

On the complexity of the parity argument and other inefficient proofs of existence

Data up to Jan 2025

Published1994
Citations809
References29

Total Citations Per Year

Abstract

References (29)

Existence of an Equilibrium for a Competitive Economy

1954 • 3,629 citations

Existence of an equilibrium for a competitive economy

2008 • 3,100 citations

Combinatorial Problems and Exercises

1993 • 1,436 citations

Equilibrium Points of Bimatrix Games

1964 • 1,252 citations

Bimatrix Equilibrium Points and Mathematical Programming

1965 • 1,020 citations

Complementary pivot theory of mathematical programming

1968 • 741 citations

How easy is local search?

1988 • 711 citations

The Jacobian matrix and global univalence of mappings

1965 • 663 citations

Combinatorial Problems and Exercises

2007 • 580 citations

Ten lectures on the probabilistic method

1987 • 391 citations

Every Prime Has a Succinct Certificate

1975 • 317 citations

On total functions, existence theorems and computational complexity

1991 • 306 citations

Applied General Equilibrium Analysis.

1986 • 271 citations

The Relative Complexity of NP Search Problems

1998 • 181 citations

Hamiltonian Cycles and Uniquely Edge Colourable Graphs

1978 • 154 citations

Exponential lower bounds for finding Brouwer fix points

1989 • 147 citations

On the complexity of local search

1990 • 111 citations

Equilibrium Points in Bimatrix Games

1958 • 102 citations

Regular subgraphs of almost regular graphs

1984 • 98 citations

The adjacency relation on the traveling salesman polytope is NP-Complete

1978 • 97 citations

WALRAS' EXISTENCE THEOREM AND BROUWER'S FIXED-POINT THEOREM

1962 • 91 citations

On relativization and the existence of complete sets

1982 • 74 citations

Structure in locally optimal solutions

1989 • 71 citations

Orientation in Complementary Pivot Algorithms

1976 • 68 citations

A constructive proof of Tucker's combinatorial lemma

1981 • 63 citations

On graph-theoretic lemmata and complexity classes

2002 • 39 citations

The relative complexity of NP search problems

1995 • 31 citations

Variable Dimension Complexes Part I: Basic Theory

1984 • 16 citations

A parallel algorithmic version of the local lemma

2002 • 16 citations

Cited By (0)

Loading...