Pages that link to "Item:Q2513252"

The following pages link to The minimal circuits for linear Boolean functions (Q2513252):

Displaying 13 items.

• Complexity of realization of a linear Boolean function in Sheffer's basis (Q355321) (← links)
• On the minimal memory volume that is necessary for realization of boolean function by conveyor boolean circuits (Q1847355) (← links)
• The minimal volume of memory necessary for realizing the functions of Boolean algebra by converter circuits (Q1848652) (← links)
• Sequential computation of linear Boolean mappings (Q1884927) (← links)
• Minimal contact circuits for a sequence of Boolean functions (Q2049296) (← links)
• The generalized complexity of linear Boolean functions (Q2295973) (← links)
• Sparse Boolean equations and circuit lattices (Q2430703) (← links)
• On implementation of Boolean functions by contact circuits of minimal uniform width (Q2685505) (← links)
• Minimal feedforward parity networks using threshold gates (Q2708445) (← links)
• On minimal circuits for linear functions over some bases (Q2852141) (← links)
• Функциональные схемы, задающие семейства подстановок на пространстве $GF(2)^N$ (Q3383087) (← links)
• (Q5263827) (← links)
• New Minimal Linear Inferences in Boolean Logic Independent of Switch and Medial (Q6159929) (← links)