I would like to understand the complexity of $k$-CNF formulae.
For $k\geqslant 1$, can one please give me an example of a formula that is not equivalent to a $k$-CNF formula?
I would like to understand the complexity of $k$-CNF formulae.
For $k\geqslant 1$, can one please give me an example of a formula that is not equivalent to a $k$-CNF formula?
Copyright © 2021 JogjaFile Inc.