| | |
| | |
Stat |
Members: 3645 Articles: 2'501'711 Articles rated: 2609
19 April 2024 |
|
| | | |
|
Article overview
| |
|
The World of Combinatorial Fuzzy Problems and the Efficiency of Fuzzy Approximation Algorithms | Tomoyuki Yamakami
; | Date: |
10 Sep 2015 | Abstract: | 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. | Source: | arXiv, 1509.3057 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |