- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1420-8954
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
On sets of linear forms of maximal complexity ; volume:32 ; number:1 ; day:29 ; month:11 ; year:2022 ; pages:1-26 ; date:6.2023
Computational complexity ; 32, Heft 1 (29.11.2022), 1-26, 6.2023
- Urheber
-
Kaminski, Michael
Shparlinski, Igor E.
Waldschmidt, Michel
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00037-022-00234-5
- URN
-
urn:nbn:de:101:1-2023020921004533215982
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:48 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Kaminski, Michael
- Shparlinski, Igor E.
- Waldschmidt, Michel
- SpringerLink (Online service)
Ähnliche Objekte (12)
![Γ-maximal [Gamma-maximal] sets](/assets/placeholder/searchResultMediaNoDigitisedMedia.png)
Γ-maximal [Gamma-maximal] sets
Complexity of Secure Sets
r-Maximal Sets
On the complexity of minimum maximal acyclic matchings
Existence of symmetric maximal noncrossing collections of k-element sets
Maximale Schrittzahl bei linearen Programmen
On the Computational Complexity of Linear Discrepancy
Complexity of linear relaxations in integer programming
On the Complexity of Recognizing Nerves of Convex Sets
Maximal integral point sets over Z2
On the Parameterized Complexity of Compact Set Packing
Diffeomorphisms between Sets of Linear Systems
Γ-maximal [Gamma-maximal] sets
Complexity of Secure Sets
r-Maximal Sets
On the complexity of minimum maximal acyclic matchings
Existence of symmetric maximal noncrossing collections of k-element sets
Maximale Schrittzahl bei linearen Programmen
On the Computational Complexity of Linear Discrepancy
Complexity of linear relaxations in integer programming
On the Complexity of Recognizing Nerves of Convex Sets
Maximal integral point sets over Z2
On the Parameterized Complexity of Compact Set Packing
Diffeomorphisms between Sets of Linear Systems
Γ-maximal [Gamma-maximal] sets
Complexity of Secure Sets
r-Maximal Sets
On the complexity of minimum maximal acyclic matchings
Existence of symmetric maximal noncrossing collections of k-element sets
Maximale Schrittzahl bei linearen Programmen
On the Computational Complexity of Linear Discrepancy
Complexity of linear relaxations in integer programming
On the Complexity of Recognizing Nerves of Convex Sets
Maximal integral point sets over Z2
On the Parameterized Complexity of Compact Set Packing