activity
20072016
most citedEssential Variables and Separable Sets in Universal Algebra

16 citations · 38 across the 15 of their papers we have counts for

collaborators

15 papers

cs.DM2016

Minor complexities of finite operations

Slavcho Shtrakov

In this paper we present a new class of complexity measures, induced by a new data structure for representing -valued functions (operations), called minor decision diagram. The…

cs.CC2015★ 2 cited

On the complexity of finite valued functions

Sl. Shtrakov, I. Damyanov

The essential variables in a finite function are defined as variables which occur in and weigh with the values of that function. The number of essential variables is an imp…

cs.DM2010★ 2 cited

Finite symmetric functions with non-trivial arity gap

Sl. Shtrakov, J. Koppitz

Given an -ary valued function , denotes the essential arity gap of which is the minimal number of essential variables in which become fictive when identi…

math.RA2008★ 16 cited

Essential Variables and Separable Sets in Universal Algebra

Slavcho Shtrakov, Klaus Denecke

The study of essential and strongly essential variables in functions defined on finite sets is a part of -valued logic. We extend the main definitions from functions to terms. T…

math.RA2008★ 1 cited

Multi-Hypersubstitutions and Colored Solid Varieties

Klaus Denecke, Jorg Koppitz, Slavcho Shtrakov

Hypersubstitutions are mappings which map operation symbols to terms. Terms can be visualized by trees. Hypersubstitutions can be extended to mappings defined on sets of trees. The…

math.RA2008

The Depth of a Hypersubstitution

Klaus Denecke, Jorg Koppitz, Slavcho Shtrakov

For given depth of a we derive a formula for the depth of the image of that term under a given hypersubstitution.