635 search results - page 1 / 127 » Some Computational Problems Related to Pseudo-intents |
ICFCA
2009
Springer
13 years 11 months ago
2009
Springer
STACS
1999
Springer
13 years 9 months ago
1999
Springer
LICS
2000
IEEE
13 years 9 months ago
2000
IEEE
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
TCS
2011
12 years 11 months ago
2011
We consider some Riordan arrays related to binary words avoiding a pattern p, which can be easily studied by means of an A-matrix rather than their A-sequence. Both concepts allow...
ISSAC
2007
Springer
13 years 11 months ago
2007
Springer
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...