scientific article; zbMATH DE number 3471582
From MaRDI portal
Publication:4055165
Cited in
(7)- Full table search by polynomial functions
- A backtracking method for constructing perfect hash functions from a set of mapping functions
- An ordered minimal perfect hashing scheme based upon Euler's theorem
- The algorithm for identical object searching with bounded worst-case complexity and linear memory
- Free lattices in some small varieties
- Ricerca random pesata in tavole hash
- A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4055165)