Anastasia Sofronova
From MaRDI portal
Person:2084955
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Searching for falsified clause in random ( n)-CNFs is hard for randomized communication | 2026-09-11 | Paper |
| A lower bound for k-DNF resolution on random CNF formulas via expansion | 2026-07-14 | Paper |
| Top-down lower bounds for depth-four circuits | 2025-08-15 | Paper |
| Monotone Circuit Complexity of Matching (available as arXiv preprint) | 2025-01-01 | Paper |
| A better-than-3(n) Depth lower bound for De Morgan formulas with restrictions on top gates | 2024-07-05 | Paper |
| Bounded-depth Frege complexity of Tseitin formulas for all graphs Annals of Pure and Applied Logic | 2022-10-14 | Paper |
| Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs | 2022-07-21 | Paper |
Research outcomes over time
This page was built for person: Anastasia Sofronova
