42 results
Facilitating Real-Time, Multidirectional Learning for Clinicians in a Low-Evidence Pandemic Response
-
- Journal:
- Disaster Medicine and Public Health Preparedness / Volume 17 / 2023
- Published online by Cambridge University Press:
- 21 September 2022, e246
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
Impact of mental health and addiction NIMHANS ECHO on primary care physicians: study from a rural state of India
-
- Journal:
- BJPsych Open / Volume 7 / Issue S1 / June 2021
- Published online by Cambridge University Press:
- 18 June 2021, p. S157
-
- Article
-
- You have access
- Open access
- Export citation
Building Physician Networks as Part of the Zika Response
-
- Journal:
- Disaster Medicine and Public Health Preparedness / Volume 11 / Issue 2 / April 2017
- Published online by Cambridge University Press:
- 21 April 2017, pp. 259-261
-
- Article
- Export citation
Appendix: Mathematical background
-
- Book:
- Computational Complexity
- Published online:
- 05 June 2012
- Print publication:
- 20 April 2009, pp 508-530
-
- Chapter
- Export citation
6 - Boolean circuits
- from PART ONE - BASIC COMPLEXITY CLASSES
-
- Book:
- Computational Complexity
- Published online:
- 05 June 2012
- Print publication:
- 20 April 2009, pp 106-122
-
- Chapter
- Export citation
7 - Randomized computation
- from PART ONE - BASIC COMPLEXITY CLASSES
-
- Book:
- Computational Complexity
- Published online:
- 05 June 2012
- Print publication:
- 20 April 2009, pp 123-142
-
- Chapter
- Export citation
0 - Notational conventions
-
- Book:
- Computational Complexity
- Published online:
- 05 June 2012
- Print publication:
- 20 April 2009, pp 1-6
-
- Chapter
- Export citation
Frontmatter
-
- Book:
- Computational Complexity
- Published online:
- 05 June 2012
- Print publication:
- 20 April 2009, pp i-vi
-
- Chapter
- Export citation
14 - Circuit lower bounds: Complexity theory's Waterloo
- from PART TWO - LOWER BOUNDS FOR CONCRETE COMPUTATIONAL MODELS
-
- Book:
- Computational Complexity
- Published online:
- 05 June 2012
- Print publication:
- 20 April 2009, pp 286-306
-
- Chapter
- Export citation
2 - NP and NP completeness
- from PART ONE - BASIC COMPLEXITY CLASSES
-
- Book:
- Computational Complexity
- Published online:
- 05 June 2012
- Print publication:
- 20 April 2009, pp 38-67
-
- Chapter
- Export citation
PART ONE - BASIC COMPLEXITY CLASSES
-
- Book:
- Computational Complexity
- Published online:
- 05 June 2012
- Print publication:
- 20 April 2009, pp 7-8
-
- Chapter
- Export citation
Main theorems and definitions
-
- Book:
- Computational Complexity
- Published online:
- 05 June 2012
- Print publication:
- 20 April 2009, pp 545-548
-
- Chapter
- Export citation
Hints and selected exercises
-
- Book:
- Computational Complexity
- Published online:
- 05 June 2012
- Print publication:
- 20 April 2009, pp 531-544
-
- Chapter
- Export citation
4 - Space complexity
- from PART ONE - BASIC COMPLEXITY CLASSES
-
- Book:
- Computational Complexity
- Published online:
- 05 June 2012
- Print publication:
- 20 April 2009, pp 78-94
-
- Chapter
- Export citation
12 - Decision trees
- from PART TWO - LOWER BOUNDS FOR CONCRETE COMPUTATIONAL MODELS
-
- Book:
- Computational Complexity
- Published online:
- 05 June 2012
- Print publication:
- 20 April 2009, pp 259-269
-
- Chapter
- Export citation
20 - Derandomization
- from PART THREE - ADVANCED TOPICS
-
- Book:
- Computational Complexity
- Published online:
- 05 June 2012
- Print publication:
- 20 April 2009, pp 402-420
-
- Chapter
- Export citation
13 - Communication complexity
- from PART TWO - LOWER BOUNDS FOR CONCRETE COMPUTATIONAL MODELS
-
- Book:
- Computational Complexity
- Published online:
- 05 June 2012
- Print publication:
- 20 April 2009, pp 270-285
-
- Chapter
- Export citation
PART TWO - LOWER BOUNDS FOR CONCRETE COMPUTATIONAL MODELS
-
- Book:
- Computational Complexity
- Published online:
- 05 June 2012
- Print publication:
- 20 April 2009, pp 257-258
-
- Chapter
- Export citation
9 - Cryptography
- from PART ONE - BASIC COMPLEXITY CLASSES
-
- Book:
- Computational Complexity
- Published online:
- 05 June 2012
- Print publication:
- 20 April 2009, pp 172-200
-
- Chapter
- Export citation
23 - Why are circuit lower bounds so difficult?
- from PART THREE - ADVANCED TOPICS
-
- Book:
- Computational Complexity
- Published online:
- 05 June 2012
- Print publication:
- 20 April 2009, pp 498-507
-
- Chapter
- Export citation