zweidimensionales bewegtes Bild
Complexity of controlled bad sequences over finite sets of $\mathbb{N}^d$: Q/A Session A - Paper A5.E
- Standort
-
Hannover TIB
- Umfang
-
30MB, 00:20:49:03 (unknown)
- Sprache
-
Englisch
- Anmerkungen
-
Audiovisuelles Material
- Erschienen in
-
Thirty-Fifth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2020 ; (Jan. 2020)
- Ereignis
-
Veröffentlichung
- (wer)
-
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
- (wann)
-
2020-01-01
- Beteiligte Personen und Organisationen
-
Balasubramanian, A. R.
- DOI
-
10.5446/49276
- 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
- Balasubramanian, A. R.
- Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
Entstanden
- 2020-01-01
Ähnliche Objekte (12)
On polynomial recursive sequences: Q/A Session A - Paper A4.C
Rational complexity of binary sequences, F ℚ $\mathbb Q}$ SRs, and pseudo-ultrametric continued fractions in ℝ $\mathbb R}$
Efficient Analysis of VASS Termination Complexity: Q/A Session A - Paper A5.C
The Complexity of Dynamic Data Race Prediction: Q/A Session E - Paper E6.E
Descriptive complexity on non-Polish spaces II: Q/A Session C - Paper C4.F
On the Fine-Grained Complexity of Parity Problems: Q/A Session E - Paper E3.D
The Power of Many Samples in Query Complexity: Q/A Session D - Paper D2.C
The complexity of knapsack problems in wreath products: Q/A Session E - Paper E4.B
Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity: Q/A Session C - Paper C2.C
Computational Complexity of the α-Ham-Sandwich Problem: Q/A Session C - Paper C3.E
Panel Session Day Two: Q&A
Quantum Distributed Complexity of Set Disjointness on a Line: Q/A Session D - Paper D3.D
On polynomial recursive sequences: Q/A Session A - Paper A4.C
Rational complexity of binary sequences, F ℚ $\mathbb Q}$ SRs, and pseudo-ultrametric continued fractions in ℝ $\mathbb R}$
Efficient Analysis of VASS Termination Complexity: Q/A Session A - Paper A5.C
The Complexity of Dynamic Data Race Prediction: Q/A Session E - Paper E6.E
Descriptive complexity on non-Polish spaces II: Q/A Session C - Paper C4.F
On the Fine-Grained Complexity of Parity Problems: Q/A Session E - Paper E3.D
The Power of Many Samples in Query Complexity: Q/A Session D - Paper D2.C
The complexity of knapsack problems in wreath products: Q/A Session E - Paper E4.B
Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity: Q/A Session C - Paper C2.C
Computational Complexity of the α-Ham-Sandwich Problem: Q/A Session C - Paper C3.E
Panel Session Day Two: Q&A
Quantum Distributed Complexity of Set Disjointness on a Line: Q/A Session D - Paper D3.D
On polynomial recursive sequences: Q/A Session A - Paper A4.C
Rational complexity of binary sequences, F ℚ $\mathbb Q}$ SRs, and pseudo-ultrametric continued fractions in ℝ $\mathbb R}$
Efficient Analysis of VASS Termination Complexity: Q/A Session A - Paper A5.C
The Complexity of Dynamic Data Race Prediction: Q/A Session E - Paper E6.E
Descriptive complexity on non-Polish spaces II: Q/A Session C - Paper C4.F
On the Fine-Grained Complexity of Parity Problems: Q/A Session E - Paper E3.D
The Power of Many Samples in Query Complexity: Q/A Session D - Paper D2.C
The complexity of knapsack problems in wreath products: Q/A Session E - Paper E4.B
Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity: Q/A Session C - Paper C2.C
Computational Complexity of the α-Ham-Sandwich Problem: Q/A Session C - Paper C3.E
Panel Session Day Two: Q&A