zweidimensionales bewegtes Bild
A complexity-theoretic approach to disproving Connes' Embedding Problem
- Standort
-
Hannover TIB
- Umfang
-
491MB, 01:00:58:28 (unknown)
- Sprache
-
Englisch
- Anmerkungen
-
Audiovisuelles Material
- Erschienen in
-
The Many Faceted Connes Embedding Problem (19w5163) ; (Jan. 2019)
- Ereignis
-
Veröffentlichung
- (wer)
-
Banff International Research Station (BIRS) for Mathematical Innovation and Discovery
- (wann)
-
2019-01-01
- Beteiligte Personen und Organisationen
-
Vidick, Thomas
Ruskai, Mary Beth (Organisation)
Junge, Marius (Organisation)
Palazuelos, Carlos (Organisation)
Paulsen, Vern (Organisation)
- DOI
-
10.5446/57931
- Letzte Aktualisierung
-
04.12.2024, 08:09 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Technische Informationsbibliothek (TIB). Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Technische Informationsbibliothek (TIB). Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- zweidimensionales bewegtes Bild
Beteiligte
- Vidick, Thomas
- Ruskai, Mary Beth (Organisation)
- Junge, Marius (Organisation)
- Palazuelos, Carlos (Organisation)
- Paulsen, Vern (Organisation)
- Banff International Research Station (BIRS) for Mathematical Innovation and Discovery
Entstanden
- 2019-01-01
Ähnliche Objekte (12)
Circuit complexity of group theoretic problems
Measuring linguistic complexity in Chinese: An information-theoretic approach
Problems of unknown complexity : graph isomorphism and Ramsey theoretic numbers
An information-theoretic approach to language complexity: variation in naturalistic corpora
Complexity theoretic lower bounds on cryptographic functions
Complexity-theoretic aspects of expanding cellular automata
Self-embedding and complexity in oral registers
The Poisson embedding approach to the Calderón problem
The model-theoretic complexity of automatic linear orders
Number theoretic methods in cryptography : complexity lower bounds
The model-theoretic complexity of automatic linear orders
The complexity of embedding graphs into binary trees
Circuit complexity of group theoretic problems
Measuring linguistic complexity in Chinese: An information-theoretic approach
Problems of unknown complexity : graph isomorphism and Ramsey theoretic numbers
An information-theoretic approach to language complexity: variation in naturalistic corpora
Complexity theoretic lower bounds on cryptographic functions
Complexity-theoretic aspects of expanding cellular automata
Self-embedding and complexity in oral registers
The Poisson embedding approach to the Calderón problem
The model-theoretic complexity of automatic linear orders
Number theoretic methods in cryptography : complexity lower bounds
The model-theoretic complexity of automatic linear orders
The complexity of embedding graphs into binary trees
Circuit complexity of group theoretic problems
Measuring linguistic complexity in Chinese: An information-theoretic approach
Problems of unknown complexity : graph isomorphism and Ramsey theoretic numbers
An information-theoretic approach to language complexity: variation in naturalistic corpora
Complexity theoretic lower bounds on cryptographic functions
Complexity-theoretic aspects of expanding cellular automata
Self-embedding and complexity in oral registers
The Poisson embedding approach to the Calderón problem
The model-theoretic complexity of automatic linear orders
Number theoretic methods in cryptography : complexity lower bounds
The model-theoretic complexity of automatic linear orders