The Model Checking Problem for Distributed Knowing How is Δp2-Complete
Abstract
We investigate the complexity of the model checking problem for distributed knowing how. We show that the problem is Δp2-complete.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.