Amanote Research
Register
Sign In
Strong Bisimilarity of Simple Process Algebras: Complexity Lower Bounds
Acta Informatica
- Germany
doi 10.1007/s00236-003-0116-9
Full Text
Open PDF
Abstract
Available in
full text
Categories
Computer Networks
Software
Information Systems
Communications
Date
June 1, 2003
Authors
Jiří Srba
Publisher
Springer Science and Business Media LLC
Related search
Property Testing Lower Bounds via Communication Complexity
Computational Complexity
Mathematics
Computational Mathematics
Theoretical Computer Science
Computational Theory
Some Lower Bounds for the Complexity of Continuation Methods
Journal of Complexity
Control
Numerical Analysis
Statistics
Probability
Algebra
Applied Mathematics
Number Theory
Optimization
Mathematics
Depth-4 Lower Bounds, Determinantal Complexity: A Unified Approach
Computational Complexity
Mathematics
Computational Mathematics
Theoretical Computer Science
Computational Theory
Lower Bounds for the Linear Complexity of Sequences Over Residue Rings
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
On the Communication Complexity Methodology for Proving Lower Bounds on the Query Complexity of Property Testing
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Lower Bounds
Strong Perforation in Infinitely Generated $\Mathrm{K}_0$-Groups of Simple $C^*$-Algebras
Mathematica Scandinavica
Mathematics
Lower Bounds for the Parameterized Complexity of Minimum Fill-In and Other Completion Problems
