|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 3 occurrences of 3 keywords
|
|
|
|
|
Results
Found 32 publication records. Showing 32 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 56 | Josh Buresh-Oppenheim, Tsuyoshi Morioka |
Relativized NP Search Problems and Propositional Proof Systems.  |
CCC  |
2004 |
DBLP DOI BibTeX RDF |
|
| 36 | Christos H. Papadimitriou |
On Graph-Theoretic Lemmata and Complexity Classes (Extended Abstract) |
FOCS |
1990 |
DBLP DOI BibTeX RDF |
PLF, graph-theoretic lemmata, TFNP, polynomial local search, class containments, PDLF, search problems, complexity classes, PLS |
| 29 | Siddhartha Jain 0002, Jiawei Li, Robert Robere, Zhiyang Xun |
On Pigeonhole Principles and Ramsey in TFNP. |
Electron. Colloquium Comput. Complex. |
2024 |
DBLP BibTeX RDF |
|
| 29 | Siddhartha Jain 0002, Jiawei Li, Robert Robere, Zhiyang Xun |
On Pigeonhole Principles and Ramsey in TFNP. |
CoRR |
2024 |
DBLP DOI BibTeX RDF |
|
| 29 | Lukás Folwarczný, Mika Göös, Pavel Hubácek, Gilbert Maystre, Weiqiang Yuan 0002 |
One-Way Functions vs. TFNP: Simpler and Improved. |
ITCS |
2024 |
DBLP DOI BibTeX RDF |
|
| 29 | Pavel Hubácek, Erfan Khaniki, Neil Thapen |
TFNP Intersections Through the Lens of Feasible Disjunction. |
ITCS |
2024 |
DBLP DOI BibTeX RDF |
|
| 29 | Yuhao Li 0002, William Pires, Robert Robere |
Intersection Classes in TFNP and Proof Complexity. |
ITCS |
2024 |
DBLP DOI BibTeX RDF |
|
| 29 | Ben Davis, Robert Robere |
Colourful TFNP and Propositional Proofs. |
Electron. Colloquium Comput. Complex. |
2023 |
DBLP BibTeX RDF |
|
| 29 | Lukás Folwarczný, Mika Göös, Pavel Hubácek, Gilbert Maystre, Weiqiang Yuan 0002 |
One-Way Functions vs. TFNP: Simpler and Improved. |
IACR Cryptol. ePrint Arch. |
2023 |
DBLP BibTeX RDF |
|
| 29 | Sam Buss, Noah Fleming, Russell Impagliazzo |
TFNP Characterizations of Proof Systems and Monotone Circuits. |
ITCS |
2023 |
DBLP DOI BibTeX RDF |
|
| 29 | Prahladh Harsha, Daniel Mitropolsky, Alon Rosen |
Downward Self-Reducibility in TFNP. |
ITCS |
2023 |
DBLP DOI BibTeX RDF |
|
| 29 | Ben Davis, Robert Robere |
Colourful TFNP and Propositional Proofs. |
CCC |
2023 |
DBLP DOI BibTeX RDF |
|
| 29 | Mika Göös, Alexandros Hollender, Siddhartha Jain 0002, Gilbert Maystre, William Pires, Robert Robere, Ran Tao |
Separations in Proof Complexity and TFNP. |
Electron. Colloquium Comput. Complex. |
2022 |
DBLP BibTeX RDF |
|
| 29 | Prahladh Harsha, Daniel Mitropolsky, Alon Rosen |
Downward Self-Reducibility in TFNP. |
Electron. Colloquium Comput. Complex. |
2022 |
DBLP BibTeX RDF |
|
| 29 | Mika Göös, Alexandros Hollender, Siddhartha Jain 0002, Gilbert Maystre, William Pires, Robert Robere, Ran Tao |
Further Collapses in TFNP. |
Electron. Colloquium Comput. Complex. |
2022 |
DBLP BibTeX RDF |
|
| 29 | Sam Buss, Noah Fleming, Russell Impagliazzo |
TFNP Characterizations of Proof Systems and Monotone Circuits. |
Electron. Colloquium Comput. Complex. |
2022 |
DBLP BibTeX RDF |
|
| 29 | Mika Göös, Alexandros Hollender, Siddhartha Jain 0002, Gilbert Maystre, William Pires, Robert Robere, Ran Tao |
Further Collapses in TFNP. |
CoRR |
2022 |
DBLP BibTeX RDF |
|
| 29 | Mika Göös, Alexandros Hollender, Siddhartha Jain 0002, Gilbert Maystre, William Pires, Robert Robere, Ran Tao |
Separations in Proof Complexity and TFNP. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
| 29 | Prahladh Harsha, Daniel Mitropolsky, Alon Rosen |
Downward Self-Reducibility in TFNP. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
| 29 | Mika Göös, Alexandros Hollender, Siddhartha Jain 0002, Gilbert Maystre, William Pires, Robert Robere, Ran Tao |
Separations in Proof Complexity and TFNP. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 29 | Mika Göös, Alexandros Hollender, Siddhartha Jain 0002, Gilbert Maystre, William Pires, Robert Robere, Ran Tao |
Further Collapses in TFNP. |
CCC |
2022 |
DBLP DOI BibTeX RDF |
|
| 29 | Pavel Hubácek, Chethan Kamath, Karel Král 0002, Veronika Slívová |
On Average-Case Hardness in TFNP from One-Way Functions. |
IACR Cryptol. ePrint Arch. |
2020 |
DBLP BibTeX RDF |
|
| 29 | Pavel Hubácek, Chethan Kamath, Karel Král 0002, Veronika Slívová |
On Average-Case Hardness in TFNP from One-Way Functions. |
TCC (3) |
2020 |
DBLP DOI BibTeX RDF |
|
| 29 | Rafael Pass, Muthuramakrishnan Venkitasubramaniam |
A Round-Collapse Theorem for Computationally-Sound Protocols; or, TFNP is Hard (on Average) in Pessiland. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
| 29 | Rafael Pass, Muthuramakrishnan Venkitasubramaniam |
A Round-Collapse Theorem for Computationally-Sound Protocols; or, TFNP is Hard (on Average) in Pessiland. |
IACR Cryptol. ePrint Arch. |
2019 |
DBLP BibTeX RDF |
|
| 29 | Mika Göös, Pritish Kamath, Robert Robere, Dmitry Sokolov 0001 |
Adventures in Monotone Complexity and TFNP. |
ITCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 29 | Mika Göös, Pritish Kamath, Robert Robere, Dmitry Sokolov 0001 |
Adventures in Monotone Complexity and TFNP. |
Electron. Colloquium Comput. Complex. |
2018 |
DBLP BibTeX RDF |
|
| 29 | Pavel Hubácek, Moni Naor, Eylon Yogev |
The Journey from NP to TFNP Hardness. |
ITCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 29 | Paul W. Goldberg, Christos H. Papadimitriou |
TFNP: An Update. |
CIAC |
2017 |
DBLP DOI BibTeX RDF |
|
| 29 | Pavel Hubácek, Moni Naor, Eylon Yogev |
The Journey from NP to TFNP Hardness. |
Electron. Colloquium Comput. Complex. |
2016 |
DBLP BibTeX RDF |
|
| 28 | Krishnendu Chatterjee |
Nash Equilibrium for Upward-Closed Objectives. |
CSL |
2006 |
DBLP DOI BibTeX RDF |
|
| 28 | Krishnendu Chatterjee |
Two-Player Nonzero-Sum omega-Regular Games. |
CONCUR |
2005 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #32 of 32 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license