The following pages link to (Q3809266):
Displayed 7 items.
- On convex complexity measures (Q964405) (← links)
- On covering graphs by complete bipartite subgraphs (Q1025967) (← links)
- Formula complexity of a linear function in a \(k\)-ary basis (Q2037681) (← links)
- Sufficient conditions for the local repetition-freeness of minimal π-schemes realizing linear Boolean functions (Q3186844) (← links)
- Complexity of the Realization of a Linear Boolean Function in the Class of π-Schemes (Q4558295) (← links)
- On the perfectness of minimal regular partitions of the edge set of the $n$-dimensional cube (Q5090139) (← links)
- ON THE MEANING OF WORKS BY V. M. KHRAPCHENKO (Q5151450) (← links)