Search for tag: "np-hard"

Meeting 6.2: More on reversible circuits, and quantum circuits

I follow up more thoroughly on RSAT, an NP-complete satisfiability problem for Boolean reversible circuits. It actually has several variants, of which we discuss 2. (See my Section 2.2 of one of my…

From  Eric Samperton 10 plays 0  

Meeting 4.1: Complexity

I continue to review some of the usual suspects in complexity: P, NP, PSPACE, EXP and such. I then introduce two basic notions of reduction: polynomial-time many-one reductions (aka Karp reductions)…

From  Eric Samperton 23 plays 0