Dyn-FO (preliminary version): a parallel, dynamic complexity class
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Uniform constant-depth threshold circuits for division and iterated multiplication
Journal of Computer and System Sciences - Complexity 2001
The Dynamic Complexity of Transitive Closure Is In DynTC0
ICDT '01 Proceedings of the 8th International Conference on Database Theory
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
The First-Order Isomorphism Theorem
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
The Descriptive Comlexity of the Fixed-Points of Bounded Formulas
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
A generalization of Fagin's theorem
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
On TC/sup 0/, AC/sup 0/, and Arithmetic Circuits
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
The complexity of tensor calculus
Computational Complexity
Dichotomies for classes of homomorphism problems involving unary functions
Theoretical Computer Science
The Complexity of Tensor Circuit Evaluation
Computational Complexity
Characterizing Valiant's algebraic complexity classes
Journal of Complexity
Algorithms and theory of computation handbook
The isomorphism conjecture for constant depth reductions
Journal of Computer and System Sciences
Characterizing valiant's algebraic complexity classes
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Iterated group products and leakage resilience against NC1
Proceedings of the 5th conference on Innovations in theoretical computer science
Hi-index | 0.00 |