Browsing University of Waterloo by Subject "nondeterministic polynomial time complexity"
Now showing items 1-1 of 1
-
A Serverless Discrete Optimization Service in the Cloud Based on Boolean Circuit Satisfiability
(University of Waterloo, 2023-09-19)This thesis discusses the implementation of a serverless cloud service designed for solving discrete optimization problems encoded as boolean circuit satisfiability. Boolean circuit satisfiability problem involves determining ...