نتایج جستجو برای: p lucens pamblyphyllus

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

2011
Normen Peulecke Bhaskar R. Aluri Bernd H. Müller Anke Spannenberg Uwe Rosenthal

The title compound, C(9)H(22)NOP, was obtained by slow diffusion of oxygen into a toluene solution of (i)Pr(2)PNH(i)Pr. In the crystal, an inter-molecular N-H⋯O hydrogen bond occurs.

Journal: :Pacific Journal of Mathematics 1972

Journal: :Journal of Algebra 1984

Journal: :International Journal of Integrated Care 2010

Journal: :The British journal of psychiatry : the journal of mental science 2011
David Nutt

Cox et al's paper addresses an issue that has long been assumed to be a central aspect of brain function - the interplay of different neurotransmitters - but for which we have very little evidence so far. It is currently unclear whether these findings will have implications for the treatment of those with cocaine or other substance dependence.

2008
Noam Hazon Yonatan Aumann Sarit Kraus Michael Wooldridge

We investigate the extent to which it is possible to evaluate the probability of a particular candidate winning an election, given imperfect information about the preferences of the electorate. We assume that for each voter, we have a probability distribution over a set of preference orderings. Thus, for each voter, we have a number of possible preference orderings – we do not know which of the...

Journal: :Current opinion in psychiatry 2008
Fabrizio Schifano

PURPOSE OF REVIEW More than half of the world's population is living in urban areas, but the evidence about urban-rural differences in drug use is not clearly defined. The present paper aims to review the international literature addressing the role of urbanization and related parameters in association with substance misuse. In particular, the evidence of urbanization being a risk factor for su...

Journal: :Discrete Applied Mathematics 2009
Gerardo Berbeglia Gena Hahn

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.

2008
Andrew J. Goodall Steven D. Noble

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.

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

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