This HTML5 document contains 82 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
n11http://octopus.library.cmu.edu/Collections/traub62/box00021/fld00024/bdl0002/doc0001/
foafhttp://xmlns.com/foaf/0.1/
n20https://www.cs.columbia.edu/
n12https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
n21http://www.elsevier.com/wps/find/journaldescription.cws_home/622865/
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
n8http://www.cs.columbia.edu/~traub/
n6http://bn.dbpedia.org/resource/
n19http://
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/
n4https://www.amazon.com/dp/0521485061/

Statements

Subject Item
dbr:Probabilistic_numerics
dbo:wikiPageWikiLink
dbr:Information-based_complexity
Subject Item
dbr:Algorithmic_probability
dbo:wikiPageWikiLink
dbr:Information-based_complexity
Subject Item
dbr:Joseph_F._Traub
dbo:wikiPageWikiLink
dbr:Information-based_complexity
Subject Item
dbr:Information-based_complexity
rdfs:label
Information-based complexity
rdfs:comment
Information-based complexity (IBC) studies optimal algorithms and computational complexity for the continuous problems that arise in physical science, economics, engineering, and mathematical finance. IBC has studied such continuous problems as path integration, partial differential equations, systems of ordinary differential equations, nonlinear equations, integral equations, fixed points, and very-high-dimensional integration. All these problems involve functions (typically multivariate) of a real or complex variable. Since one can never obtain a closed-form solution to the problems of interest one has to settle for a numerical solution. Since a function of a real or complex variable cannot be entered into a digital computer, the solution of continuous problems involves partial informati
dcterms:subject
dbc:Computational_complexity_theory
dbo:wikiPageID
8221717
dbo:wikiPageRevisionID
1116392336
dbo:wikiPageWikiLink
dbr:Curse_of_dimensionality dbr:Integral_equations dbr:Numerical_integration dbr:Partial_differential_equations dbr:Path_integration dbr:Nonlinearity dbr:Collateralized_mortgage_obligation dbr:Integer_factorization dbr:Weather_forecasting dbr:Quasi-Monte_Carlo_method dbr:Control_theory dbr:Physics dbr:Travelling_salesman_problem dbr:Banach_space dbr:Monte_Carlo_method dbr:Low-discrepancy_sequence dbr:Ordinary_differential_equations dbr:Mathematical_finance dbr:Complex_number dbr:Analysis_of_algorithms dbr:Numerical_weather_prediction dbr:Columbia_University dbr:Statistics dbr:Real_number dbr:Joseph_F_Traub dbc:Computational_complexity_theory dbr:Computer_vision dbr:Domain_knowledge dbr:Continuous-variable_quantum_information dbr:Fundamental_theorem_of_calculus dbr:Fixed_point_(mathematics) dbr:Economics dbr:Nonlinear_equation dbr:Engineering dbr:Hilbert_space dbr:Algorithms dbr:Physical_science dbr:Medical_imaging dbr:Geophysics
dbo:wikiPageExternalLink
n4: n8: n11:doc_21b24f2b1.pdf n19:www.ibc-research.org n20:~ap n20:~traub n21:description%23description
owl:sameAs
n6:তথ্য-ভিত্তিক_জটিলতা wikidata:Q6030626 n12:4mxHF freebase:m.026wpgc
dbp:wikiPageUsesTemplate
dbt:No_footnotes dbt:Cite_book dbt:Interlanguage_link
dbo:abstract
Information-based complexity (IBC) studies optimal algorithms and computational complexity for the continuous problems that arise in physical science, economics, engineering, and mathematical finance. IBC has studied such continuous problems as path integration, partial differential equations, systems of ordinary differential equations, nonlinear equations, integral equations, fixed points, and very-high-dimensional integration. All these problems involve functions (typically multivariate) of a real or complex variable. Since one can never obtain a closed-form solution to the problems of interest one has to settle for a numerical solution. Since a function of a real or complex variable cannot be entered into a digital computer, the solution of continuous problems involves partial information. To give a simple illustration, in the numerical approximation of an integral, only samples of the integrand at a finite number of points are available. In the numerical solution of partial differential equations the functions specifying the boundary conditions and the coefficients of the differential operator can only be sampled. Furthermore, this partial information can be expensive to obtain. Finally the information is often contaminated by noise. The goal of information-based complexity is to create a theory of computational complexity and optimal algorithms for problems with partial, contaminated and priced information, and to apply the results to answering questions in various disciplines. Examples of such disciplines include physics, economics, mathematical finance, computer vision, control theory, geophysics, medical imaging, weather forecasting and climate prediction, and statistics. The theory is developed over abstract spaces, typically Hilbert or Banach spaces, while the applications are usually for multivariate problems. Since the information is partial and contaminated, only approximate solutions can be obtained. IBC studies computational complexity and optimal algorithms for approximate solutions in various settings. Since the worst case setting often leads to negative results such as unsolvability and intractability, settings with weaker assurances such as average, probabilistic and randomized are also studied. A fairly new area of IBC research is continuous quantum computing.
prov:wasDerivedFrom
wikipedia-en:Information-based_complexity?oldid=1116392336&ns=0
dbo:wikiPageLength
17094
foaf:isPrimaryTopicOf
wikipedia-en:Information-based_complexity
Subject Item
dbr:Analysis_of_algorithms
dbo:wikiPageWikiLink
dbr:Information-based_complexity
Subject Item
dbr:Theoretical_computer_science
dbo:wikiPageWikiLink
dbr:Information-based_complexity
Subject Item
dbr:Nikolai_Sergeevich_Bakhvalov
dbo:wikiPageWikiLink
dbr:Information-based_complexity
dbp:knownFor
dbr:Information-based_complexity
dbo:knownFor
dbr:Information-based_complexity
Subject Item
dbr:Foundations_of_Computational_Mathematics
dbo:wikiPageWikiLink
dbr:Information-based_complexity
Subject Item
dbr:Jack_Kiefer_(statistician)
dbo:wikiPageWikiLink
dbr:Information-based_complexity
Subject Item
dbr:IBC
dbo:wikiPageWikiLink
dbr:Information-based_complexity
dbo:wikiPageDisambiguates
dbr:Information-based_complexity
Subject Item
dbr:Information-Based_Complexity
dbo:wikiPageWikiLink
dbr:Information-based_complexity
dbo:wikiPageRedirects
dbr:Information-based_complexity
Subject Item
dbr:Tag_SNP
dbo:wikiPageWikiLink
dbr:Information-based_complexity
Subject Item
dbr:Information_Based_Complexity
dbo:wikiPageWikiLink
dbr:Information-based_complexity
dbo:wikiPageRedirects
dbr:Information-based_complexity
Subject Item
dbr:Information_based_complexity
dbo:wikiPageWikiLink
dbr:Information-based_complexity
dbo:wikiPageRedirects
dbr:Information-based_complexity
Subject Item
wikipedia-en:Information-based_complexity
foaf:primaryTopic
dbr:Information-based_complexity