#### Filter Results:

- Full text PDF available (17)

#### Publication Year

2006

2018

- This year (5)
- Last 5 years (24)
- Last 10 years (26)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Yevgeniy Dodis, Chaya Ganesh, Alexander Golovnev, Ari Juels, Thomas Ristenpart
- EUROCRYPT
- 2015

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)â€¦ (More)

- Ivan Bliznets, Alexander Golovnev
- IPEC
- 2012

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.â€¦ (More)

- Alexander Golovnev, Oded Regev, Omri Weinstein
- APPROX-RANDOM
- 2016

The minrank of a graph G is the minimum rank of a matrix M that can be obtained from the adjacency matrix of G by switching ones to zeros (i.e., deleting edges) and setting all diagonal entries toâ€¦ (More)

- Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz
- 2017 IEEE 58th Annual Symposium on Foundations ofâ€¦
- 2017

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â€¦ (More)

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â€¦ (More)

The best known approximation ratio for the shortest superstring problem is 2 11 23 (Mucha, 2012). In this note, we improve this bound for the case when the length of all input strings is equal to r,â€¦ (More)

- Alexander Golovnev, Konstantin Kutzkov
- Theor. Comput. Sci.
- 2014

Many optimization problems can be phrased in terms of constraint satisfaction. In particular MAX-2SAT and MAX-2-CSP are known to generalize many hard combinatorial problems on graphs. Algorithmsâ€¦ (More)

- Magnus Find, Alexander Golovnev, Edward A. Hirsch, Alexander S. Kulikov
- 2016 IEEE 57th Annual Symposium on Foundations ofâ€¦
- 2015

We consider Boolean circuits over the full binary basis. We prove a (3+1/86)n-o(n) lower bound on the size of such a circuit for an explicitly defined predicate, namely an affine disperser forâ€¦ (More)

Most of the known lower bounds for binary Boolean circuits with unrestricted depth are proved by the gate elimination method. The most efficient known algorithms for the #SAT problem on binaryâ€¦ (More)

- Marek Cygan, Fedor V. Fomin, +4 authors Arkadiusz Socala
- J. ACM
- 2017

We prove that unless the Exponential Time Hypothesis (ETH) fails, deciding if there is a homomorphism from graph <i>G</i> to graph <i>H</i> cannot be done in timeâ€¦ (More)