1730 search results - page 144 / 346 » Algebra and Computation |
117
click to vote
SODA
2012
ACM
13 years 3 months ago
2012
ACM
We investigate fast algorithms for changing between the standard basis and an orthogonal basis of idempotents for M¨obius algebras of finite lattices. We show that every lattice...
90
Voted
ISSAC
2009
Springer
15 years 7 months ago
2009
Springer
We extend Zeilberger’s approach to special function identities to cases that are not holonomic. The method of creative telescoping is thus applied to definite sums or integrals...
86
Voted
ENTCS
2008
15 years 26 days ago
2008
Using linear algebraic techniques, we analyse the computational complexity of testing reachability in Petri nets for which markings can grow very fast. This leads to two subclasse...
101
Voted
ISSAC
2005
Springer
15 years 6 months ago
2005
Springer
We present lifting techniques for triangular decompositions of zero-dimensional varieties, that extend the range of the previous methods. We discuss complexity aspects, and report...
94
Voted
FCT
2003
Springer
15 years 6 months ago
2003
Springer
We develop new proof techniques, based on non-interference, for the analysis of safety and liveness properties of cryptographic protocols expressed as terms of the process algebra ...