Report copyright - Computational Complexity of Diagram Satisfaction in ... · diagram in Euclidean Geometry is satisfiable is NP-hard and in PSPACE, and in fact has the same complexity as the satisfaction
Please pass captcha verification before submit form