Pages that link to "Item:Q808245"
From MaRDI portal
The following pages link to On total functions, existence theorems and computational complexity (Q808245):
Displaying 50 items.
- A Mihalisin-Klee theorem for fans (Q306503) (← links)
- Propositional proofs and reductions between NP search problems (Q435190) (← links)
- Recent development in computational complexity characterization of Nash equilibrium (Q458453) (← links)
- Nash equilibria: complexity, symmetries, and approximation (Q458482) (← links)
- Combinatorial nullstellensatz modulo prime powers and the parity argument (Q490257) (← links)
- Did the train reach its destination: the complexity of finding a witness (Q509884) (← links)
- Nested PLS (Q535153) (← links)
- Equilibria for games with combined qualitative and quantitative objectives (Q824280) (← links)
- The structure and complexity of Nash equilibria for a selfish routing game (Q838143) (← links)
- On the black-box complexity of Sperner's Lemma (Q839637) (← links)
- Time hierarchies for cryptographic function inversion with advice (Q843601) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- Simple search methods for finding a Nash equilibrium (Q932813) (← links)
- Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
- Eisenberg-Gale markets: algorithms and game-theoretic properties (Q993788) (← links)
- Good hidden \(P\)-matrix sandwiches (Q996290) (← links)
- A Sperner lemma complete for PPA (Q1603412) (← links)
- Efficient approximation algorithms for the subset-sums equality problem. (Q1608313) (← links)
- Reductions in \textbf{PPP} (Q1730025) (← links)
- Computational aspects of the colorful Carathéodory theorem (Q1991350) (← 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)
- 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)
- On the complexity of collision resistant hash functions: new and old black-box separations (Q2175920) (← links)
- Unique end of potential line (Q2194856) (← links)
- The Hairy Ball problem is PPAD-complete (Q2229948) (← links)
- Simple complexity from imitation games (Q2268119) (← links)
- Does the polynomial hierarchy collapse if onto functions are invertible? (Q2268347) (← links)
- Incremental delay enumeration: space and time (Q2274091) (← links)
- An oracle separating conjectures about incompleteness in the finite domain (Q2290649) (← links)
- An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups (Q2428678) (← links)
- Typical forcings, NP search problems and an extension of a theorem of Riis (Q2659102) (← links)
- The complexity of computational problems about Nash equilibria in symmetric win-lose games (Q2659767) (← links)
- Mean-payoff games with \(\omega\)-regular specifications (Q2669180) (← links)
- Total functions in QMA (Q2684235) (← links)
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium (Q2829231) (← links)
- A CSP-Based Approach for Solving Parity Game (Q3507327) (← links)
- Constant Rank Two-Player Games are PPAD-hard (Q4554071) (← links)
- Computational tameness of classical non-causal models (Q4556871) (← links)
- The Journey from NP to TFNP Hardness (Q4638115) (← links)
- The fibre of P-matrices: the recursive construction of all matrices with positive principal minors (Q4965585) (← links)
- (Q5005124) (← links)
- The Complexity of Public-Key Cryptography (Q5021130) (← links)
- Relativization of Gurevich’s Conjectures (Q5049042) (← links)
- Approximate counting and NP search problems (Q5055313) (← links)
- Adventures in monotone complexity and TFNP (Q5090415) (← links)
