01394oam 2200409 a 450 991070091860332120110919105815.0(CKB)5470000002413845(OCoLC)701694326(EXLCZ)99547000000241384520110213d2011 ua 0engurmn||||a||||txtrdacontentcrdamediacrrdacarrierMilitary personnel[electronic resource] DOD addressing challenges in Iraq and Afghanistan but opportunities exist to enhance the planning process for Army medical personnel requirements : report to congressional committees[Washington, D.C.] :U.S. Govt. Accountability Office,[2011]1 online resource (ii, 33 pages) illustrationsTitle from cover screen (viewed Feb. 13, 2011)."February 2011.""GAO-11-163."Includes bibliographical references.Military personnel SoldiersMedical careUnited StatesMedicine, MilitaryUnited StatesSoldiersMedical careMedicine, MilitaryDIDDIDDIDOCLCQGPOBOOK9910700918603321Military personnel2878221UNINA03289oam 2200409zu 450 99620879750331620210807001318.00-7695-4411-8(CKB)2670000000097542(SSID)ssj0000668984(PQKBManifestationID)12310136(PQKBTitleCode)TC0000668984(PQKBWorkID)10703952(PQKB)10858267(NjHacI)992670000000097542(EXLCZ)99267000000009754220160829d2011 uy engur|||||||||||txtccr2011 IEEE 26th Annual Conference on Computational Complexity[Place of publication not identified]IEEE20111 online resource (309 pages) illustrationsBibliographic Level Mode of Issuance: Monograph1-4577-0179-0 Preface -- Program Committee -- Steering Committee -- Reviewers -- Best Paper Awards -- Wednesday, 8 June 2011 -- Improved Direct Product Theorems for Randomized Query Complexity -- Making Branching Programs Oblivious Requires Superlogarithmic Overhead -- Hardness of Max-2Lin and Max-3Lin over Integers, Reals, and Large Cyclic Groups -- Lower Bounds on Query Complexity for Testing Bounded-Degree CSPs -- Non-negatively Weighted #CSP: An Effective Complexity Dichotomy -- Symmetric LDPC Codes are not Necessarily Locally Testable -- Towards Lower Bounds on Locally Testable Codes via Density Arguments -- Linear-Algebraic List Decoding of Folded Reed-Solomon Codes -- Noisy Interpolation of Sparse Polynomials, and Applications -- Paris-Harrington Tautologies -- Relativized Separations of Worst-Case and Average-Case Complexities for NP -- Thursday, 9 June 2011 Non-uniform ACC Circuit Lower Bounds -- Improved Constructions of Three Source Extractors -- A New Approach to Affine Extractors and Dispersers -- Symmetry of Information and Bounds on Nonuniform Randomness Extraction via Kolmogorov Extractors -- Near-Optimal and Explicit Bell Inequality Violations -- Symmetry-Assisted Adversaries for Quantum State Generation -- Approximation Algorithms for QMA-Complete Problems -- Sevag Gharibian and Julia Kempe -- On Arthur Merlin Games in Communication Complexity -- On the Minimal Fourier Degree of Symmetric Boolean Functions -- Property Testing Lower Bounds via Communication Complexity -- Friday, 10 June 2011 Pseudorandomness for Permutation and Regular Branching Programs -- Pseudorandom Generators for Combinatorial Checkerboards -- Bounded-Depth Circuits Cannot Sample Good Codes -- k-Independent Gaussians Fool Polynomial Threshold Functions -- Explicit Dimension Reduction and Its Applications -- Derandomizing Polynomial Identity Testing for Multilinear Constant-Read Formulae -- Tensor Rank: Some Lower and Upper Bounds -- On the Sum of Square Roots of Polynomials and Related Problems -- Linear Systems over Finite Abelian Groups -- Author Index.Computational complexityCongressesComputational complexity511.3IEEE StaffPQKBPROCEEDING9962087975033162011 IEEE 26th Annual Conference on Computational Complexity2346672UNISA