Inproceedings,

P ≠ P - Why Some Reasoning Problems Are More Tractable Than Others.

.
RR, volume 8741 of Lecture Notes in Computer Science, page 1-22. Springer, (2014)

Meta data

Tags

Users

  • @dblp

Comments and Reviews