The following pages link to Alexander S. Kulikov (Q1625134):
Displaying 49 items.
- On convex complexity measures (Q964405) (← links)
- New upper bounds on the Boolean circuit complexity of symmetric functions (Q991778) (← links)
- (Q1025966) (redirect page) (← links)
- On covering graphs by complete bipartite subgraphs (Q1025967) (← links)
- Lower bounds for unrestricted Boolean circuits: open problems (Q1625135) (← links)
- On the limits of gate elimination (Q1635510) (← links)
- Parameterized complexity of superstring problems (Q1679230) (← links)
- Gate elimination: circuit size lower bounds and \#SAT upper bounds (Q1704573) (← links)
- Computing majority by constant depth majority circuits with low fan-in gates (Q2321926) (← links)
- New lower bounds on circuit size of multi-output functions (Q2354591) (← links)
- Parameterized complexity of secluded connectivity problems (Q2408560) (← links)
- Solving SCS for bounded length strings in fewer than \(2^n\) steps (Q2448115) (← links)
- An upper bound \(O(2^{0.16254n})\) for exact 3-satisfiability: a simpler proof (Q2577590) (← links)
- A \(2^{|E|/4}\)-time algorithm for MAX-CUT (Q2577592) (← links)
- Weighted Gate Elimination (Q2800589) (← links)
- Solving 3-Superstring in 3 n/3 Time (Q2849936) (← links)
- A 5n − o(n) Lower Bound on the Circuit Size over U 2 of a Linear Boolean Function (Q2904438) (← links)
- Computing All MOD-Functions Simultaneously (Q2907489) (← links)
- Greedy Conjecture for Strings of Length 4 (Q2942268) (← links)
- An Elementary Proof of a 3n − o(n) Lower Bound on the Circuit Complexity of Affine Dispersers (Q3088045) (← links)
- (Q3181643) (← links)
- New upper bounds for the problem of maximal satisfiability (Q3225865) (← links)
- Lower Bounds for the Graph Homomorphism Problem (Q3448809) (← links)
- New Bounds for MAX-SAT by Clause Learning (Q3499776) (← links)
- Circuit Complexity and Multiplicative Complexity of Boolean Functions (Q3576211) (← links)
- A new approach to proving upper bounds for MAX-2-SAT (Q3581524) (← 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)
- Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates (Q4636650) (← links)
- Tight Lower Bounds on Graph Embedding Problems (Q4640290) (← links)
- Approximating Shortest Superstring Problem Using de Bruijn Graphs (Q4928566) (← links)
- Families with Infants (Q4962612) (← links)
- Families with Infants: A General Approach to Solve Hard Partition Problems (Q5167772) (← links)
- Parameterized Complexity of Secluded Connectivity Problems (Q5275383) (← links)
- Parameterized and Exact Computation (Q5311517) (← links)
- (Q5460921) (← links)
- Theory and Applications of Satisfiability Testing (Q5713737) (← links)
- Complexity of Semialgebraic Proofs with Restricted Degree of Falsity (Q5756572) (← links)
- Collapsing Superstring Conjecture (Q5875478) (← links)
- (Q5875578) (← links)
- (Q6075924) (← links)
- Improving \(3N\) circuit complexity lower bounds (Q6184294) (← links)
- Polynomial formulations as a barrier for reduction-based hardness proofs (Q6538655) (← links)
- If Edge Coloring is hard under SETH, then SETH is false (Q6545109) (← links)
- CNF encodings of parity (Q6584048) (← links)
- SAT-based circuit local improvement (Q6584071) (← links)
- CNF encodings of symmetric functions (Q6635697) (← links)
- Computations with polynomial evaluation oracle: ruling out superlinear SETH-based lower bounds (Q6645432) (← links)
