Results 91 to 100 of about 663 (192)
Peer review jurnal dengan judul Perjuangan Memberdayakan Masyarakat, dengan Judul Monitoring KKN di Desa Sidomulyo [PDF]
Kuliah kerja nyata merupakan kegiatan yang dilakukan mahasiswa sebagai wahana penerapan melalui forum silaturahmi, komunikasi, advokasi, dan penguatan potensi masyarakat, belajar dan tinggal bersama masyarakat secara komprehensif dalam arti dan tempat ...
Umy Zahroh, 020
core +1 more source
A proof of Ringel's conjecture
A typical decomposition question asks whether the edges of some graph G can be partitioned into disjoint copies of another graph H. One of the oldest and best known conjectures in this area, posed by Ringel in 1963, concerns the decomposition of complete
Pokrovskiy, A, Montgomery, R, Sudakov, B
core
Advanced Cryptography February 24, 2003
y distribution on some nite domain. Computational Indistinguishability Let fA k g k2N and fB k g k2N be two probability ensembles. For any poly-sized family of tester circuits T, let p k be P r( A k : T (1 ; ) = 1) and p k be P r( B k : T (1 ;
Lecture Zk Proofs +2 more
core
On the convergence theory of double K-weak splittings of type II. [PDF]
Shekhar V, Mishra N, Mishra D.
europepmc +1 more source
RNA 3D structure modeling by fragment assembly with small-angle X-ray scattering restraints. [PDF]
Chojnowski G +4 more
europepmc +1 more source
Neutral (salicylaldiminato)nickel(II) methyl complexes [{6-C(H)= NAr-2,4-I2C6H2O-k2N,O}NiMe(L)](Ar = 2,6-{3,5-(F3C)2C6H3}2C6H3) with different water-soluble ligands L (2a, L = 1,3,5-triaza-7-phosphaadamantane; 2b, L = hexamethylenetetramine (urotropine);
Korthals, Brigitte +2 more
core +1 more source
Peer Review Buku dengan judul Perjuangan Memberdayakan Masyarakat, dengan Judul Monitoring KKN di Desa Sidomulyo [PDF]
Kuliah kerja nyata merupakan kegiatan yang dilakukan mahasiswa sebagai wahana penerapan melalui forum silaturahmi, komunikasi, advokasi, dan penguatan potensi masyarakat, belajar dan tinggal bersama masyarakat secara komprehensif dalam arti dan tempat ...
Umy Zahroh, 020
core +1 more source
Partitions of complete geometric graphs into plane trees
Consider the open problem: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directions. First, we study the case of convex geometric graphs.
Prosenjit Bose +4 more
core
Normalizing Input-Output Relationships of Cancer Networks for Reversion Therapy. [PDF]
Joo JI, Park HJ, Cho KH.
europepmc +1 more source
The study of decomposing complete 4-partite graphs into cycles of length 3 or 4
碩士在本篇論文中,我們定義了: 1.D(Kp,q,r,s)={(u,v)| Kp,q,r,s=uC3+vC4} 2.S(Kp,q,r,s)={(u,v)| 3u+4v=|E(Kp,q,r,s)|} 由於p,q,r,s之間的大小關係,有著各種不同情況,因此我們分別分成下列幾種情況來討論,我們證明了: 1.D(K4(p))=S(K4(p)) 2.D(Kp,p,p,s)=S(Kp,p,p,s) 3.當p≠4,12時,則D(Kp,p,s,s)=S(Kp,p,s,s) 4.當p≠4,12時,則D(Kp,p,r ...
張哲專; Chang, Che-chuang
core +1 more source

