content="重慶大學,计算机学院,學術講座" />
新聞動態
The Arts of Satisfiability: Algorithms and Complexity
時間:2019-07-22    浏覽量:

重慶大學計算機學院學術報告

 

報告題目:The Arts of Satisfiability: Algorithms and Complexity

人:陳建二,廣州大學計算機科學與網絡工程學院教授

報告時間:2019724 下午15:00

報告地點:重慶大學A區主教學大樓1811

報告摘要: The Satisfiability problem (SAT) and its optimization version Max-SAT have been central to the research in computer science with wide applications in many areas such as software testing, AI, bioinformatics, and computational optimization. In this talk, we will focus on the theoretical advances and recent progresses in the study of algorithms and complexity of SAT and MaxSAT problems. We study the complexity of the problems and survey techniques that have been proven effective in development of algorithms for the problems. In particular, we will present in detail some new techniques based on resolution and domination that lead to faster algorithms for the problems.  

主講人介绍:陳建二,男, 中南大學計算機科學專業本科畢業,美國紐約大學計算機科學博士,美國哥倫比亞大學數學博士。國際期刊《Journal of Computer and System Sciences》和《IEEE Transactions on Computers》編委、以及《中國科學:信息科學》和《計算機學報》編委。現任廣州大學計算機科學與網絡工程學院教授。獲中國國家自然科學基金委傑出青年基金(B類)、教育部長江學者特聘教授、教育部高等學校自然科學一等獎(排名第1)、教育部長江學者創新團隊帶頭人。主持了多項國家自然科學基金委和教育部的重點項目和面上項目,並作爲重要成員參加了國家基金委創新研究群體和科技部的重點項目。研究領域包括計算機算法設計分析和應用研究、計算複雜性理論、生物信息學和計算機圖形學。