The following pages link to Dmitry Chistikov (Q1683926):
Displayed 37 items.
- Item:Q1683926 (redirect page) (← links)
- Using relevance queries for identification of read-once functions (Q376140) (← links)
- Some test length bounds for nonrepeating functions in the \(\{ \& , \vee \}\) basis (Q616569) (← links)
- Learning read once functions using subcube parity queries (Q694278) (← links)
- Approximate counting in SMT and value estimation for probabilistic programs (Q1683928) (← links)
- Read-once functions with hard-to-test projections (Q1759104) (← links)
- Testing read-once functions over the elementary basis (Q1759130) (← links)
- Iterated Boolean functions in the elementary basis (Q1759196) (← links)
- Context-free commutative grammars with integer counters and resets (Q2636518) (← links)
- Synchronizing Automata over Nested Words (Q2811343) (← links)
- Shortest Paths in One-Counter Systems (Q2811358) (← links)
- Checking Tests for Read-Once Functions over Arbitrary Bases (Q2907486) (← links)
- Certificates of Non-Membership for Classes of Read-Once Functions (Q2934873) (← links)
- (Q2978526) (← links)
- On the relationship between diagnostic and checking tests of the read-once functions (Q3004818) (← links)
- (Q3013165) (← links)
- Testing Monotone Read-Once Functions (Q3111645) (← links)
- On Rationality of Nonnegative Matrix Factorization (Q4575827) (← links)
- (Q4598244) (← links)
- (Q4598270) (← links)
- Hitting Families of Schedules for Asynchronous Programs (Q4633553) (← links)
- The complexity of regular abstractions of one-counter languages (Q4635876) (← links)
- Fractional coverings, greedy coverings, and rectifier networks (Q4636621) (← links)
- O-Minimal Invariants for Discrete-Time Dynamical Systems (Q5002799) (← links)
- (Q5089308) (← links)
- (Q5094125) (← links)
- (Q5111426) (← links)
- Re-pairing brackets (Q5145644) (← links)
- Globe-hopping (Q5160980) (← links)
- Unary Pushdown Automata and Straight-Line Programs (Q5167834) (← links)
- Approximate Counting in SMT and Value Estimation for Probabilistic Programs (Q5194954) (← links)
- Nonnegative Matrix Factorization Requires Irrationality (Q5283249) (← links)
- A Uniformization Theorem for Nested Word to Word Transductions (Q5327486) (← links)
- (Q5875371) (← links)
- Bisimilarity distances for approximate differential privacy (Q6109589) (← links)
- Quantifier elimination for counting extensions of Presburger arithmetic (Q6181930) (← links)
- Rational subsets of Baumslag-Solitar groups (Q6343401) (← links)