The following pages link to Alexander Golovnev (Q1635508):
Displayed 35 items.
- On the limits of gate elimination (Q1635510) (← links)
- Gate elimination: circuit size lower bounds and \#SAT upper bounds (Q1704573) (← links)
- New exact algorithms for the 2-constraint satisfaction problem (Q2437759) (← links)
- Solving SCS for bounded length strings in fewer than \(2^n\) steps (Q2448115) (← links)
- Weighted Gate Elimination (Q2800589) (← links)
- Solving 3-Superstring in 3 n/3 Time (Q2849936) (← links)
- New Upper Bounds for MAX-2-SAT and MAX-2-CSP w.r.t. the Average Variable Degree (Q2891341) (← links)
- A Formal Treatment of Backdoored Pseudorandom Generators (Q2948325) (← links)
- Lower Bounds for the Graph Homomorphism Problem (Q3448809) (← links)
- Condensed Unpredictability (Q3448859) (← links)
- The Minrank of Random Graphs (Q4559572) (← links)
- Tight Bounds for Graph Homomorphism and Subgraph Isomorphism (Q4575696) (← links)
- Circuit Size Lower Bounds and #SAT Upper Bounds Through a General Framework (Q4608607) (← links)
- On the Limits of Gate Elimination (Q4608608) (← links)
- Tight Lower Bounds on Graph Embedding Problems (Q4640290) (← links)
- A New Algorithm for Parameterized MAX-SAT (Q4899239) (← links)
- Approximating Shortest Superstring Problem Using de Bruijn Graphs (Q4928566) (← links)
- Families with Infants (Q4962612) (← links)
- The minrank of random graphs (Q5002652) (← links)
- (Q5060749) (← links)
- Polynomial Data Structure Lower Bounds in the Group Model (Q5067444) (← links)
- (Q5091223) (← links)
- Data structures meet cryptography: 3SUM with preprocessing (Q5144917) (← links)
- Families with Infants: A General Approach to Solve Hard Partition Problems (Q5167772) (← links)
- APPROXIMATING ASYMMETRIC TSP IN EXPONENTIAL TIME (Q5168426) (← links)
- Static data structure lower bounds imply rigidity (Q5212837) (← links)
- Collapsing Superstring Conjecture (Q5875478) (← links)
- String Matching: Communication, Circuits, and Learning. (Q5875515) (← links)
- Linear space streaming lower bounds for approximating CSPs (Q6083484) (← links)
- Worst-case to average-case reductions via additive combinatorics (Q6083612) (← links)
- The (generalized) orthogonality dimension of (generalized) kneser graphs: bounds and applications (Q6115359) (← links)
- Revisiting time-space tradeoffs for function inversion (Q6145922) (← links)
- (Q6147364) (← links)
- Improving \(3N\) circuit complexity lower bounds (Q6184294) (← links)
- The (Generalized) Orthogonality Dimension of (Generalized) Kneser Graphs: Bounds and Applications (Q6335187) (← links)