Old Web
English
Sign In
Acemap
>
Paper
>
ANALYSIS OF A NEW REDUCTION CALCULUS FOR THE SATISFIABILITY PROBLEM
ANALYSIS OF A NEW REDUCTION CALCULUS FOR THE SATISFIABILITY PROBLEM
2006
S. Noureddine
Keywords:
Reduction strategy
Combinatorics
Boolean satisfiability problem
Reduction (complexity)
Maximum satisfiability problem
Discrete mathematics
Mathematics
Calculus
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]