Main navigation | Main content

HOME » PROGRAMS/ACTIVITIES » Annual Thematic Program

PROGRAMS/ACTIVITIES

Annual Thematic Program »Postdoctoral Fellowships »Hot Topics and Special »Public Lectures »New Directions »PI Programs »Math Modeling »Seminars »Be an Organizer »Annual »Hot Topics »PI Summer »PI Conference »Applying to Participate »

Talk Abstract

Parallel Algorithms for the Satisfiability (SAT) Problem

Parallel Algorithms for the Satisfiability (SAT) Problem

The satisfiability (SAT) problem is a central problem in mathematical
logic, computing theory, and artificial intelligence. In practice,
the SAT problem is fundamental in solving many practical application
problems. Methods to solve the SAT problem play an important
role in the development of computing theory and intelligent
computing systems. There has been great interest in the design
of efficient algorithms to solve the SAT problem. Since the
past decade, a variety of parallel processing techniques have
been developed to solve the SAT problem. The goal of this talk
is to expose the rapidly growing field, to discuss tradeoff
and limitations, and to describe state-of-the-art techniques,
both algorithms and special-purpose architectures, for parallel
processing of the satisfiability problem.

Back to Workshop
Schedule