Size-depth tradeoffs for Boolean formulae
Information Processing Letters
Theories of computability
The Parallel Evaluation of General Arithmetic Expressions
Journal of the ACM (JACM)
The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments
Electronic Notes in Theoretical Computer Science (ENTCS)
The Complexity of Reasoning for Fragments of Default Logic
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
The complexity of propositional implication
Information Processing Letters
The Complexity of Circumscriptive Inference in Post's Lattice
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Model Checking CTL is Almost Always Inherently Sequential
TIME '09 Proceedings of the 2009 16th International Symposium on Temporal Representation and Reasoning
The complexity of Boolean formula minimization
Journal of Computer and System Sciences
Generalized modal satisfiability
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
| Hi-index | 0.89 |
For decision problems @P(B) defined over Boolean circuits using gates from a restricted set B only, we have @P(B)=