A 2exptime complete varietal membership problem
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F09%3A00207340" target="_blank" >RIV/00216208:11320/09:00207340 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
A 2exptime complete varietal membership problem
Original language description
We construct a finite algebra generating a variety with 2EXPTIME complete membership problem. This proves that the universal membership problem for varieties and the varietal equivalence problem are 2EXPTIME complete as well, answering the question of Bergman and Slutzki from 2000.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/LC505" target="_blank" >LC505: Eduard Čech Center for Algebra and Geometry</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2009
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
Name of the periodical
SIAM Journal on Computing
ISSN
0097-5397
e-ISSN
—
Volume of the periodical
38
Issue of the periodical within the volume
6
Country of publishing house
US - UNITED STATES
Number of pages
25
Pages from-to
—
UT code for WoS article
000266018400014
EID of the result in the Scopus database
—