Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The Boolean Hierarchy of NP-Partitions
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
On Boolean Lowness and Boolean Highness
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Relating Automata-Theoretic Hierarchies to Complexity-Theoretic Hierarchies
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
On NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
A reducibility for the dot-depth hierarchy
Theoretical Computer Science - Mathematical foundations of computer science 2004
Query-monotonic Turing reductions
Theoretical Computer Science
The boolean hierarchy of NP-partitions
Information and Computation
Complexity of Topological Properties of Regular ω-Languages
Fundamenta Informaticae
Fine hierarchies and m-reducibilities in theoretical computer science
Theoretical Computer Science
Complexity of Topological Properties of Regular ω-Languages
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
The complexity of unions of disjoint sets
Journal of Computer and System Sciences
The complexity of unions of disjoint sets
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
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
Boolean NP-partitions and projective closure
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Complexity of Topological Properties of Regular ω-Languages
Fundamenta Informaticae
Equivalence problems for circuits over sets of natural numbers
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
The Chain Method to Separate Counting Classes
Theory of Computing Systems
Hi-index | 0.00 |