satisfiability problem
[ˌsætɪsˈfaɪəbɪlɪti ˈprɑbləm]
nounpl: satisfiability problems
problema de satisfazibilidade
1. A computational decision problem that asks whether a given Boolean formula can be assigned truth values to its variables such that the formula evaluates to true; a central problem in theoretical computer science and mathematical logic
The satisfiability problem is NP-complete, meaning no known polynomial-time algorithm can solve all instances efficiently.
O problema de satisfazibilidade é NP-completo, o que significa que nenhum algoritmo de tempo polinomial conhecido pode resolver todas as instâncias eficientemente.
2. The determination of whether there exists an assignment of logical values to variables that makes a propositional logic formula true
Researchers are developing new heuristics to tackle challenging satisfiability problems in automated reasoning.
Pesquisadores estão desenvolvendo novas heurísticas para abordar problemas de satisfazibilidade desafiadores em raciocínio automatizado.
The satisfiability problem is fundamental to computer science education and research globally, including in Brazil and Portugal. The abbreviation 'SAT' is widely recognized in both English and Portuguese technical communities. This term is primarily used in academic, research, and software development contexts rather than in everyday conversation.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →