Pages that link to "Item:Q1328652"
From MaRDI portal
The following pages link to Complexity of a class of nonlinear combinatorial problems related to their linear counterparts (Q1328652):
Displaying 6 items.
- A nonlinear lower bound on the practical combinational complexity (Q673076) (← links)
- Enumeration results on linear complexity profiles and lattice profiles (Q2489145) (← links)
- On sets of linear forms of maximal complexity (Q2680709) (← links)
- On the Complexity of Computing Two Nonlinearity Measures (Q4981157) (← links)
- Non-deterministic linear hypersubstitutions (Q5136370) (← links)
- Polynomial-Time Separation of a Superclass of Simple Comb Inequalities (Q5388004) (← links)