Muli Safra

Muli Safra

Professor of Computer Science, Tel Aviv University
Cited by 10500
NP-hard Boolean functions hardness random graphs probabilistically checkable proofs
Wenqi Huang

Wenqi Huang

Huazhong University of Science and Technology
Cited by 3963
NP Hard Complexity Packing SAT Scheduling
Tao Ye

Tao Ye

School of Computer Science and Technology, Huazhong University of Science and …
Cited by 311
NP Hard Optimization Packing Scheduling SAT
Wissam Marrouche

Wissam Marrouche

Lebanese American University
Verified email at lau.edu
Cited by 69
Digital design meta heuristics machine learning scheduling NP-Hard
sandeep vasant

sandeep vasant

Navrachana University
Verified email at nuv.ac.in
Cited by 45
Genetic Algorithm NP Hard Optimization
Mayuresh Pardeshi

Mayuresh Pardeshi

Professor of Computer Engineering
Cited by 2
NP Hard Security and Algorithms