Pages that link to "Item:Q1329155"
From MaRDI portal
The following pages link to On the complexity of the parity argument and other inefficient proofs of existence (Q1329155):
Displaying 50 items.
- A smooth path-following algorithm for market equilibrium under a class of piecewise-smooth concave utilities (Q1616935) (← links)
- On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering (Q1637226) (← links)
- Short proofs of the Kneser-Lovász coloring principle (Q1641004) (← links)
- Complexity of rational and irrational Nash equilibria (Q1678771) (← links)
- Colorful linear programming, Nash equilibrium, and pivots (Q1707915) (← links)
- Long cycles in Hamiltonian graphs (Q1717607) (← links)
- Reductions in \textbf{PPP} (Q1730025) (← links)
- Computing solutions of the multiclass network equilibrium problem with affine cost functions (Q1730728) (← links)
- Towards a unified complexity theory of total functions (Q1745728) (← links)
- Smooth calibration, leaky forecasts, finite recall, and Nash dynamics (Q1753290) (← links)
- Computing solutions of the paintshop-necklace problem (Q1761213) (← links)
- No bullying! A playful proof of Brouwer's fixed-point theorem (Q1800960) (← links)
- On the complexity of price equilibria (Q1886458) (← links)
- Cutting planes, connectivity, and threshold logic (Q1908818) (← links)
- Equipartition of mass distributions by hyperplanes (Q1911766) (← links)
- A polynomial-time algorithm for the tridiagonal and Hessenberg P-matrix linear complementarity problem (Q1939694) (← links)
- The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game (Q1995464) (← links)
- 2-D Tucker is PPA complete (Q2009648) (← links)
- On the complexity of finding a Caristi's fixed point (Q2032159) (← links)
- The complexity of the parity argument with potential (Q2037189) (← links)
- Continuous verifiable delay functions (Q2055650) (← links)
- A PPA parity theorem about trees in a bipartite graph (Q2064287) (← links)
- The complexity of finding fair independent sets in cycles (Q2087771) (← links)
- Two's company, three's a crowd: consensus-halving for a constant number of agents (Q2093385) (← links)
- Discrete versions of the KKM lemma and their PPAD-completeness (Q2097223) (← links)
- Characterising the intersection of QMA and coQMA (Q2099640) (← links)
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs (Q2104234) (← links)
- Delegation with updatable unambiguous proofs and PPAD-hardness (Q2104236) (← links)
- Faster algorithms for \(k\)-subset sum and variations (Q2105266) (← links)
- Computational complexity of computing a quasi-proper equilibrium (Q2140505) (← links)
- Automatic verification of concurrent stochastic systems (Q2147696) (← links)
- Equilibrium computation in resource allocation games (Q2149542) (← links)
- Computing equilibria for integer programming games (Q2160491) (← links)
- On the complexity of stable hypergraph matching, stable multicommodity flow and related problems (Q2167893) (← links)
- Approximation schemes for subset-sums ratio problems (Q2167894) (← links)
- Approximating subset sum ratio via subset sum computations (Q2169941) (← links)
- From minicrypt to obfustopia via private-key functional encryption (Q2175213) (← links)
- Unique end of potential line (Q2194856) (← links)
- Understanding PPA-completeness (Q2208253) (← links)
- Computing exact solutions of consensus halving and the Borsuk-Ulam theorem (Q2221804) (← links)
- The Hairy Ball problem is PPAD-complete (Q2229948) (← links)
- Arc-routing for winter road maintenance (Q2234739) (← links)
- A parity theorem about trees with specified degrees (Q2235250) (← links)
- Simple complexity from imitation games (Q2268119) (← links)
- Cache me if you can: capacitated selfish replication games in networks (Q2300628) (← links)
- Deciding probabilistic bisimilarity distance one for probabilistic automata (Q2306848) (← links)
- Oriented Euler complexes and signed perfect matchings (Q2340282) (← links)
- Quasipolynomial size proofs of the propositional pigeonhole principle (Q2344736) (← links)
- Pivoting in linear complementarity: Two polynomial-time cases (Q2391195) (← links)
- Polynomial-size Frege and resolution proofs of \(st\)-connectivity and Hex tautologies (Q2500481) (← links)
