A Generalization of a Theorem of Rothschild and van Lint

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International Computer Science Symposium (16. : 2021 : Online) Computer Science - Theory and Applications
1. Verfasser: Xie, Ning (VerfasserIn)
Weitere Verfasser: Xu, Shuai (VerfasserIn), Xu, Yekun (VerfasserIn)
Format: UnknownFormat
Sprache:eng
Veröffentlicht: 2021
Schlagworte:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Titel Jahr Verfasser
Injective Colouring for H-Free Graphs 2021 Bok, Jan
Real t-Conjecture for Sum-of-Squares: A Unified Approach to Lower Bound and Derandomization 2021 Dutta, Pranjal
Approximation Schemes for Multiperiod Binary Knapsack Problems 2021 Gao, Zuguang
Average-Case Rigidity Lower Bounds 2021 Huang, Xuangui
Bit-Complexity of Solving Systems of Linear Evolutionary Partial Differential Equations 2021 Koswara, Ivan
Upper Bound for Torus Polynomials 2021 Krishan, Vaibhav
A PCP of Proximity for Real Algevraic Folynomials 2021 Meer, Klaus
Approximation Algorithms for Connectivity Augmentation Problems 2021 Nutov, Zeev
Large Clique is Hard on Average for Resolution 2021 Pang, Shuo
Input-Driven Pushdown Automata on Weil-Nested Infinite Strings 2021 Okhotin, Alexander
A Generic Convolution Algorithm for Join Operations on Tree Decompositions 2021 Rootj, Johan M. M.
Variants of the Determinant Polynomial and the VP-Completeness 2021 Chaugule, Prasad
Computational Complexity of Multi-player Evolutionarily Stable Strategies 2021 Blanc, Manon
Dynamic Complexity of Expansion 2021 Datta, Samir
Limitations of Sums of Bounded Read Formulas and ABPs 2021 Ghosal, Purnata
Upper Bounds on Communication in Terms of Approximate Rank 2021 Gál, Anna
Predictions and Algorithmic Statistics for infinite Sequences 2021 Milovanov, Alexey
Dichotomy Result on 3-Regular Bipartite Non-negative Functions 2021 Fan, Austen Z.
On the Computational Complexity of Reaction Systems, Revisited 2021 Holzer, Markus
Analysis of an Efficient Reduction Algorithm for Random Regular Expressions Based on Universality Detection 2021 Koechlin, Florent
Alle Artikel auflisten