# Alexander Golovnev

- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage your publications. Semantic Scholar automatically creates author pages based on data aggregated from

**public sources and our publisher partners.**We provide a formal treatment of backdoored pseudorandom generators (PRGs). Here a saboteur chooses a PRG instance for which she knows a trapdoor that allows prediction of future (and possibly past)… Expand

We show how to check whether at least k clauses of an input formula in CNF can be satisfied in time O*(1.358k). This improves the bound O*(1.370k) proved by Chen and Kanj more than 10 years ago.… Expand

IEEE 58th Annual Symposium on Foundations of…

For odd integers p ≥ 1 (and p = ∞), we show that the Closest Vector Problem in the ℓp norm (CVP_p) over rank n lattices cannot be solved in 2^(1-≥) n time for any constant… Expand

We prove that unless the Exponential Time Hypothesis (ETH) fails, deciding if there is a homomorphism from graph G to graph H cannot be done in time |V(H)|o(|V(G)|). We also show an exponential-time… Expand

Many optimization problems can be phrased in terms of constraint satisfaction. In particular MAX-2-SAT and MAX-2-CSP are known to generalize many hard combinatorial problems on graphs. Algorithms… Expand

The best known approximation ratio for the shortest superstring problem is \(2\frac{11}{23}\) (Mucha, 2012). In this note, we improve this bound for the case when the length of all input strings is… Expand

The <italic>minrank</italic> of a directed graph <inline-formula> <tex-math notation="LaTeX">$G$ </tex-math></inline-formula> is the minimum rank of a matrix <inline-formula> <tex-math… Expand

We show that static data structure lower bounds in the group (linear) model imply semi-explicit lower bounds on matrix rigidity. In particular, we prove that an explicit lower bound of t ≥ ω(log2 n)… Expand

The graph homomorphism problem (HOM) asks whether the vertices of a given n-vertex graph G can be mapped to the vertices of a given h-vertex graph H such that each edge of G is mapped to an edge of… Expand

Let G be a complete directed graph with n vertices and integer edge weights in range [0,M]. It is well known that an optimal Traveling Salesman Problem (TSP) in G can be solved in 2n time and space… Expand