Pages that link to "Item:Q2272200"
From MaRDI portal
The following pages link to The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis (Q2272200):
Displaying 8 items.
- On the applicability of Post's lattice (Q436335) (← links)
- An upper bound for the circuit complexity of existentially quantified Boolean formulas (Q982657) (← links)
- A note on the expressibility problem for modal logics and star-free regular expressions (Q987808) (← links)
- On the complexity of the clone membership problem (Q2048213) (← links)
- Signatures of knowledge for Boolean circuits under standard assumptions (Q2143135) (← links)
- The complexity of the descriptiveness of Boolean circuits over different sets of gates (Q2464338) (← links)
- Isomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits (Q2890182) (← links)
- Signatures of Knowledge for Boolean Circuits Under Standard Assumptions (Q5048960) (← links)