Solving equations over small unary algebras

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...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete mathematics and theoretical computer science Ročník DMTCS Proceedings vol. AF,...; číslo Proceedings; s. 49 - 60
Hlavný autor:	Broniek, Przemyslaw
Médium:	Journal Article Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	DMTCS 01.01.2005 Discrete Mathematics and Theoretical Computer Science Discrete Mathematics & Theoretical Computer Science
Edícia:	DMTCS Proceedings
Predmet:	[info.info-lo] computer science [cs]/logic in computer science [cs.lo] [info.info-sc] computer science [cs]/symbolic computation [cs.sc] algebra computational complexity Computer Science dichotomy Logic in Computer Science sat Symbolic Computation algebra dichotomy SAT computational complexity
ISSN:	1365-8050, 1462-7264, 1365-8050
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!