Some Mineralogical Problems in Dental Hard Tissues.
نویسندگان
چکیده
منابع مشابه
Some hard families of parameterised counting problems
We consider parameterised subgraph-counting problems of the following form: given a graph G, how many k-tuples of its vertices have a given property? A number of such problems are known to be #W[1]complete; here we substantially generalise some of these existing results by proving hardness for two large families of such problems. We demonstrate that it is #W[1]-hard to count the number of k-ver...
متن کاملOn Some Hard Problems on Matroid Spikes
Spikes form an interesting class of 3-connected matroids of branch-width 3. We show that some computational problems are hard on spikes with given matrix representations over infinite fields. Namely, the question whether a given spike is the free spike is co-NP -hard (though the property itself is definable in monadic second-order logic); and the task to compute the Tutte polynomial of a spike ...
متن کاملComparative study of mechanical properties of dental restorative materials and dental hard tissues in compressive loads
There are two objectives. One is to show the differences in the mechanical properties of various dental restorative materials compared to those of enamel and dentin. The other is to ascertain which dental restorative materials are more suitable for clinical treatments. Amalgam, dental ceramic, gold alloy, dental resin, zirconia, and titanium alloy were processed as dental restorative material s...
متن کاملAcidity and in vitro effects on dental hard tissues of pharmaceutical preparations used in paediatric cardiology
Background: The knowledge of oral health effects caused by long-term medication in medically compromised children is sparse. Besides the effects on salivary secretion, pharmacotherapy may also act directly on the dental hard tissues, with dental caries and/or erosive lesions as possible outcomes of their acid and fermentable sugar content. Methods: Thirteen pharmaceutical preparations commonly ...
متن کاملFaster Exact Solutions for Some NP-Hard Problems
This paper considers a number of NP-complete problems, and provides faster algorithms for solving them. The solutions are based on a recursive partitioning of the problem domain, and careful elimination of some of the branches along the search without actually checking them. The time complexity of the proposed algorithms is of the form O(2 ) for constant 0¡ ¡ 1, where n is the output size of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Mineralogical Society of Japan
سال: 1992
ISSN: 1883-7018,0454-1146
DOI: 10.2465/gkk1952.21.141