Spremljaj
Łukasz Orlikowski
Łukasz Orlikowski
Preverjeni e-poštni naslov na students.mimuw.edu.pl
Naslov
Navedeno
Navedeno
Leto
Reachability in vector addition systems is Ackermann-complete
W Czerwiński, Ł Orlikowski
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
1092022
Lower bounds for the reachability problem in fixed dimensional vasses
W Czerwinski, L Orlikowski
Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer …, 2022
122022
Improved lower bounds for reachability in vector addition systems
W Czerwiński, S Lasota, Ł Orlikowski
48th International Colloquium on Automata, Languages, and Programming (ICALP …, 2021
62021
New lower bounds for reachability in vector addition systems
W Czerwiński, I Jecker, S Lasota, J Leroux, Ł Orlikowski
arXiv preprint arXiv:2310.09008, 2023
52023
Reachability in vector addition systems is Ackermann-complete. CoRR abs/2104.13866 (2021)
W Czerwinski, L Orlikowski
arXiv preprint arXiv:2104.13866, 2021
42021
The Tractability Border of Reachability in Simple Vector Addition Systems with States
D Chistikov, W Czerwiński, F Mazowiecki, Ł Orlikowski, H Sinclair-Banks, ...
2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS …, 2024
2024
Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes
Ł Orlikowski, W Czerwiński
2022
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–7