Projects funded by the NCN
Satsifiability and equivalence problems for finite algebras
2022/45/B/ST6/02229
Keywords:
solving equations identity checking finite algebras
Descriptors:
- ST6_004:
- ST6_006:
- ST1_002:
Panel:
ST6 - Computer science and informatics: informatics and information systems, computer science, scientific computing, intelligent systems
Host institution :
Uniwersytet Marii Curie-Skłodowskiej w Lublinie, Wydział Matematyki, Fizyki i Informatyki
woj. lubelskie
Principal investigator (from the host institution):
Number of co-investigators in the project: 3
Call: OPUS 23 - announced on 2022-03-28
Amount awarded: 752 740 PLN
Project start date (Y-m-d): 2023-01-27
Project end date (Y-m-d): 2026-01-26
Project duration:: 36 months (the same as in the proposal)
Project status: Project completed
Project description
Download the project description in a pdf file
Note - project descriptions were prepared by the authors of the applications themselves and placed in the system in an unchanged form.
Information in the final report
- Articles in post-conference publications (1)
- Circuit Equivalence in 2-Nilpotent AlgebrasAuthors:Piotr Kawałek, Michael Kompatscher, Jacek KrzaczkowskiConference:41st International Symposium on Theoretical Aspects of Computer Science (rok: 2025, tom: 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024), strony: 45:1-45:17), Wydawca: Schloss Dagstuhl – Leibniz-Zentrum für InformatikData:konferencja 12-14.03.2024Status:PublishedDOI:10.4230/LIPIcs.STACS.2024.45 - link to the publication