Sciweavers

7 search results - page 1 / 2
» Finite Equational Bases in Process Algebra: Results and Open...
Sort
View
BIRTHDAY
2005
Springer
13 years 10 months ago
Finite Equational Bases in Process Algebra: Results and Open Questions
Abstract. Van Glabbeek (1990) presented the linear time/branching time spectrum of behavioral equivalences for finitely branching, concrete, sequential processes. He studied these...
Luca Aceto, Wan Fokkink, Anna Ingólfsd&oacu...
SIAMSC
2008
111views more  SIAMSC 2008»
13 years 4 months ago
An Algebraic Multigrid Approach Based on a Compatible Gauge Reformulation of Maxwell's Equations
With the rise in popularity of compatible finite element, finite difference and finite volume discretizations for the time domain eddy current equations, there has been a correspon...
Pavel B. Bochev, Jonathan J. Hu, Christopher M. Si...
CALCO
2005
Springer
105views Mathematics» more  CALCO 2005»
13 years 10 months ago
Bisimilarity Is Not Finitely Based over BPA with Interrupt
This paper shows that bisimulation equivalence does not afford a finite equational axiomatization over the language obtained by enriching Bergstra and Klop’s Basic Process Alge...
Luca Aceto, Wan Fokkink, Anna Ingólfsd&oacu...
CRYPTO
2008
Springer
186views Cryptology» more  CRYPTO 2008»
13 years 6 months ago
Communication Complexity in Algebraic Two-Party Protocols
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
Rafail Ostrovsky, William E. Skeith III
ECCC
2008
168views more  ECCC 2008»
13 years 4 months ago
Algebrization: A New Barrier in Complexity Theory
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
Scott Aaronson, Avi Wigderson