Search papers, labs, and topics across Lattice.
University of Warsaw
1
0
PSPACE-completeness of the reachability problem in 3-VAS reveals a crucial boundary in computational complexity that was previously unresolved.
