返回导师列表

简介

Propositional satisfiability and finite domain constraint satisfaction results on the complexity of these problems aspects of design of practical algorithms for SAT and CSP application to formal verification and related tasks

教育经历

  • Ph.D., Computer Science, University of Toronto, Canada, 2002
  • M.Sc., Computing Science, Simon Fraser University, Canada, 1993
  • B.Sc., Cognitive Science and Artificial Intelligence, University of Toronto, Canada, 1989

数据校验于 9/6/2026数据来源

学生评价

还没有评价。成为第一位分享经验的学生吧。