New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P
IEEE Transactions on Computers
On the relationship of congruence closureand unification
Journal of Symbolic Computation
Parallel computation over hyperbolic groups
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Structural Properties of One-way Hash Functions
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Some connections between nonuniform and uniform complexity classes
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
A new parallel algorithm for the maximal independent set problem
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Theoretical Computer Science
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
Evaluating branching programs on encrypted data
TCC'07 Proceedings of the 4th conference on Theory of cryptography
A fast parallel algorithm for routing in permutation networks
IEEE Transactions on Computers
A DNA-based simulation model for bounded fan-in Boolean circuits
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Analytic sets in Descriptive Set Theory and NP sets in Complexity Theory
Fundamenta Informaticae
| Hi-index | 0.01 |
It is well known that time bounds for machines correspond closely to size bounds for networks, and that space bounds correspond to depth bounds. It is not known whether simultaneous time and space bounds correspond to simultaneous size and depth bounds. It is shown here that simultaneous time and "reversal" bounds correspond to simultaneous size and depth bounds, and that simultaneous time and space bounds correspond to simultaneous size and "width" bounds.