نتایج جستجو برای: complete part

تعداد نتایج: 976834  

Journal: :The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science 1902

2012
Takashi Horiyama Takehiro Ito Keita Nakatsuka Akira Suzuki Ryuhei Uehara

We study the computational complexity of packing puzzles of identical polyominoes. Packing dominoes (i.e., 1 × 2 rectangles) into grid polygons can be solved in polynomial time by reducing to a bipartite matching problem. On the other hand, packing 2 × 2 squares is known to be NP-complete. In this paper, we fill the gap between dominoes and 2 × 2 squares, that is, we consider the packing puzzle...

Journal: :Journal of Oral Research 2021

Introduction: The objective of a complete denture prosthesis is restoring aesthetics, comfort, and function by the replacement missing dental alveolar structures employing stable prosthesis. Case Report: Many conditions can complicate treatment plan fabrication Complete in clinically compromised challenging task for dentist. In this clinical report, we present comprehensive management patient w...

2009
Tinaz Ekim Pinar Heggernes Daniel Meister

Polar graphs generalise bipartite, cobipartite, and split graphs, and they constitute a special type of matrix partitions. A graph is polar if its vertex set can be partitioned into two, such that one part induces a complete multipartite graph and the other part induces a disjoint union of complete graphs. Deciding whether a given arbitrary graph is polar, is an NP-complete problem. Here we sho...

Journal: :Eur. J. Comb. 2013
Tinaz Ekim Pinar Heggernes Daniel Meister

Polar graphs generalise bipartite graphs, cobipartite graphs, and split graphs, and they constitute a special type of matrix partitions. A graph is polar if its vertex set can be partitioned into two, such that one part induces a complete multipartite graph and the other part induces a disjoint union of complete graphs. Deciding whether a given arbitrary graph is polar, is an NP-complete proble...

1998
Klaus Ambos-Spies Steffen Lempp Gunther Mainhardt

We show that the question of whether the p-tt-complete or p-T -complete sets for the deterministic time classes E and EXP have measure 0 in these classes in the sense of Lutz's resource-bounded measure cannot be decided by relativizable techniques. On the other hand, we obtain the following absolute results if we bound the norm, i.e., the number of oracle queries of the reductions: For r = tt; ...

Journal: :educational research in medical sciences 0
roohollah sharifi dept. of endodontics, school of dentistry, kermanshah university of medical sciences, kermanshah, iran. vahid khanbeiki student research committee, school of dentistry, kermanshah university of medical sciences, kermanshah, iran.

introduction: the present study was conducted to analyze the knowledge of general dentists of kermanshah about root canal therapy in 2012. methods: in this descriptive cross-sectional study, a two-part questionnaire was designed and given to 93 general dentists in kermanshah to complete. the first part of the questionnaire comprised of personal and professional information of the participant de...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید