Ph.D. Candidacy Lecture: Kelvin Buno (Approaching SAT with dP Scheme)

Zoom Link https://up-edu.zoom.us/j/85277788877

Meeting ID: 852 7778 8877

Passcode: gsatdm2021

Membrane computing, or usually P systems, is a parallel and distributed computing model able to decide known hard problems, such as SAT, HPP, and SSP, in polynomial time. Usually, this solution P systems obtain all of the input set. We look into a distributed framework in P systems, called Distributed P systems, where the input is partitioned amongst multiple components. We investigated the communication cost of these distributed P systems solving hard problems, SAT in particular. We look into the approaches used in P systems to solve hard problems in polynomial time, and discuss what the trade-offs are when these approaches are used in distributed P systems.