The following pages link to (Q3994882):
Displaying 28 items.
- Complexity of computation in finite fields (Q378003) (← links)
- Upper bounds for the formula size of symmetric Boolean functions (Q465106) (← links)
- On a small class of Boolean sums (Q671372) (← links)
- Planar acyclic computation (Q751805) (← links)
- On the computational complexity of qualitative coalitional games (Q814613) (← links)
- Comment on Kochol's paper ``Efficient monotone circuits for threshold functions'' (Q918706) (← links)
- The complexity of deciding reachability properties of distributed negotiation schemes (Q924139) (← links)
- Tight bounds for the multiplicative complexity of symmetric functions (Q924152) (← links)
- Comparison between parallel and serial dynamics of Boolean networks (Q924153) (← links)
- Sequential operator for filtering cycles in Boolean networks (Q990765) (← links)
- Computational properties of argument systems satisfying graph-theoretic constraints (Q1028949) (← links)
- Shallow circuits and concise formulae for multiple addition and multiplication (Q1312182) (← links)
- Multiprocessor simulation strategies with optimal speed-up (Q1349734) (← links)
- Complexity of Boolean functions over bases with unbounded fan-in gates (Q1350754) (← links)
- On the number of ANDs versus the number of ORs in monotone Boolean circuits (Q1847364) (← links)
- Coherence in finite argument systems. (Q1852853) (← links)
- Topics in the theory of DNA computing. (Q1853473) (← links)
- On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\). (Q1978699) (← links)
- On the complexity of monotone circuits for threshold symmetric Boolean functions (Q2064376) (← links)
- Maximum number of fixed points in AND-OR-NOT networks (Q2453540) (← links)
- On the computational complexity of coalitional resource games (Q2457612) (← links)
- The complexity of contract negotiation (Q2457671) (← links)
- SIMPLIFYING BOOLEAN NETWORKS (Q3373074) (← links)
- On Negations in Boolean Networks (Q3644711) (← links)
- How Do Read-Once Formulae Shrink? (Q4325332) (← links)
- FINDING CYCLES IN SYNCHRONOUS BOOLEAN NETWORKS WITH APPLICATIONS TO BIOCHEMICAL SYSTEMS (Q4653797) (← links)
- Shrinkage of de Morgan formulae under restriction (Q4696225) (← links)
- ON THE MEANING OF WORKS BY V. M. KHRAPCHENKO (Q5151450) (← links)
