![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Theoretical Computer Science, Volume 762
Volume 762, March 2019
- Kun He, Qian Li, Xiaoming Sun
:
A tighter relation between sensitivity complexity and certificate complexity. 1-12 - Rostam Sabeti:
Polynomial expressions for non-binomial structures. 13-24 - Akinori Kawachi, Mitsunori Ogihara
, Kei Uchizawa:
Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs. 25-40 - Petr Kucera
, Petr Savický, Vojtech Vorel:
A lower bound on CNF encodings of the at-most-one constraint. 51-73
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.