A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
A New Approach to Count Pattern Motifs Using Combinatorial Techniches
A New Approach to Formal Language Theory by Kolmogorov Complexity
A new function algebra of EXPTIME functions by safe nested recursion
A New Look at Survey Propagation and its Generalizations
A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover
A New Order-theoretic Characterisation of the Polytime Computable Functions
A new point of NP-hardness for 2-to-1 Label Cover
A New Reduction from Search SVP to Optimization SVP
A new sibling of BQP
A New Structural Property of SAT
A non-expert view on Turing machines, Proof Verifiers, and Mental reasoning
A Non-Triviality Certificate for Scalars and its application to Linear Systems
A note about a partial no-go theorem for quantum PCP
A Note on Bulk Quantum Turing Machine
A note on dimensions of polynomial size circuits
A Note on Mathematical Modelling of Practical Multicampaign Assignment and Its Computational Complexity
A Note on Nonuniform versus Uniform ACC^k Circuits for NE
A Note on the Balanced ST-Connectivity
A Note on the Complexity of Computing the Smallest Four-Coloring of Planar Graphs