Cs-Cc
New Lower Bounds for Matching Vector Codes
Sub-Linear Root Detection, and New Hardness Results, for Sparse Polynomials Over Finite Fields
Homomorphic Hashing for Sparse Coefficient Extraction
Effective de Rham Cohomology - The General Case
Information Complexity versus Corruption and Applications to Orthogonality and Gap-Hamming
Algorithm to Compute Squares of 1st N Natural Numbers Without Using Multiplication
Parameters of Two-Prover-One-Round Game and The Hardness of Connectivity Problems
Superlinear lower bounds for multipass graph processing
Complexity fits the fittest
Meditations on Quantified Constraint Satisfaction
Descriptive complexity for pictures languages (extended abstract)
Phase transition for cutting-plane approach to vertex-cover problem
On Approximation Lower Bounds for TSP with Bounded Metrics
On Quantification of Anchor Placement
Turing-equivalent automata using a fixed-size quantum memory
On groups that have normal forms computable in logspace
Simulating Special but Natural Quantum Circuits
A direct product theorem for bounded-round public-coin randomized communication complexity
A New Order-theoretic Characterisation of the Polytime Computable Functions
Social Influence as a Voting System: a Complexity Analysis of Parameters and Properties
Fuel Efficient Computation in Passive Self-Assembly
Graph Operations on Parity Games and Polynomial-Time Algorithms
