Pages that link to "Item:Q2050108"
From MaRDI portal
The following pages link to Boolean functional synthesis: hardness and practical algorithms (Q2050108):
Displaying 11 items.
- Asymptotically best method for synthesis of Boolean recursive circuits (Q783110) (← links)
- Algorithms for synthesis of polynomials implementing weakly specified Boolean functions and systems (Q2487688) (← links)
- (Q2958409) (← links)
- Towards Parallel Boolean Functional Synthesis (Q3303903) (← links)
- (Q4542178) (← links)
- Set-theoretical Constructions of Boolean Functions and theirs Applications in Logic Synthesis (Q4932072) (← links)
- (Q5661425) (← links)
- What's hard about Boolean functional synthesis? (Q6045007) (← links)
- Boolean functional synthesis: from under the hood of solvers (Q6132564) (← links)
- Counterexample guided knowledge compilation for Boolean functional synthesis (Q6535639) (← links)
- Tractable representations for Boolean functional synthesis (Q6630716) (← links)