1 citations · 1 across the 2 of their papers we have counts for
1 paper · 1 filter
Mohamed El Halaby, Areeg Abdalla
The k-SAT problem for Ł-clausal forms has been found to be NP-complete if k≥3. Similar to Boolean CNF formulas, Ł-clausal forms are important from a theoretical and practic…