نتایج جستجو برای: complete part
تعداد نتایج: 976834 فیلتر نتایج به سال:
a semi-empirical mathematical model for predicting physical part of ignition delay period in the combustion of direct - injection diesel engines with swirl is developed . this model based on a single droplet evaporation model . the governing equations , namely , equations of droplet motion , heat and mass transfer were solved simultaneously using a rung-kutta step by step unmerical method . the...
background: potassium, as an extracellular ion, plays an important role in the electrophysiologic function of the myocardium and any change in extracellular concentration of this ion might have a marked impression upon myocyte electrophysiologic gain. high serum potassium levels are thought to impair pulse conduction in purkinje fibers and ventricles more than that in the atrioventricular (av) ...
A relational database stores information about the world. In order to describe how reliable the content of a database is with respect to a certain domain, two cardinal concepts are generally used: correctness and completeness. Correctness refers to whether the database stores only true facts about its intended domain or if it possibly contains false data. Completeness refers to whether the data...
Abstract This is the second part of a two-part series on logic hyperlogic, formal system for regimenting metalogical claims in object language (even within embedded environments). Part A provided minimal hyperlogic that sound and complete over class all models. In this part, we extend these completeness results to stronger logics are restricted classes We also investigate when enriched with hyp...
Deciding whether or not a feasible solution to the Traveling Salesman Problem with Pickups and Deliveries (TSPPD) exists is polynomially solvable. We prove that counting the number of feasible solutions of the TSPPD is hard by showing the problem is #P-complete.
We prove that the problem of counting the number of colourings of the vertices of a graph with at most two colours, such that the colour classes induce connected subgraphs is #P-complete. We also show that the closely related problem of counting the number of cocircuits of a graph is #P-complete.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید