PP is closed under intersection
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Lower bounds for the low hierarchy
Journal of the ACM (JACM)
NP trees and Carnap's modal logic
Journal of the ACM (JACM)
Bounded queries, approximations, and the Boolean hierarchy
Information and Computation
Optimal series-parallel trade-offs for reducing a function to its own graph
Information and Computation
Partial Information and Special Case Algorithms
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Comparing Verboseness for Finite Automata and Turing Machines
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Closure of Polynomial Time Partial Information Classes under Polynomial Time Reductions
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Exact complexity of exact-four-colorability
Information Processing Letters
Some connections between bounded query classes and non-uniform complexity
Information and Computation
A Tight Karp-Lipton Collapse Result in Bounded Arithmetic
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Extending downward collapse from 1-versus-2 queries to j-versus-j + 1 queries
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
A tight Karp-Lipton collapse result in bounded arithmetic
ACM Transactions on Computational Logic (TOCL)
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
| Hi-index | 5.25 |