17 citations · 17 across the 1 of their papers we have counts for
2 papers
cs.DM2026
An upper bound of 4.268 for the random 3-SAT satisfiability threshold
Fedor Vorobyev
We prove that a random 3-SAT formula with variables and clauses is unsatisfiable with high probability. The satisfiability threshold has attracted consi…
cs.IR2024★ 17 cited
Recency Ranking by Diversification of Result Set
Andrey Styskin, Fedor Romanenko, Fedor Vorobyev +1
In this paper, we propose a web search retrieval approach which automatically detects recency sensitive queries and increases the freshness of the ordinary document ranking by a de…