Sciweavers

38 search results - page 2 / 8
» Computational Complexity of Generators and Nongenerators in ...
Sort
View
TCS
2010
13 years 5 hour ago
A fluid analysis framework for a Markovian process algebra
Markovian process algebras, such as PEPA and stochastic -calculus, bring a powerful compositional approach to the performance modelling of complex systems. However, the models gen...
Richard A. Hayden, Jeremy T. Bradley
MFCS
2005
Springer
13 years 10 months ago
Inverse Monoids: Decidability and Complexity of Algebraic Questions
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
Markus Lohrey, Nicole Ondrusch
ISSAC
2007
Springer
131views Mathematics» more  ISSAC 2007»
13 years 11 months ago
Some recent progress in exact linear algebra and related questions
We describe some major recent progress in exact and symbolic linear algebra. These advances concern the improvement of complexity estimates for fundamental problems such as linear...
Gilles Villard
CADE
2004
Springer
14 years 5 months ago
Automatic Generation of Classification Theorems for Finite Algebras
Abstract. Classifying finite algebraic structures has been a major motivation behind much research in pure mathematics. Automated techniques have aided in this process, but this ha...
Simon Colton, Andreas Meier, Volker Sorge, Roy L. ...
SAMOS
2010
Springer
13 years 3 months ago
Accelerating high-level engineering computations by automatic compilation of Geometric Algebra to hardware accelerators
Abstract—Geometric Algebra (GA), a generalization of quaternions, is a very powerful form for intuitively expressing and manipulating complex geometric relationships common to en...
Jens Huthmann, Peter Muller, Florian Stock, Dietma...