Pages that link to "Item:Q2272200"

The following pages link to The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis (Q2272200):

Displaying 2 items.

• 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)