Pages that link to "Item:Q4834386"

The following pages link to An ${\mathcal{N} \mathcal{C}}$ Algorithm for Evaluating Monotone Planar Circuits (Q4834386):

Displaying 5 items.

• A generalization of Spira's theorem and circuits with small segregators or separators (Q342721) (← links)
• The complexity of the bootstraping percolation and other problems (Q393154) (← links)
• The complexity of the asynchronous prediction of the majority automata (Q2201796) (← links)
• The complexity of the majority rule on planar graphs (Q2255002) (← links)
• The complexity of the comparator circuit value problem (Q2828221) (← links)