Markus Steindl

activity

20162022

most citedOn semigroups with PSPACE-complete subpower membership problem

3 citations · 3 across the 3 of their papers we have counts for

collaborators

5 papers

math.GR2022

Not all nilpotent monoids are finitely related

Markus Steindl

A finite semigroup is finitely related (has finite degree) if its term functions are determined by a finite set of finitary relations. For example, it is known that all nilpotent s…

math.ST2017

Constrained Best Linear Unbiased Estimation

Oliver Lang, Mario Huemer, Markus Steindl

The least squares (LS) estimator and the best linear unbiased estimator (BLUE) are two well-studied approaches for the estimation of a deterministic but unknown parameter vector. I…

math.GR2016★ 3 cited

On semigroups with PSPACE-complete subpower membership problem

Markus Steindl

Fix a finite semigroup $S$ and let $a_{1}, \dots, a_{k}, b$ be tuples in a direct power $S^{n}$ . The subpower membership problem (SMP) for $S$ asks whether $b$ can be generated by $a_1,…

math.GR2016

The subpower membership problem for bands

Markus Steindl

Fix a finite semigroup $S$ and let $a_{1}, \dots, a_{k}, b$ be tuples in a direct power $S^{n}$ . The subpower membership problem (SMP) for $S$ asks whether $b$ can be generated by $a_1,\l…

math.GR2016

The subpower membership problem for semigroups

Andrei Bulatov, Marcin Kozik, Peter Mayr +1

Fix a finite semigroup $S$ and let $a_{1}, \dots, a_{k}, b$ be tuples in a direct power $S^{n}$ . The subpower membership problem (SMP) asks whether $b$ can be generated by $a_1,\ldots,a_k…