Some computational problems related to normal forms
نویسندگان
چکیده
منابع مشابه
Some Computational Problems Related to Pseudo-intents
We investigate the computational complexity of several decision, enumeration and counting problems related to pseudo-intents. We show that given a formal context and a set of its pseudo-intents, checking whether this context has an additional pseudo-intent is in conp and it is at least as hard as checking whether a given simple hypergraph is saturated. We also show that recognizing the set of p...
متن کاملSome Decision Problems Related To
The problem of deciding whether a monoid that is given through a nite presentation is a regular monoid as well as two closely related decision problems are considered. Since these problems are undecidable in general, they are investigated for certain restricted classes of nite presentations. Some new decidability results as well as some new undecidability results are obtained, which show that f...
متن کاملSome Dynamic Computational Geometry Problems
\‘c consider some problems in computattonal geometry when every one of the input points i\ movmg in a prescribed manner.
متن کاملComputational problems for vector-valued quadratic forms
For R-vector spaces U and V we consider a symmetric bilinear map B : U×U → V . This then defines a quadratic map QB : U → V by QB(u) = B(u, u). Corresponding to each λ ∈ V ∗ is a R-valued quadratic form λQB on U defined by λQB(u) = λ · QB(u). B is definite if there exists λ ∈ V ∗ so that λQB is positive-definite. B is indefinite if for each λ ∈ V ∗, λQB is neither positive nor negative-semidefi...
متن کاملSome comments on fuzzy normal forms
In this paper, we examine and compare de Morgan-, Kleene-, and Boolean-disjunctive and conjunctive normal forms in fuzzy settings. This generalizes papers of Turksen on the subject of Boolean-normal forms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science and Cybernetics
سال: 2016
ISSN: 1813-9663,1813-9663
DOI: 10.15625/1813-9663/13/1/7983