- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
Revisiting and improving algorithms for the 3XOR problem ; volume:2018 ; number:1 ; pages:254-276
IACR transactions on symmetric cryptology ; 2018, Heft 1, 254-276
- Classification
-
Informatik
- Creator
-
Bouillaguet, Charles
Delaplace, Claire
Fouque, Pierre-Alain
- DOI
-
10.13154/tosc.v2018.i1.254-276
- URN
-
urn:nbn:de:hbz:294-ToSC-908
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:32 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Bouillaguet, Charles
- Delaplace, Claire
- Fouque, Pierre-Alain
Other Objects (12)
Algorithms for packing problems
Algorithms for reachability problems
Algorithms for Packing Problems
Improving two-layer encoding of evolutionary algorithms for sparse large-scale multiobjective optimization problems
Improving predictions of tree structured algorithms
Approximation algorithms for layout problems
Algorithms for the satisfiability problem
Revisiting the minimum-norm problem
Revisiting jet clustering algorithms for new Higgs Boson searches in hadronic final states
Algorithms for Improving the Predictive Power of Flux Balance Analysis
Algorithms for improving the design and production of oligonucleotide microarrays
Bi-Level optimization algorithms for improving genome-scale metabolic models
Algorithms for packing problems
Algorithms for reachability problems
Algorithms for Packing Problems
Improving two-layer encoding of evolutionary algorithms for sparse large-scale multiobjective optimization problems
Improving predictions of tree structured algorithms
Approximation algorithms for layout problems
Algorithms for the satisfiability problem
Revisiting the minimum-norm problem
Revisiting jet clustering algorithms for new Higgs Boson searches in hadronic final states
Algorithms for Improving the Predictive Power of Flux Balance Analysis
Algorithms for improving the design and production of oligonucleotide microarrays
Bi-Level optimization algorithms for improving genome-scale metabolic models
Algorithms for packing problems
Algorithms for reachability problems
Algorithms for Packing Problems
Improving two-layer encoding of evolutionary algorithms for sparse large-scale multiobjective optimization problems
Improving predictions of tree structured algorithms
Approximation algorithms for layout problems
Algorithms for the satisfiability problem
Revisiting the minimum-norm problem
Revisiting jet clustering algorithms for new Higgs Boson searches in hadronic final states
Algorithms for Improving the Predictive Power of Flux Balance Analysis
Algorithms for improving the design and production of oligonucleotide microarrays