2 papers
cs.AI2026
Intermediate Results on the Complexity of STRIPS
Stefan Edelkamp, Jiří Fink, Petr Gregor +2
This paper is based on Bylander's results on the computational complexity of propositional STRIPS planning. He showed that when only ground literals are permitted, determining plan…
math.CO2023
Packing coloring of hypercubes with extended Hamming codes
Petr Gregor, Jaka Kranjc, Borut Lužar +1
A {\em packing coloring} of a graph is a mapping assigning a positive integer (a color) to every vertex of such that every two vertices of color are at distance at leas…