NTIME - PDFSEARCH.IO - Document Search Engine

NTIME
Results: 20

#	Item
1	Dataset Name Dimension Long Name(attr) Add to Reading List Source URL: ozoneaq.gsfc.nasa.gov Language: English - Date: 2016-02-01 09:04:10 Ultraviolet radiation Environmental chemistry Complexity classes Oxygen Ozone NTIME Ultraviolet
2	OMPS Limb Profiler Aerosol Extinction Product AER675: Version 0.5 Product Description Matthew DeLand, P. K. Bhartia, Philippe Xu, Tong Zhu 7 JanuaryIntroduction Add to Reading List Source URL: ozoneaq.gsfc.nasa.gov Language: English - Date: 2016-01-08 11:35:34 Spectroscopy NTIME Wavelength Tangent X-ray photoelectron spectroscopy
3	On the Computational Complexity of MapReduce ´ am D. Lelkes1 , Lev Reyzin1 , Benjamin Fish1 , Jeremy Kun1(B) , Ad´ and Gy¨ orgy Tur´ Add to Reading List Source URL: www.levreyzin.com Language: English - Date: 2016-01-18 21:47:16 Computational complexity theory Theory of computation Complexity classes Computational resources Structural complexity theory Theoretical computer science MapReduce Time hierarchy theorem NTIME Time complexity DSPACE SL
4	A Casual Tour Around a Circuit Complexity Bound∗ arXiv:1111.1261v1 [cs.CC] 4 Nov 2011 Ryan Williams† Add to Reading List Source URL: arxiv.org Language: English - Date: 2011-11-07 20:15:16 Complexity classes NTIME Circuit complexity P Bounded-error probabilistic polynomial Cook–Levin theorem Time hierarchy theorem NEXPTIME Time complexity Theoretical computer science Computational complexity theory Applied mathematics
5	Non-Linear Time Lower Bound for (Succinct) Quantified Boolean Formulas Ryan Williams∗ Carnegie Mellon University Abstract Add to Reading List Source URL: www.stanford.edu Language: English - Date: 2008-04-30 19:50:48 Complexity classes True quantified Boolean formula Alternating Turing machine FO DTIME NTIME Time complexity SL Turing machine Theoretical computer science Computational complexity theory Applied mathematics
6	Improving Exhaustive Search Implies Superpolynomial Lower Bounds Ryan Williams∗ IBM Almaden Research Center May 4, 2010 Add to Reading List Source URL: www.stanford.edu Language: English - Date: 2010-05-04 16:48:34 Complexity classes Computational resources Mathematical optimization Structural complexity theory Advice NTIME Probabilistically checkable proof NP P versus NP problem Theoretical computer science Computational complexity theory Applied mathematics
7	ODR: Output-Deterministic Replay for Multicore Debugging Gautam Altekar and Ion Stoica UC Berkeley {galtekar, istoica}@cs.berkeley.edu Add to Reading List Source URL: www.sigops.org Language: English - Date: 2009-09-02 14:56:19 System software Parallel computing NTIME NP Determinism Algorithm Pin Graphical Environment Manager Software Applied mathematics Complexity classes
8	OMPS Limb Profiler - Daily Ozone Product Description Matthew DeLand and Tong Zhu July 18, 2014 Introduction Add to Reading List Source URL: ozoneaq.gsfc.nasa.gov Language: English - Date: 2014-07-28 09:56:51 Oxygen Disinfectants Gases Ozone Applied mathematics NTIME Ultraviolet Ozone depletion Chemistry Environmental chemistry
9	Dataset Name /AncillaryData/AtmospherePressure /AncillaryData/AtmosphereTemperature /AncillaryData/TerrainAltitude /AncillaryData/TropopauseAltitude /DataFields/CloudHeight Add to Reading List Source URL: ozoneaq.gsfc.nasa.gov Language: English - Date: 2014-07-28 10:09:13 Mathematics Computational resources NTIME NP Tangent Horizontal coordinate system Complexity classes Applied mathematics Geometry
10	OMPS Limb Profiler - Daily Aerosol Product Description Matthew DeLand and Tong Zhu July 18, 2014 Introduction Add to Reading List Source URL: ozoneaq.gsfc.nasa.gov Language: English - Date: 2014-07-28 10:09:13 Computer file formats Hierarchical Data Format NTIME Data set Ozone Mapping and Profiler Suite MERIS Statistics Earth Computing