The secret life of keys: on the calculation of mechanical lock systems
From MaRDI portal
Publication:5738136
simulated annealingcombinatorial optimizationdirected acyclic graphglobal optimizationrandomized algorithmheuristicartificial intelligenceNP-completenesssemilatticealgebraic modelsubgraph isomorphismmathematics in industrycylinder locklock system
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Randomized algorithms (68W20) Combinatorial optimization (90C27) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Semilattices (06A12)
Recommendations
- The combinatorial complexity of masterkeying
- Mathematical modelling of mechanical combination lock systems
- Problems on mathematical safes on graphs
- Solution of a matrix problem on a mathematical safe for locks of the same kind. I
- Fuming Acid and Cryptanalysis: Handy Tools for Overcoming a Digital Locking and Access Control System
Cites work
- scientific article; zbMATH DE number 2130220 (Why is no real title available?)
- scientific article; zbMATH DE number 4033125 (Why is no real title available?)
- scientific article; zbMATH DE number 41891 (Why is no real title available?)
- scientific article; zbMATH DE number 53945 (Why is no real title available?)
- scientific article; zbMATH DE number 53946 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1219584 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 1973378 (Why is no real title available?)
- scientific article; zbMATH DE number 2061729 (Why is no real title available?)
- scientific article; zbMATH DE number 1554928 (Why is no real title available?)
- scientific article; zbMATH DE number 1748069 (Why is no real title available?)
- scientific article; zbMATH DE number 1786487 (Why is no real title available?)
- scientific article; zbMATH DE number 1862431 (Why is no real title available?)
- scientific article; zbMATH DE number 2117879 (Why is no real title available?)
- scientific article; zbMATH DE number 783783 (Why is no real title available?)
- scientific article; zbMATH DE number 847283 (Why is no real title available?)
- scientific article; zbMATH DE number 867338 (Why is no real title available?)
- scientific article; zbMATH DE number 5686753 (Why is no real title available?)
- scientific article; zbMATH DE number 3050845 (Why is no real title available?)
- An Algorithm for Subgraph Isomorphism
- An introduction to statistical learning. With applications in R
- Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism
- Combinatorial optimization. Theory and algorithms.
- Computational aspects of the 2-dimension of partially ordered sets
- Elements of Information Theory
- Evolutionary optimization algorithms. Biologically inspired and population-based approaches to computer intelligence
- Facts, Conjectures, and Improvements for Simulated Annealing
- Generalized Polychotomic Encoding: A Very Short Bit-Vector Encoding of Tree Hierarchies
- Global optimization and simulated annealing
- Introduction to algorithms.
- Maximum distance<tex>q</tex>-nary codes
- Optimization by simulated annealing
- Stochastic Optimization
- Task Scheduling in an Asynchronous Distributed Memory Multifrontal Solver
- The Transitive Reduction of a Directed Graph
- The algorithm design manual
- The complexity of embedding orders into small products of chains
- The logic of partitions: introduction to the dual of the logic of subsets
- The nature of computation
- The representation of posets and lattices by sets
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Three Partition Refinement Algorithms
Cited in
(6)- Finding subgraphs with side constraints
- Locks fit into keys: a crystal analysis of lock polynomials
- Mathematical modelling of mechanical combination lock systems
- Problems on mathematical safes on graphs
- Locks, Bombs and Testing: The Case of Independent Locks
- The Glasgow subgraph solver: using constraint programming to tackle hard subgraph isomorphism problem variants
This page was built for publication: The secret life of keys: on the calculation of mechanical lock systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5738136)
