On How Turing and Singleton Arc Consistency Broke the Enigma Code (Englisch)
Freier Zugriff
- Neue Suche nach: Antuori, Valentin
- Neue Suche nach: Portoleau, Tom
- Neue Suche nach: Rivière, Louis
- Neue Suche nach: Hebrard, Emmanuel
- Weitere Informationen zu Hebrard, Emmanuel:
- https://orcid.org/0000-0003-3131-0709
- Neue Suche nach: Antuori, Valentin
- Neue Suche nach: Portoleau, Tom
- Neue Suche nach: Rivière, Louis
- Neue Suche nach: Hebrard, Emmanuel
- Weitere Informationen zu Hebrard, Emmanuel:
- https://orcid.org/0000-0003-3131-0709
- Neue Suche nach: Michel, Laurent D.
- Weitere Informationen zu Michel, Laurent D.:
- https://orcid.org/0000-0001-7230-7130
In:
LIPIcs, Volume 210, CP 2021
: 27th International Conference on Principles and Practice of Constraint Programming (CP 2021)
;
210
;
13:1-13:16
;
2021
-
ISBN:
-
ISSN:
- Aufsatz (Konferenz) / Elektronische Ressource
-
Titel:On How Turing and Singleton Arc Consistency Broke the Enigma Code
-
Beteiligte:Antuori, Valentin ( Autor:in ) / Portoleau, Tom ( Autor:in ) / Rivière, Louis ( Autor:in ) / Hebrard, Emmanuel ( Autor:in ) / Michel, Laurent D. ( Herausgeber:in )
-
Erschienen in:LIPIcs, Volume 210, CP 2021 : 27th International Conference on Principles and Practice of Constraint Programming (CP 2021) ; 210 ; 13:1-13:16Leibniz International Proceedings in Informatics (LIPIcs) ; 210 ; 13:1-13:16
-
Verlag:
- Neue Suche nach: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
-
Erscheinungsdatum:15.10.2021
-
Format / Umfang:16 pages , 899315 byte
-
Anmerkungen:LIPIcs, Vol. 210, 27th International Conference on Principles and Practice of Constraint Programming (CP 2021), pages 13:1-13:16
-
ISBN:
-
ISSN:
-
DOI:
-
Medientyp:Aufsatz (Konferenz)
-
Format:Elektronische Ressource
-
Sprache:Englisch
-
Schlagwörter:
-
Lizenzbestimmungen:
-
Datenquelle:
Inhaltsverzeichnis Konferenzband
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
The Bi-Objective Long-Haul Transportation Problem on a Road Network (Invited Talk)Archetti, Claudia / Jabali, Ola / Mor, Andrea / Simonetto, Alberto / Speranza, M.Grazia et al. | 2021
- 2
-
Constrained-Based Differential Privacy (Invited Talk)Fioretto, Ferdinando et al. | 2021
- 3
-
Learning in Local Branching (Invited Talk)Liu, Defeng / Lodi, Andrea et al. | 2021
- 4
-
Filtering Isomorphic Models by Invariants (Short Paper)Araújo, João / Chow, Choiwah / Janota, Mikoláš et al. | 2021
- 5
-
Improving Local Search for Structured SAT Formulas via Unit Propagation Based Construct and Cut Initialization (Short Paper)Cai, Shaowei / Luo, Chuan / Zhang, Xindi / Zhang, Jian et al. | 2021
- 6
-
Unit Propagation with Stable Watches (Short Paper)Iser, Markus / Balyo, Tomáš et al. | 2021
- 7
-
Towards Better Heuristics for Solving Bounded Model Checking Problems (Short Paper)Kheireddine, Anissa / Renault, Etienne / Baarir, Souheib et al. | 2021
- 8
-
Integrating Tree Decompositions into Decision Heuristics of Propositional Model Counters (Short Paper)Korhonen, Tuukka / Järvisalo, Matti et al. | 2021
- 9
-
Failure Based Variable Ordering Heuristics for Solving CSPs (Short Paper)Li, Hongbo / Yin, Minghao / Li, Zhanshan et al. | 2021
- 10
-
Generating Magical Performances with Constraint Programming (Short Paper)de Azevedo Silveira, Guilherme et al. | 2021
- 11
-
Vehicle Dynamics in Pickup-And-Delivery Problems Using Electric VehiclesAhmadi, Saman / Tack, Guido / Harabor, Daniel / Kilby, Philip et al. | 2021
- 12
-
Building High Strength Mixed Covering Arrays with ConstraintsAnsótegui, Carlos / Ojeda, Jesús / Torres, Eduard et al. | 2021
- 13
-
On How Turing and Singleton Arc Consistency Broke the Enigma CodeAntuori, Valentin / Portoleau, Tom / Rivière, Louis / Hebrard, Emmanuel et al. | 2021
- 14
-
Combining Monte Carlo Tree Search and Depth First Search Methods for a Car Manufacturing Workshop Scheduling ProblemAntuori, Valentin / Hebrard, Emmanuel / Huguet, Marie-José / Essodaigui, Siham / Nguyen, Alain et al. | 2021
- 15
-
Practical Bigraphs via Subgraph IsomorphismArchibald, Blair / Burns, Kyle / McCreesh, Ciaran / Sevegnani, Michele et al. | 2021
- 16
-
The Hybrid Flexible Flowshop with Transportation TimesArmstrong, Eddie / Garraffa, Michele / O'Sullivan, Barry / Simonis, Helmut et al. | 2021
- 17
-
CLR-DRNets: Curriculum Learning with Restarts to Solve Visual Combinatorial GamesBai, Yiwei / Chen, Di / Gomes, Carla P. et al. | 2021
- 18
-
An Interval Constraint Programming Approach for Quasi Capture Tube ValidationBedouhene, Abderahmane / Neveu, Bertrand / Trombettoni, Gilles / Jaulin, Luc / Le Menec, Stéphane et al. | 2021
- 19
-
Exhaustive Generation of Benzenoid Structures Sharing Common PatternsCarissan, Yannick / Hagebaum-Reignier, Denis / Prcovic, Nicolas / Terrioux, Cyril / Varet, Adrien et al. | 2021
- 20
-
Combining VSIDS and CHB Using Restarts in SATCherif, Mohamed Sami / Habet, Djamal / Terrioux, Cyril et al. | 2021
- 21
-
On the Tractability of Explaining Decisions of ClassifiersCooper, Martin C. / Marques-Silva, João et al. | 2021
- 22
-
A Collection of Constraint Programming Models for the Three-Dimensional Stable Matching Problem with Cyclic PreferencesCseh, Ágnes / Escamocher, Guillaume / Genç, Begüm / Quesada, Luis et al. | 2021
- 23
-
Bounds on Weighted CSPs Using Constraint Propagation and Super-ReparametrizationsDlask, Tomáš / Werner, Tomáš / de Givry, Simon et al. | 2021
- 24
-
Parallel Model Counting with CUDA: Algorithm Engineering for Efficient Hardware UtilizationFichte, Johannes K. / Hecher, Markus / Roland, Valentin et al. | 2021
- 25
-
Complications for Computational Experiments from Modern ProcessorsFichte, Johannes K. / Hecher, Markus / McCreesh, Ciaran / Shahab, Anas et al. | 2021
- 26
-
A Job Dispatcher for Large and Heterogeneous HPC Systems Running Modern ApplicationsGalleguillos, Cristian / Kiziltan, Zeynep / Soto, Ricardo et al. | 2021
- 27
-
The Dungeon Variations Problem Using Constraint ProgrammingGlorian, Gaël / Debesson, Adrien / Yvon-Paliot, Sylvain / Simon, Laurent et al. | 2021
- 28
-
Refined Core Relaxation for Core-Guided MaxSAT SolvingIhalainen, Hannes / Berg, Jeremias / Järvisalo, Matti et al. | 2021
- 29
-
A Linear Time Algorithm for the k-Cutset ConstraintIsoart, Nicolas / Régin, Jean-Charles et al. | 2021
- 30
-
A k-Opt Based Constraint for the TSPIsoart, Nicolas / Régin, Jean-Charles et al. | 2021
- 31
-
The Seesaw Algorithm: Function Optimization Using Implicit Hitting SetsJanota, Mikoláš / Morgado, António / Fragoso Santos, José / Manquinho, Vasco et al. | 2021
- 32
-
Reasoning Short Cuts in Infinite Domain Constraint Satisfaction: Algorithms and Lower Bounds for BackdoorsJonsson, Peter / Lagerkvist, Victor / Ordyniak, Sebastian et al. | 2021
- 33
-
Learning TSP Requires Rethinking GeneralizationJoshi, Chaitanya K. / Cappart, Quentin / Rousseau, Louis-Martin / Laurent, Thomas et al. | 2021
- 34
-
SAT Modulo Symmetries for Graph GenerationKirchweger, Markus / Szeider, Stefan et al. | 2021
- 35
-
Counterfactual Explanations via Inverse Constraint ProgrammingKorikov, Anton / Beck, J. Christopher et al. | 2021
- 36
-
Utilizing Constraint Optimization for Industrial Machine Workload BalancingKovács, Benjamin / Tassel, Pierre / Kohlenbrein, Wolfgang / Schrott-Kostwein, Philipp / Gebser, Martin et al. | 2021
- 37
-
Minimizing Cumulative Batch Processing Time for an Industrial Oven Scheduling ProblemLackner, Marie-Louise / Mrkvicka, Christoph / Musliu, Nysret / Walkiewicz, Daniel / Winter, Felix et al. | 2021
- 38
-
Combining Clause Learning and Branch and Bound for MaxSATLi, Chu-Min / Xu, Zhenxing / Coll, Jordi / Manyà, Felip / Habet, Djamal / He, Kun et al. | 2021
- 39
-
Improving Local Search for Minimum Weighted Connected Dominating Set Problem by Inner-Layer Local SearchLi, Bohan / Wang, Kai / Wang, Yiyuan / Cai, Shaowei et al. | 2021
- 40
-
Automatic Generation of Declarative Models For Differential CryptanalysisLibralesso, Luc / Delobel, François / Lafourcade, Pascal / Solnon, Christine et al. | 2021
- 41
-
A Bound-Independent Pruning Technique to Speeding up Tree-Based Complete Search Algorithms for Distributed Constraint Optimization ProblemsLiu, Xiangshuang / Chen, Ziyu / Chen, Dingding / Gao, Junsong et al. | 2021
- 42
-
Data Driven VRP: A Neural Network Model to Learn Hidden Preferences for VRPMandi, Jayanta / Canoy, Rocsildes / Bucarey, Víctor / Guns, Tias et al. | 2021
- 43
-
Statistical Comparison of Algorithm Performance Through Instance SelectionMatricon, Théo / Anastacio, Marie / Fijalkow, Nathanaël / Simon, Laurent / Hoos, Holger H. et al. | 2021
- 44
-
Enabling Incrementality in the Implicit Hitting Set Approach to MaxSAT Under Changing WeightsNiskanen, Andreas / Berg, Jeremias / Järvisalo, Matti et al. | 2021
- 45
-
Solving the Non-Crossing MAPF with CPPeng, Xiao / Solnon, Christine / Simonin, Olivier et al. | 2021
- 46
-
Positive and Negative Length-Bound Reachability ConstraintsQuesada, Luis / Brown, Kenneth N. et al. | 2021
- 47
-
Evaluating the Hardness of SAT Instances Using Evolutionary Optimization AlgorithmsSemenov, Alexander / Chivilikhin, Daniil / Pavlenko, Artem / Otpuschennikov, Ilya / Ulyantsev, Vladimir / Ignatiev, Alexey et al. | 2021
- 48
-
Optimising Training for Service DeliverySenthooran, Ilankaikone / Le Bodic, Pierre / Stuckey, Peter J. et al. | 2021
- 49
-
Human-Centred Feasibility RestorationSenthooran, Ilankaikone / Klapperstueck, Matthias / Belov, Gleb / Czauderna, Tobias / Leo, Kevin / Wallace, Mark / Wybrow, Michael / de la Banda, Maria Garcia et al. | 2021
- 50
-
SAT-Based Approach for Learning Optimal Decision Trees with Non-Binary FeaturesShati, Pouya / Cohen, Eldan / McIlraith, Sheila et al. | 2021
- 51
-
Pseudo-Boolean Optimization by Implicit Hitting SetsSmirnov, Pavel / Berg, Jeremias / Järvisalo, Matti et al. | 2021
- 52
-
An Algorithm-Independent Measure of Progress for Linear Constraint PropagationSofranac, Boro / Gleixner, Ambros / Pokutta, Sebastian et al. | 2021
- 53
-
Differential Programming via OR MethodsSweitzer, Shannon / Kumar, T. K. Satish et al. | 2021
- 54
-
Learning Max-CSPs via Active Constraint AcquisitionTsouros, Dimosthenis C. / Stergiou, Kostas et al. | 2021
- 55
-
Parallelizing a SAT-Based Product ConfiguratorUllmann, Nils Merlin / Balyo, Tomáš / Klein, Michael et al. | 2021
- 56
-
Solution Sampling with Random Table ConstraintsVavrille, Mathieu / Truchet, Charlotte / Prud'homme, Charles et al. | 2021
- 57
-
Making Rigorous Linear Programming Practical for Program AnalysisWang, Tengbin / Chen, Liqian / Chen, Taoqing / Fan, Guangsheng / Wang, Ji et al. | 2021
- 58
-
Engineering an Efficient PB-XOR SolverYang, Jiong / Meel, Kuldeep S. et al. | 2021
- 59
-
Automated Random Testing of Numerical Constrained TypesZiat, Ghiles / Dien, Matthieu / Botbol, Vincent et al. | 2021
- 60
-
The Effect of Asynchronous Execution and Message Latency on Max-SumZivan, Roie / Perry, Omer / Rachmut, Ben / Yeoh, William et al. | 2021