- Sprache
-
Englisch
- Identifier
-
1251949746
- Reihe
-
Angewandte Mathematik und Informatik, Universität zu Köln; Report No. 95.190
Beteiligte Personen und Organisationen
Wambach, Georg
Wettig, Hannes
Wettig, Hannes
- URN
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
26.01.2023, 13:55 MEZ
Objekttyp
- Monografie
Beteiligte
- Wambach, Georg
- Wettig, Hannes
Ähnliche Objekte (12)
The True Minimum Distance of Some Narrow-Sense BCH-Codes of Length 255
On Derandomized Approximation Algorithms
A fast 0(n) Embedding Algorithm, based on the Hopcroft-Tarjan Planary Test
Solving large-scale traveling salesman problems with parallel Branch-and-Cut
Integer Multicommodity Flows with Reduced Demands
Provably good solutions for the traveling salesman problem
On block matrices of pascal type in Clifford analysis
Structural Design and Analysis of Low-Density Parity-Check Codes and Systematic Repeat-Accumulate Codes
Derivation of graph and pointer algorithms
Algebraic calculation of graph and sorting algorithms
Benchmarking of Optimization Algorithms
Non-linear analysis of shells of revolution using mathematical optimisation
The True Minimum Distance of Some Narrow-Sense BCH-Codes of Length 255
On Derandomized Approximation Algorithms
A fast 0(n) Embedding Algorithm, based on the Hopcroft-Tarjan Planary Test
Solving large-scale traveling salesman problems with parallel Branch-and-Cut
Integer Multicommodity Flows with Reduced Demands
Provably good solutions for the traveling salesman problem
On block matrices of pascal type in Clifford analysis
Structural Design and Analysis of Low-Density Parity-Check Codes and Systematic Repeat-Accumulate Codes
Derivation of graph and pointer algorithms
Algebraic calculation of graph and sorting algorithms
Benchmarking of Optimization Algorithms
Non-linear analysis of shells of revolution using mathematical optimisation
The True Minimum Distance of Some Narrow-Sense BCH-Codes of Length 255
On Derandomized Approximation Algorithms
A fast 0(n) Embedding Algorithm, based on the Hopcroft-Tarjan Planary Test
Solving large-scale traveling salesman problems with parallel Branch-and-Cut
Integer Multicommodity Flows with Reduced Demands
Provably good solutions for the traveling salesman problem
On block matrices of pascal type in Clifford analysis
Structural Design and Analysis of Low-Density Parity-Check Codes and Systematic Repeat-Accumulate Codes
Derivation of graph and pointer algorithms
Algebraic calculation of graph and sorting algorithms
Benchmarking of Optimization Algorithms