The algebras of partial functions and their invariants

From MaRDI portal
Publication:3918109

DOI10.1007/BF01069627zbMath0466.03026MaRDI QIDQ3918109

Boris A. Romov

Publication date: 1981

Published in: Cybernetics (Search for Journal in Brave)




Related Items

Weakly extendable partial clones on an infinite set.Polymorphism-homogeneity and universal algebraic geometryRegularization of integer vector optimization problemsMinimal realizations of discrete systemsDesign of symbolic-processing algorithmsMutually complementary formalizations of deductive query languagesOn multilevel structured program design for process-control systemsProbabilistic automata and simulationAlphabet operators and algorithmsStability of discrete optimization problemsConvergence of a simulation method for solution of combinatorial optimization problemsOptimizing the time to cross a regionMaximal finitely defined subalgebras of partial functions of infinite- valued logicStrong partial clones and the time complexity of SAT problemsUnnamed ItemUnnamed ItemUniqueness of minimal coverings of maximal partial clonesGeneral lower bounds and improved algorithms for infinite-domain CSPsCompleteness theory for the product of finite partial algebrasWeak bases of Boolean co-clonesNon-uniform Boolean Constraint Satisfaction Problems with Cardinality ConstraintComplexity of inverse constraint problems and a dichotomy for the inverse satisfiability problemExtendable local partial clonesOn the interval of strong partial clones of Boolean functions containing \(\mathrm{Pol}(\{(0, 0), (0, 1), (1, 0)\})\)Gap theorems for robust satisfiability: Boolean CSPs and beyondTrichotomies in the complexity of minimal inferenceThe completeness problem in partial hyperclonesUnnamed ItemEndpoints of associated intervals for local clones on an infinite setOn the action of the implicative closure operator on the set of partial functions of the multivalued logicMaximal local classes of partial functions of infinite-valued logicHomogeneous and strictly homogeneous criteria for partial structuresMinimal distance of propositional modelsTime Complexity of Constraint Satisfaction via Universal AlgebraBasics of Galois ConnectionsPartial Polymorphisms and Constraint Satisfaction ProblemsA Dichotomy Theorem for the Inverse Satisfiability ProblemDichotomy on intervals of strong partial Boolean clones



Cites Work