88 search results - page 12 / 18 » Computing automorphisms of semigroups |
139
click to vote
CSR
2009
Springer
15 years 10 months ago
2009
Springer
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σp 2 . In the case of linear matroids, which are represented over poly...
124
Voted
FOSSACS
2004
Springer
15 years 8 months ago
2004
Springer
We describe a game semantics for local names in a functional setting. It is based on a category of dialogue games acted upon by the automorphism group of the natural numbers; this ...
141
click to vote
FCT
2007
Springer
15 years 9 months ago
2007
Springer
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether S is a semigroup or ...
114
Voted
TAMC
2007
Springer
15 years 9 months ago
2007
Springer
A word w is called synchronizing (recurrent, reset, directable) word of deterministic finite automaton (DFA) if w brings all states of the automaton to an unique state. ˇCerny co...
109
click to vote
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
— In recent years, idempotent methods (specifically, max-plus methods) have been developed for solution of nonlinear control problems. It was thought that idempotent linearity o...