#### Filter Results:

- Full text PDF available (22)

#### Publication Year

2010

2018

- This year (4)
- Last 5 years (22)
- Last 10 years (26)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Dmitry Chistikov, Rayna Dimitrova, Rupak Majumdar
- Acta Informatica
- 2015

#SMT, or model counting for logical theories, is a well-known hard problem that generalizes such tasks as counting the number of satisfying assignments to a Boolean formula and computing the volumeâ€¦ (More)

Nonnegative matrix factorization (NMF) is the problem of decomposing a given nonnegative n Ã— m matrix M into a product of a nonnegative nÃ—d matrix W and a nonnegative dÃ—m matrix H. NMF has a wideâ€¦ (More)

- Dmitry Chistikov, Christoph Haase
- ICALP
- 2016

Semi-linear sets, which are rational subsets of the monoid (Z,+), have numerous applications in theoretical computer science. Although semi-linear sets are usually given implicitly, by formulas inâ€¦ (More)

- Dmitry Chistikov, Christoph Haase, Simon Halfon
- Theor. Comput. Sci.
- 2018

We study the computational complexity of reachability, coverability and inclusion for extensions of context-free commutative grammars with integer counters and reset operations on them. Thoseâ€¦ (More)

- Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar
- FoSSaCS
- 2016

We show that any one-counter automaton with n states, if its language is non-empty, accepts some word of length at most O(n). This closes the gap between the previously known upper bound of O(n) andâ€¦ (More)

Nonnegative matrix factorization (NMF) is the problem of decomposing a given nonnegative n Ã— m matrix M into a product of a nonnegative n Ã— d matrix W and a nonnegative d Ã— m matrix H. Restricted NMFâ€¦ (More)

- Dmitry Chistikov
- FSTTCS
- 2014

We determine the descriptional complexity (smallest number of states, up to constant factors) of recognizing languages {1} and {1 : t = 0, 1, 2, . . .} with state-based finite machines of variousâ€¦ (More)

- Dmitry Chistikov, Valentina Fedorova, Andrei A. Voronenko
- Fundam. Inform.
- 2014

A certificate of non-membership for a Boolean function f with respect to a class C, f 6âˆˆ C, is a set S of input strings such that the values of f on strings from S are inconsistent with any functionâ€¦ (More)

Nonnegative matrix factorization (NMF) is the problem of decomposing a given nonnegative n Ã— m matrix M into a product of a nonnegative n Ã— d matrix W and a nonnegative d Ã— m matrix H. A longstandingâ€¦ (More)

- Dmitry Chistikov, Szabolcs IvÃ¡n, Anna Lubiw, Jeffrey Shallit
- STACS
- 2017

A rectifier network is a directed acyclic graph with distinguished sources and sinks; it is said to compute a Boolean matrix M that has a 1 in the entry (i, j) iff there is a path from the jth sourceâ€¦ (More)