Pages that link to "Item:Q2464338"
From MaRDI portal
The following pages link to The complexity of the descriptiveness of Boolean circuits over different sets of gates (Q2464338):
Displaying 8 items.
- On the applicability of Post's lattice (Q436335) (← links)
- Cyclic Boolean circuits (Q442202) (← links)
- Non-cancellative Boolean circuits: A generalization of monotone boolean circuits (Q1566723) (← 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 deciding if a Boolean function can be computed by circuits over a restricted basis (Q2272200) (← links)
- THE COMPLEXITY OF MODEL CHECKING FOR BOOLEAN FORMULAS (Q3569272) (← links)
- Signatures of Knowledge for Boolean Circuits Under Standard Assumptions (Q5048960) (← links)