Hallmark
发表于 2025-4-1 02:41:38
http://reply.papertrans.cn/24/2338/233762/233762_61.png
MULTI
发表于 2025-4-1 06:32:13
Kleene algebra with tests: Completeness and decidability,h tests and-continuous Kleene algebra with tests over language-theoretic and relational models. We also show decidability. Cohen‘s reduction of Kleene algebra with hypotheses of the form .=0 to Kleene algebra without hypotheses is simplified and extended to handle Kleene algebras with tests.
不感兴趣
发表于 2025-4-1 12:39:26
Optimization problems with approximation schemes, more general definability theory of optimization problems. We define a class . φ and show that every problem in this class has a . (FPTAS), i.e., can be approximated to every desired accuracy . in time polynomial in the size of the input and 1/.. An example for a problem in . φ is ..