نتایج جستجو برای: canonization

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

Journal: :Religions 2022

Drawing upon a wide variety of personality cults in religion, culture and politics from Ancient Egypt to our times, the author attempts present summary view this phenomenon communicative standpoint. Personality cult is seen as an attribution universal eternal socio-cultural significance certain beings, messages interaction scenarios defiance changes diversity surrounding reality. The implementa...

2008
Oleg Verbitsky

A function f of a graph is called a complete graph invariant if G ∼= H is equivalent to f(G) = f(H). If, in addition, f(G) is a graph isomorphic to G, then f is called a canonical form for graphs. Gurevich [6] proves that graphs have a polynomial-time computable canonical form exactly when they have a polynomial-time computable complete invariant. We extend this equivalence to the polylogarithm...

2008
Niek Veldhuis

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...

Journal: :Kulturistik 2022

The development of information and communication technology has had a major influence on modern human life. One them is in the field literature which marked by emergence cyber digital form. distribution process through internet brought new changes to more efficient production because it does not rely conventional printing tools with large capital. Every society same opportunity as an author who...

2013
Paolo Codenotti

We explore under what conditions simple combinatorial attributes and algorithms such as the distance sequence and degree-based partitioning and refinement can be used to distinguish vertices of inhomogeneous random graphs. In the classical setting of Erdős-Renyi graphs and random regular graphs it has been proven that vertices can be distinguished in a constant number of rounds of degree-based ...

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

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