Kjartan Stefánsson. Systems of Set Constraints with Negative Constraints are NEXPTIME-Complete. In Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science, 4-7 July 1994, Paris, France. pages 137-141, IEEE Computer Society, 1994.
@inproceedings{Stefansson94, title = {Systems of Set Constraints with Negative Constraints are NEXPTIME-Complete}, author = {Kjartan Stefánsson}, year = {1994}, tags = {completeness, constraints}, researchr = {https://researchr.org/publication/Stefansson94}, cites = {0}, citedby = {0}, pages = {137-141}, booktitle = {Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science, 4-7 July 1994, Paris, France}, publisher = {IEEE Computer Society}, }