Sökning: "3-SAT"
Hittade 3 avhandlingar innehållade ordet 3-SAT.
1. Actomyosin in biocomputation
Sammanfattning : There exist complex mathematical problems that are important in real world applications such as weather prediction, molecular modelling, network route optimization and more. In general, such problems are solved using supercomputers with higher computing efficiency but this also consumes high energy along with high production and maintenance cost. LÄS MER
2. Approximating Longest Path
Sammanfattning : We investigate the computational hardness of approximating the longest path and the longest cycle in undirected and directed graphs on n vertices. We show that * in any expander graph, we can find (n) long paths in polynomial time. LÄS MER
3. Applications of Partial Polymorphisms in (Fine-Grained) Complexity of Constraint Satisfaction Problems
Sammanfattning : In this thesis we study the worst-case complexity ofconstraint satisfaction problems and some of its variants. We use methods from universal algebra: in particular, algebras of total functions and partial functions that are respectively known as clones and strong partial clones. LÄS MER