| 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. |
| 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 |
| A Secure Three-Input AND Protocol with a Standard Deck of Minimal Cards
|
2021 |
Koyama, Hiroto |
| On Closed-Rich Words
|
2021 |
Parshina, Olga |
| On Rooted k-Connectivity Problems in Quasi-bipartite Digraphs
|
2021 |
Nutov, Zeev |
| Shelah-Stupp’s and Muchnik’s Iterations Revisited
|
2021 |
Paryvs, Pawet |
| On Separation Between the Degree of a Boolean Function and the Block Sensitivity
|
2021 |
Proskurin, Nikolav V. |
| Variants of the Determinant Polynomial and the VP-Completeness
|
2021 |
Chaugule, Prasad |
Tag hinzufügen