- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Deutsch
- Notes
-
Bayreuth, Univ., Diss., 2005
- Keyword
-
Geometrische Kombinatorik ; Kombinatorik
- Creator
- URN
-
urn:nbn:de:bvb:703-opus-1933
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:30 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.
Object type
- Hochschulschrift
Associated
Other Objects (12)
Counting polyominoes with minimum perimeter
Are weighted games sufficiently good for binary voting?
Upper bounds for partial spreads
On the characteristic of integral point sets in E_hnm
Integral point sets over finite fields
Computer classification of linear codes based on lattice point enumeration and integer linear programming
Heden's bound on the tail of a vector space partition
Bounds for flag codes
Which criteria qualify power indices for applications? : A comment to "The story of the poor Public Good index"
The power of the largest player
Heden's bound on the tail of a vector space partition
Bounds for flag codes
Counting polyominoes with minimum perimeter
Are weighted games sufficiently good for binary voting?
Upper bounds for partial spreads
On the characteristic of integral point sets in E_hnm
Integral point sets over finite fields
Computer classification of linear codes based on lattice point enumeration and integer linear programming
Heden's bound on the tail of a vector space partition
Bounds for flag codes
Which criteria qualify power indices for applications? : A comment to "The story of the poor Public Good index"
The power of the largest player
Heden's bound on the tail of a vector space partition
Bounds for flag codes
Counting polyominoes with minimum perimeter
Are weighted games sufficiently good for binary voting?
Upper bounds for partial spreads
On the characteristic of integral point sets in E_hnm
Integral point sets over finite fields
Computer classification of linear codes based on lattice point enumeration and integer linear programming
Heden's bound on the tail of a vector space partition
Bounds for flag codes
Which criteria qualify power indices for applications? : A comment to "The story of the poor Public Good index"
The power of the largest player
Heden's bound on the tail of a vector space partition