The random oracle hypothesis is false
Journal of Computer and System Sciences
NP trees and Carnap's modal logic
Journal of the ACM (JACM)
ACM SIGACT News
The complexity of matrix rank and feasible systems of linear equations (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Experimenting with power default reasoning
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Bounded queries, approximations, and the Boolean hierarchy
Information and Computation
Reducing the number of solutions of NP functions
Journal of Computer and System Sciences
Reducing the Number of Solutions of NP Functions
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Computational Politics: Electoral Systems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
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
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
Exact complexity of exact-four-colorability
Information Processing Letters
Logical Preference Representation and Combinatorial Vote
Annals of Mathematics and Artificial Intelligence
Theoretical Computer Science
Quantum and classical complexity classes: separations, collapses, and closure properties
Information and Computation
All superlinear inverse schemes are coNP-hard
Theoretical Computer Science - Mathematical foundations of computer science 2004
Resource bounded immunity and simplicity
Theoretical Computer Science
Cluster computing and the power of edge recognition
Information and Computation
The boolean hierarchy of NP-partitions
Information and Computation
The complexity of unions of disjoint sets
Journal of Computer and System Sciences
Satisfiability Parsimoniously Reduces to the Tantrix™ Rotation Puzzle Problem
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Information and Computation
Quantum and classical complexity classes: Separations, collapses, and closure properties
Information and Computation
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
Satisfiability parsimoniously reduces to the Tantrix™ rotation puzzle problem
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Boolean NP-partitions and projective closure
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Observations on complete sets between linear time and polynomial time
Information and Computation
P-Selectivity, immunity, and the power of one bit
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Cluster computing and the power of edge recognition
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Guarantees for the success frequency of an algorithm for finding dodgson-election winners
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
On qualitative route descriptions: representation and computational complexity
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Satisfiability Parsimoniously Reduces to the Tantrix™ Rotation Puzzle Problem
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Autonomous Agents and Multi-Agent Systems
| Hi-index | 0.00 |