Login / Signup

Satisfiability in Many-Valued Sentential Logic is NP-Complete.

Daniele Mundici
Published in: Theor. Comput. Sci. (1987)
Keyphrases