arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1509.03057cs.AIcs.CC
收藏

组合模糊问题的世界与模糊近似算法的有效性

The World of Combinatorial Fuzzy Problems and the Efficiency of Fuzzy Approximation Algorithms

University of Fukui(福井大学)

Tomoyuki Yamakami

摘要:

我们重新审视各种类型的组合模糊问题的实际方面,包括搜索,计数,优化和决策问题。我们只关注那些模糊问题,采取一系列的模糊输入对象和产生模糊值。为了有效地解决这些问题,我们设计了快速模糊算法,这是由多项式时间确定性模糊图灵机配备只读辅助磁带和只写输出磁带建模,也由多项式大小的模糊电路组成的模糊门。我们还介绍了模糊证明验证系统模型的模糊化不确定性。这些模型帮助我们识别四个复杂性类别:模糊函数的Fuzzy-FPA,模糊决策问题的Fuzzy-PA和Fuzzy-NPA,以及模糊优化问题的Fuzzy-NPAO。基于一种以模糊隶属度为目标的相对逼近方案,我们提出了两种“约简”的概念,以比较两个模糊问题的计算复杂性。这些简化概念使得在Fuzzy-NPA和Fuzzy-NPAO中定位最困难的模糊问题成为可能。

英文摘要:

We re-examine a practical aspect of combinatorial fuzzy problems of various types, including search, counting, optimization, and decision problems. We are focused only on those fuzzy problems that take series of fuzzy input objects and produce fuzzy values. To solve such problems efficiently, we design fast fuzzy algorithms, which are modeled by polynomial-time deterministic fuzzy Turing machines equipped with read-only auxiliary tapes and write-only output tapes and also modeled by polynomial-size fuzzy circuits composed of fuzzy gates. We also introduce fuzzy proof verification systems to model the fuzzification of nondeterminism. Those models help us identify four complexity classes: Fuzzy-FPA of fuzzy functions, Fuzzy-PA and Fuzzy-NPA of fuzzy decision problems, and Fuzzy-NPAO of fuzzy optimization problems. Based on a relative approximation scheme targeting fuzzy membership degree, we formulate two notions of "reducibility" in order to compare the computational complexity of two fuzzy problems. These reducibility notions make it possible to locate the most difficult fuzzy problems in Fuzzy-NPA and in Fuzzy-NPAO.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑