Oxford University

or Find Staff here

Results for University of Oxford

Results 1 - 7 of 7 for dc---r .

Sort by date, Sort by relevance.


1. A simple holographic model of momentum relaxation

DC conductivityKey idea: massless mode conserved quantity, express the DCconductivity in terms of r0. ... σDC (r) = limω0. Πiωλ1. r. σDC () = σDC. can show σ′DC (r) = 0!

www-thphys.physics.ox.ac.uk/people/AndreiStarinets/oxford_holography_group/holography_seminar/Seminar/Slides/andrade.pdf- 664k - 20 Feb 2014 - Cached

2. Microsoft PowerPoint - lecture1.ppt

D D. A A. d d. A A D DC. r rd d. ... r r. qN x dE x d x. qN xE x - E x d.

users.physics.ox.ac.uk/~rtaylor/teaching/devices/lecture1ppt.pdf- 372k - 4 May 2010 - Cached

3. Title

Asbefore, a basic step requires time of |DC| |R|2 time, and we perform at most |R| basicsteps, so the algorithm requires polynomial time. ... For all r R do S(vr) 4. T DC (T initially contains all the transformations coalition C has)5.

www.cs.ox.ac.uk/people/michael.wooldridge/pubs/mfcs2010.pdf- 198k - 2 Nov 2010 - Cached

4. https://www-thphys.physics.ox.ac.uk/people/AndreiStarinets/oxford_holography_group/holography_seminar/Seminar/Slides/blake.pdf

DC. 1 i! T 2 Jt (kL). Result for resistivity agrees with memory matrix prediction. ... 1 A. x. µfi!r. h. 0. DC(r). DC =Q2r2h. M2(rh). Universal Conductivity.

www-thphys.physics.ox.ac.uk/people/AndreiStarinets/oxford_holography_group/holography_seminar/Seminar/Slides/blake.pdf- 3063k - 13 Nov 2014 - Cached

5. https://people.maths.ox.ac.uk/suli/oseenfp_BC.pdf

with A as indicated above, and consider the SDE. 2:r “ Lr ζ. ... t P r0, T s and measurable withrespect to t for every r P.

people.maths.ox.ac.uk/suli/oseenfp_BC.pdf- 835k - 17 Feb 2018 - Cached

6. https://www.cs.ox.ac.uk/people/michael.wooldridge/pubs/amai2013.pdf

most |DC| |R|2 time. ... As before, a basic step requirestime of |DC| |R|2 time, and we perform at most |R| basic steps, so the algorithmrequires polynomial time.

www.cs.ox.ac.uk/people/michael.wooldridge/pubs/amai2013.pdf- 550k - 18 Apr 2013 - Cached

7. A Geometric Theory for Hypergraph Matching

For r-partite k-systems we introduce the following alternative notion of degree. ... r]k. ), that is, each index set is. represented by equally many edges.

people.maths.ox.ac.uk/keevash/papers/geom-match-journal.pdf- 1179k - 19 May 2014 - Cached

Result Page

1 , .

Enquiries to Webmaster | Powered by Funnelback Search