| 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 |
| Lower Bounds and Hardness Magnification for Sublinear-Time Shrinking Cellular Automata
|
2021 |
Modanese, Augusto |
| Approximation and Complexity of the Capacıtated Geometric Median Problem
|
2021 |
Shenmaier, Vladimir |
| A Generalization of a Theorem of Rothschild and van Lint
|
2021 |
Xie, Ning |
| 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. |
Tag hinzufügen