Concept

2-satisfiability

Related publications (49)

About
Privacy
Disclaimer

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

2-satisfiability

Graph Chatbot

Chat with Graph Search

The Complexity of Satisfiability Checking for Symbolic Finite Automata

The Complexity of Checking Non-Emptiness in Symbolic Tree Automata

On Semi-Algebraic Proofs and Algorithms

NP Satisfiability for Arrays as Powers

Learning from survey propagation: a neural network for MAX-E-3-SAT

Boolean satisfiability in quantum compilation

Exact Synthesis of ESOP Forms

Exact Synthesis of Boolean Functions in Majority-of-five Forms

Size Matters: Cardinality-Constrained Clustering and Outlier Detection via Conic Optimization

Canonical Computation without Canonical Representation