The Secret Life of Keys: On the Calculation of Mechanical Lock Systems

DOI10.1137/15M1030054zbMATH Open1370.90232MaRDI QIDQ5738136FDOQ5738136

Flavio de Lorenzi, Erwin Fuchs, Christof Vömel, Samuel Beer

Publication date: 31 May 2017

Published in: SIAM Review (Search for Journal in Brave)

zbMATH Keywords

simulated annealingcombinatorial optimizationdirected acyclic graphglobal optimizationrandomized algorithmheuristicartificial intelligenceNP-completenesssemilatticealgebraic modelsubgraph isomorphismmathematics in industrycylinder locklock system

Mathematics Subject Classification ID

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)

Cites Work

• An Introduction to Statistical Learning
• Elements of Information Theory
• Optimization by Simulated Annealing
• Task Scheduling in an Asynchronous Distributed Memory Multifrontal Solver
• An Algorithm for Subgraph Isomorphism
• Combinatorial optimization. Theory and algorithms.
• The Transitive Reduction of a Directed Graph
• Three Partition Refinement Algorithms
• Maximum distance<tex>q</tex>-nary codes
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• Facts, Conjectures, and Improvements for Simulated Annealing
• The complexity of embedding orders into small products of chains
• Global optimization and simulated annealing
• Stochastic Optimization
• The representation of posets and lattices by sets
• Computational aspects of the 2-dimension of partially ordered sets
• THE LOGIC OF PARTITIONS: INTRODUCTION TO THE DUAL OF THE LOGIC OF SUBSETS
• Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism
• Generalized Polychotomic Encoding: A Very Short Bit-Vector Encoding of Tree Hierarchies
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• Finding subgraphs with side constraints
• The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants
• Locks fit into keys: a crystal analysis of lock polynomials
• Locks, Bombs and Testing: The Case of Independent Locks

Uses Software

• MUMPS
• Genocop
• Stony Brook
• CLIPS
• Tabu search
• Boost
• BGL

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)