Horn-satisfiability
0 sources
Horn-satisfiability
Summary
Horn-satisfiability is a computational problem[1]. Horn-satisfiability draws 37 Wikipedia views per month (computational_problem category, ranking #33 of 61).[2]
Key Facts
- Horn-satisfiability's instance of is recorded as computational problem[3].
- Alfred Horn is named after Horn-satisfiability[4].
- Horn-satisfiability's Freebase ID is recorded as /m/04k5jj[5].
- Horn-satisfiability's Microsoft Academic ID is recorded as 138555303[6].
- Horn-satisfiability's computational complexity is recorded as P-complete[7].
Why It Matters
Horn-satisfiability draws 37 Wikipedia views per month (computational_problem category, ranking #33 of 61).[2] Horn-satisfiability has Wikipedia articles in 6 language editions, a strong signal of global cultural recognition.[8] Horn-satisfiability is known by 8 alternative names across languages and contexts.[9]