نتایج جستجو برای: distributive data processing

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

Journal: :Journal of Pure and Applied Algebra 1999

Journal: :Contemporary Political Theory 2002

1998
G. GRÄTZER R. P. Dilworth A. P. Huhn G. Grätzer H. Lakser E. T. Schmidt

In the early eighties, A. Huhn proved that if D, E are finite distributive lattices and ψ : D → E is a {0}-preserving join-embedding, then there are finite lattices K, L and there is a lattice homomorphism φ : K → L such that ConK (the congruence lattice of K) is isomorphic to D, ConL (the congruence lattice of L) is isomorphic to E, and the natural induced mapping extφ : ConK → ConL represents...

Journal: :Journal of Clinical Pathology 1972

Journal: :Bioscience Reports 2017

Journal: :Frontiers in Neuroscience 2010

Journal: :Journal of Applied Sciences 2006

Journal: :Scalable Computing: Practice and Experience 2016

Journal: :Theor. Comput. Sci. 1996
Michel Habib Lhouari Nourine

From a well-known decomposition theorem, we propose a tree representation for distributive and simplicial lattices. We show how this representation (called ideal tree) can be efficiently computed (linear time in the size of the lattice given by any graph whose transitive closure is the lattice) and compared with respect to time and space complexity. As far as time complexity is concerned, we si...

Journal: :The Japanese journal of ergonomics 1965

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

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