Back to advisors

About

Design and analysis of efficient algorithms for the solution of hard problems that arise in logic, artificial intelligence, and networks.Theory and Application of SAT (satisfiability) and constraint satisfaction methods.Establishment of theoretical limits for algorithmic techniques.

Data verified 9/6/2026Source

Student reviews

No reviews yet. Be the first to share your experience.