TFNP: An Update (Q5283350): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-57586-5_1
+Normal rank
@@ Property / OpenAlex ID @@
+W2607335953
@@ Property / OpenAlex ID: W2607335953 / rank @@
+Normal rank
@@ Property / cites work @@
+PRIMES is in P
@@ Property / cites work: PRIMES is in P / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234077
@@ Property / cites work: Q4234077 / rank @@
+Normal rank
@@ Property / cites work @@
+The NP Search Problems of Frege and Extended Frege Proofs
+Normal rank
@@ Property / cites work @@
+Settling the complexity of computing two-player Nash equilibria
+Normal rank
@@ Property / cites work @@
+The Complexity of Computing a Nash Equilibrium
@@ Property / cites work: The Complexity of Computing a Nash Equilibrium / rank @@
+Normal rank
@@ Property / cites work @@
+Q5365081
@@ Property / cites work: Q5365081 / rank @@
+Normal rank
@@ Property / cites work @@
+Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
+Normal rank
@@ Property / cites work @@
+Towards a unified complexity theory of total functions
+Normal rank
@@ Property / cites work @@
+The Journey from NP to TFNP Hardness
@@ Property / cites work: The Journey from NP to TFNP Hardness / rank @@
+Normal rank
@@ Property / cites work @@
+Integer factoring and modular square roots
@@ Property / cites work: Integer factoring and modular square roots / rank @@
+Normal rank
@@ Property / cites work @@
+How easy is local search?
@@ Property / cites work: How easy is local search? / rank @@
+Normal rank
@@ Property / cites work @@
+Implicit proofs
@@ Property / cites work: Implicit proofs / rank @@
+Normal rank
@@ Property / cites work @@
+On total functions, existence theorems and computational complexity
+Normal rank
@@ Property / cites work @@
+On the complexity of the parity argument and other inefficient proofs of existence
+Normal rank
@@ Property / cites work @@
+On the complexity of finding falsifying assignments for Herbrand disjunctions
+Normal rank
@@ Property / cites work @@
+Combinatorial nullstellensatz modulo prime powers and the parity argument
+Normal rank
@@ Property / cites work @@
+Tight Bounds for Randomized and Quantum Local Search
+Normal rank