| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 429079 | Information Processing Letters | 2010 | 5 Pages |
Abstract
The Region Algebra is a set-at-a-time algebra for querying text regions. We show that satisfiability, inclusion, and equivalence testing of region algebra expressions are PSPACE-complete. This improves upon the previously known NP lower bounds and EXPTIME upper bounds.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
