# Solving equations over small unary algebras

Abstract : We consider the problem of solving a system of polynomial equations over fixed algebra $A$ which we call MPolSat($A$). We restrict ourselves to unary algebras and give a partial characterization of complexity of MPolSat($A$). We isolate a preorder $P(A)$ to show that when $A$ has at most 3 elements then MPolSat($A$) is in $P$ when width of $P(A)$ is at most 2 and is NP-complete otherwise. We show also that if $P ≠ NP$ then the class of unary algebras solvable in polynomial time is not closed under homomorphic images.
Keywords :
Type de document :
Communication dans un congrès
David, René and Gardy, Danièle and Lescanne, Pierre and Zaionc, Marek. Computational Logic and Applications, CLA '05, 2005, Chambéry, France. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AF, Computational Logic and Applications (CLA '05), pp.49-60, 2005, DMTCS Proceedings
Domaine :

Littérature citée [5 références]

https://hal.inria.fr/hal-01183338
Contributeur : Coordination Episciences Iam <>
Soumis le : mercredi 12 août 2015 - 10:19:19
Dernière modification le : mercredi 10 mai 2017 - 17:40:19
Document(s) archivé(s) le : vendredi 13 novembre 2015 - 11:35:50

### Fichier

dmAF0103.pdf
Fichiers éditeurs autorisés sur une archive ouverte

### Identifiants

• HAL Id : hal-01183338, version 1

### Citation

Przemyslaw Broniek. Solving equations over small unary algebras. David, René and Gardy, Danièle and Lescanne, Pierre and Zaionc, Marek. Computational Logic and Applications, CLA '05, 2005, Chambéry, France. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AF, Computational Logic and Applications (CLA '05), pp.49-60, 2005, DMTCS Proceedings. 〈hal-01183338〉

### Métriques

Consultations de la notice

## 45

Téléchargements de fichiers