If the satisfiability problem (Circuit-SAT) can be polynomial-ti

If the satisfiability problem (Circuit-SAT) can be polynomial-time reducible to a language $$L$$, $$L$$ is NP-Complete. ~@[](1)

答案：FALSE