Tractable representations for Boolean functional synthesis
From MaRDI portal
Publication:6630716
DOI10.1007/s10472-023-09907-5MaRDI QIDQ6630716
S. Akshay, Shetal Shah, Supratik Chakraborty
Publication date: 31 October 2024
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Knowledge representation (68T30) Logic in computer science (03B70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Other applications of logic (03B80)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Zero-suppressed BDDs and their applications
- Boolean functional synthesis: hardness and practical algorithms
- Interpolation-based semantic gate extraction and its applications to QBF preprocessing
- Incremental Determinization
- Towards Parallel Boolean Functional Synthesis
- On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
- Quantifier Elimination via Functional Composition
- Graph-Based Algorithms for Boolean Function Manipulation
- Binary Decision Diagrams
- On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
- Branching Programs and Binary Decision Diagrams
- BDD-Based Boolean Functional Synthesis
- Logic in Computer Science
- The Exponential Time Hypothesis and the Parameterized Clique Problem
- Decomposable negation normal form
- On the complexity of \(k\)-SAT
- What's hard about Boolean functional synthesis?
This page was built for publication: Tractable representations for Boolean functional synthesis
