4 citations · 5 across the 4 of their papers we have counts for
4 papers
On the Range of the Permanent of -Matrices
DeVon Ingram, Alexander Razborov
We establish a superpolynomial lower bound on the range of the permanent function on the set of matrices with entries.
On Domination Exponents for Pairs of Graphs
Grigoriy Blekherman, Annie Raymond, Alexander Razborov +1
Understanding graph density profiles is notoriously challenging. Even for pairs of graphs, complete characterizations are known only in very limited cases, such as edges versus cli…
More about sparse halves in triangle-free graphs
Alexander Razborov
One of Erdos's conjectures states that every triangle-free graph on vertices has an induced subgraph on vertices with at most edges. We report several partial re…
On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution
Jakob Nordström, Alexander Razborov
In the context of proving lower bounds on proof space in k-DNF resolution, [Ben-Sasson and Nordstrom 2009] introduced the concept of minimally unsatisfiable sets of k-DNF formulas…