Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14310%2F06%3A00017643" target="_blank" >RIV/00216224:14310/06:00017643 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture
Original language description
We study the complexity of counting the number of solutions to a system of equations over a fixed finite semigroup. We show that this problem is always either in FP or #P-complete and describe the borderline precisely. We use these results to convey someintuition about the conjectured dichotomy for the complexity of counting the number of solutions in constraint satisfaction problems.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/1M0545" target="_blank" >1M0545: Institute for Theoretical Computer Science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2006
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Mathematical Foundations of Computer Science
ISBN
978-3-540-37791-7
ISSN
0302-9743
e-ISSN
—
Number of pages
12
Pages from-to
—
Publisher name
Springer Verlag
Place of publication
Berlin
Event location
Stará Lesná, Slovensko
Event date
Jan 1, 2006
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000240271700051