Metadata
Author: ParaCrawl Corpus
Data
English[en]
The first natural problem proven to be NP-complete was the Boolean satisfiability problem, also known as SAT.
Spanish[es]
El primer problema natural que se demostrĂ³ ser NP-completo fue el Problema booleano de satisfacibilidad.