The following pages link to (Q3340780):
Displaying 10 items.
- The circuit complexity of checking polynomiality for functions over residue ring modulo a composite number is linear (Q357917) (← links)
- Complexity of computation in finite fields (Q378003) (← links)
- Secure collaborative supply chain planning and inverse optimization -- the JELS model (Q621669) (← links)
- A nonlinear lower bound on the practical combinational complexity (Q673076) (← links)
- Lower bound on the complexity of finding polynomials of Boolean functions in the class of circuits with separated variables (Q895458) (← links)
- Nonlinear lower bounds on the number of processors of circuits with sublinear separators (Q1183605) (← links)
- New lower bounds on circuit size of multi-output functions (Q2354591) (← links)
- The minimal circuits for linear Boolean functions (Q2513252) (← links)
- A nonlinear lower bound on the practical combinational complexity (Q5096789) (← links)
- (Q5150372) (← links)
