Sciweavers

3454 search results - page 185 / 691
» Modern computer algebra
Sort
View
ENTCS
2008
103views more  ENTCS 2008»
15 years 6 months ago
Analyzing Reachability for Some Petri Nets With Fast Growing Markings
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...
M. Praveen, Kamal Lodaya
TOMS
2008
80views more  TOMS 2008»
15 years 6 months ago
Updating an LU Factorization with Pivoting
We show how to compute an LU factorization of a matrix when the factors of a leading principle submatrix are already known. The approach incorporates pivoting akin to partial pivo...
Enrique S. Quintana-Ortí, Robert A. van de ...
CHI
2009
ACM
16 years 7 months ago
Friend or foe?: examining CAS use in mathematics research
Computer Algebra Systems (CAS) provide sophisticated functionality to assist with mathematical problem solving. Despite their widespread adoption, however, little work in the HCI ...
Andrea Bunt, Michael Terry, Edward Lank
IWEC
2004
15 years 8 months ago
Electronic Augmentation of Traditional Board Games
Manufacturers of traditional board games are looking for ideas to innovate their products and keep up with the popularity of modern computer games. We developed an idea of how trad...
Clim J. de Boer, Maarten H. Lamers
ESORICS
2005
Springer
16 years 1 days ago
Limits of the Cryptographic Realization of Dolev-Yao-Style XOR
The abstraction of cryptographic operations by term algebras, called Dolev-Yao models, is essential in almost all tool-supported methods for proving security protocols. Recently si...
Michael Backes, Birgit Pfitzmann