Strong equivalence of reversible circuits is coNP-complete.
Stephen P. JordanPublished in: Quantum Inf. Comput. (2014)
Keyphrases
- strong equivalence
- conp complete
- np complete
- logic programs
- data exchange
- decision problems
- stable models
- conjunctive queries
- argumentation frameworks
- data complexity
- logic programming
- autoepistemic logic
- answer set programming
- answer sets
- reasoning tasks
- argumentation semantics
- classical logic
- sufficient conditions
- np hard
- query answering
- fixpoint
- computational complexity
- special case
- search algorithm
- lower bound
- default logic
- machine learning
- expressive power