• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

109028, Moscow,
11, Pokrovsky boulevard

Phone: +7 (495) 531-00-00 *27254

Email: computerscience@hse.ru


First Deputy Dean Tamara Voznesenskaya
Deputy Dean for Research and International Relations Sergei Obiedkov
Deputy Dean for Methodical and Educational Work Ilya Samonenko
Deputy Dean for Development, Finance and Administration Irina Plisetskaya
Convergence rates for empirical barycenters in metric spaces: curvature, convexity and extendable geodesics
In press

Ahidar-Coutrix A., Le Gouic T., Paris Q.

Probability Theory and Related Fields. 2020.

Machine Learning on data with sPlot background subtraction

M. Borisyak, N. Kazeev.

Journal of Instrumentation. 2019. Vol. 14. No. 08. P. 1-8.

Book chapter
Subspace Inference for Bayesian Deep Learning

Vetrov D., Izmailov P., Maddox W. J. et al.

In bk.: Proceedings of the 35th Uncertainty in Artificial Intelligence Conference (UAI-2019). 2019. P. 1-11.

Book chapter
The logic of action lattices is undecidable

Kuznetsov S.

In bk.: 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2019). IEEE, 2019. Ch. 36. P. 1-9.

Colloquium: Laurent Beaudou – "Of Points and Lines: Graphs, Metrics, and Betweenness"

Event ended

November 12, 16:40 – 18:00
Pokrovsky blvd 11, ауд. R205

Jie-Hong Roland Jiang (National Taiwan University)

Some Adventures in Boolean Satisfiability and Its Logic Synthesis Applications

Boolean satisfiability (SAT) is a fundamental NP-complete problem. Its general and simple formulation makes it an ideal problem to tackle. Although SAT is intractable, many efficient solvers have been engineered and widely applied in industries. This talk will introduce some of the key enabling techniques in SAT solving and showcase some applications in logic synthesis.