Publisher
Association for Computing Machinery (ACM)
Reference44 articles.
1. The Closure of Monadic NP
2. Lecture Notes in Computer Science;Berman P.,1997
3. On the computational complexity of some classical equivalence relations on boolean functions;Borchert B.;MST: Mathematical Systems Theory,1998
4. The Classical Decision Problem
Cited by
46 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A LOCAL View of the Polynomial Hierarchy;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17
2. Directed Ear Anonymity;Lecture Notes in Computer Science;2024
3. On the complexity of robust multi-stage problems with discrete recourse;Discrete Applied Mathematics;2024-01
4. Tight Double Exponential Lower Bounds;Lecture Notes in Computer Science;2024
5. Querying Incomplete Data: Complexity and Tractability via Datalog and First-Order Rewritings;Theory and Practice of Logic Programming;2023-11-28