LOWER BOUND FOR THE NUMBER OF STATES OF PURPOSEFUL DETERMINISTIC AUTOMATA.

被引：0
|
作者：
Boiko, A.N.
机构：
来源：
| 1600年 / 20期
关键词：
COMPLEXITY;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 3 条
  • [1] A Lower Bound for Learning Distributions Generated by Probabilistic Automata
    Balle, Borja
    Castro, Jorge
    Gavalda, Ricard
    ALGORITHMIC LEARNING THEORY, ALT 2010, 2010, 6331 : 179 - 193
  • [2] EXPONENTIAL LOWER BOUND FOR THE LATEST DETERMINISTIC STRATEGY ITERATION ALGORITHMS
    Friedmann, Oliver
    LOGICAL METHODS IN COMPUTER SCIENCE, 2011, 7 (03)
  • [3] A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization
    Chakrabarty, Deeparnab
    Chen, Yu
    Khanna, Sanjeev
    2021 IEEE 62ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2021), 2022, : 37 - 48
1