TFNP: An Update (Q5283350)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 6751046

Language	Label	Description	Also known as
English	TFNP: An Update	scientific article; zbMATH DE number 6751046

Statements

scholarly article

0 references

TFNP: An Update (English)

0 references

Paul W. Goldberg

0 references

Christos H. Papadimitriou

0 references

Lecture Notes in Computer Science

0 references

publication date

21 July 2017

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-57586-5_1

0 references

0 references

0 references

The NP Search Problems of Frege and Extended Frege Proofs

0 references

Settling the complexity of computing two-player Nash equilibria

0 references

The Complexity of Computing a Nash Equilibrium

0 references

0 references

Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium

0 references

Towards a unified complexity theory of total functions

0 references

The Journey from NP to TFNP Hardness

0 references

Integer factoring and modular square roots

0 references

How easy is local search?

0 references

Implicit proofs

0 references

On total functions, existence theorems and computational complexity

0 references

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

0 references

On the complexity of finding falsifying assignments for Herbrand disjunctions

0 references

Combinatorial nullstellensatz modulo prime powers and the parity argument

0 references

Tight Bounds for Randomized and Quantum Local Search

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-57586-5_1

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5283350

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5283350&oldid=36335443"