Pages that link to "Item:Q3918030"
From MaRDI portal
The following pages link to On the complexity of some coding problems (Corresp.) (Q3918030):
Displayed 7 items.
- The covering radius of the cycle code of a graph (Q686525) (← links)
- Boolean autoencoders and hypercube clustering complexity (Q690669) (← links)
- Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
- Fault-detection in networks (Q1199624) (← links)
- Factorization properties of lattices over the integers (Q1345515) (← links)
- (Q2741436) (← links)
- Sur la complexité d'un problème de codage (Q3755359) (← links)