Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference8 articles.
1. P. Beame, S. Cook, J. Edmonds, R. Impagliazzo, and T. Pitasi, The relative complexity of NP search problems, in Proc. 27th Annual ACM Symposium on the Theory of Computing, 1995, pp. 303–314.
2. Graphs and Hypergraphs;Berge,1973
3. On inefficient proofs of existence and complexity classes;Papadimitriou,1991
4. C. Papadimitriou, On graph-theoretic lemmata and complexity classes, in Proc. 31st Annual Symposium on Foundations of Computer Science, 1995, pp. 794–801.
5. On the complexity of the parity argument and other inefficient proofs of existence;Papadimitriou;J. Comput. System Sci.,1994
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. What is a combinatorial interpretation?;Proceedings of Symposia in Pure Mathematics;2024
2. What is in #P and what is not?;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
3. A PPA parity theorem about trees in a bipartite graph;Discrete Applied Mathematics;2022-02
4. A short note on graphs with long Thomason chains;Discrete Mathematics;2022-01
5. A parity theorem about trees with specified degrees;Discrete Applied Mathematics;2021-12