Boolean functional synthesis: hardness and practical algorithms
type: Item
instance of: scholarly article
title: Boolean functional synthesis: hardness and practical algorithms
author: S. Akshay
author: Supratik Chakraborty
author: Shubham Goel
author: Sumith Kulal
author: Shetal Shah
published in: Formal Methods in System Design
publication date: 2021-08-30T00:00:00Z
Mathematics Subject Classification ID: 68-XX
zbMATH DE Number: 7388005
zbMATH Keywords: Boolean functional synthesis
zbMATH Keywords: Skolem functions
zbMATH Keywords: expansion-based algorithms
describes a project that uses: ABC
describes a project that uses: CAQE
describes a project that uses: GitHub
MaRDI profile type: Publication
full work available at URL: s10703-020-00352-2
OpenAlex ID: W3093494889
cites work: Towards Parallel Boolean Functional Synthesis
cites work: On the complexity of Boolean unification
cites work: Unified QBF certification and its applications
cites work: Q5802117
cites work: Unification in Boolean rings and Abelian groups
cites work: Graph-Based Algorithms for Boolean Function Manipulation
cites work: The Exponential Time Hypothesis and the Parameterized Clique Problem
cites work: Decomposable negation normal form
cites work: Parametric solutions of Boolean equations
cites work: BDD-Based Boolean Functional Synthesis
cites work: Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking
cites work: On the complexity of \(k\)-SAT
cites work: Quantifier Elimination via Functional Composition
cites work: Turing machines that take advice
cites work: Boolean unification - the story so far
cites work: Incremental Determinization
cites work: Understanding and extending incremental determinization for 2QBF
DOI: 10.1007/S10703-020-00352-2
description: scientific article; zbMATH DE number 7388005