DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» TFNP
TFNP
The Classes FNP and TFNP
Lecture: Complexity of Finding a Nash Equilibrium 1 Computational
The Relative Complexity of NP Search Problems
Computational Complexity; Slides 9, HT 2019 NP Search Problems, and Total Search Problems
On Total Functions, Existence Theorems and Computational Complexity
A Tour of the Complexity Classes Between P and NP
Total Functions in QMA
4.1 Introduction 4.2 NP And
Towards a Unified Complexity Theory of Total Functions
The Classes PPA-K : Existence from Arguments Modulo K
Reductions in PPP
White-Box Vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing
Arxiv:1804.03450V2 [Cs.CC] 18 Apr 2018 End of Potential Line
Total NP Functions I: Complexity and Reducibility
On the TFNP Complexity of Factoring
Colorful Linear Programming, Nash Equilibrium , and Pivots Frédéric Meunier, Pauline Sarrabezolles
PPP-Completeness with Connections to Cryptography
Total NP Functions I: Complexity and Reducibility
Top View
Approximate Counting and NP Search Problems
Reducibility Among Fractional Stability Problems
On the Polynomial Parity Argument Complexity of the Combinatorial
Computational Complexity; Slides 15, HT 2021 Search Problems, and Total Search Problems
On Search Complexity of Discrete Logarithm
NP,Conp and Funtion Problems Eurocg ’14, Ein-Gedi, Israel 1 / 18 a ”No”-Instance of a Problem in Conp Possesses a Short Proof of Being a ”No”-Instance
Equilibria, Fixed Points, and Computational Complexity – Nevanlinna Prize Lecture
Accepted Manuscript1.0
End of Potential Line
The Journey from NP to TFNP Hardness
Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes !
Unique End of Potential Line 10
The Complexity of Gradient Descent: CLS = PPAD ∩ PLS John Fearnley Paul W
Towards a Unified Complexity Theory of Total Functions
On Modulo Q Arguments and the Chevalley-Warning Theorem
I. Introduction to NP Functions and Local Search
On the Complexity of Modulo-Q Arguments and the Chevalley
On Average-Case Hardness in TFNP from One-Way Functions⋆