No Efficient Disjunction or Conjunction of Switch-Lists
Computational Complexity
2022-03-10 v1 Artificial Intelligence
Abstract
It is shown that disjunction of two switch-lists can blow up the representation size exponentially. Since switch-lists can be negated without any increase in size, this shows that conjunction of switch-lists also leads to an exponential blow-up in general.
Cite
@article{arxiv.2203.04788,
title = {No Efficient Disjunction or Conjunction of Switch-Lists},
author = {Stefan Mengel},
journal= {arXiv preprint arXiv:2203.04788},
year = {2022}
}