Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Information-based_complexity> ?p ?o. }
Showing items 1 to 19 of
19
with 100 items per page.
- Information-based_complexity abstract "Information-based complexity (IBC) studies optimal algorithms and computational complexity for the continuous problems which 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 of 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.".
- Information-based_complexity wikiPageExternalLink doc_21b24f2b1.pdf.
- Information-based_complexity wikiPageExternalLink 0521485061.
- Information-based_complexity wikiPageExternalLink ~ap.
- Information-based_complexity wikiPageExternalLink ~henryk.
- Information-based_complexity wikiPageExternalLink ~traub.
- Information-based_complexity wikiPageExternalLink description.
- Information-based_complexity wikiPageExternalLink www.ibc-research.org.
- Information-based_complexity wikiPageID "8221717".
- Information-based_complexity wikiPageRevisionID "603760026".
- Information-based_complexity hasPhotoCollection Information-based_complexity.
- Information-based_complexity subject Category:Computational_complexity_theory.
- Information-based_complexity comment "Information-based complexity (IBC) studies optimal algorithms and computational complexity for the continuous problems which 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.".
- Information-based_complexity label "Information-based complexity".
- Information-based_complexity sameAs m.026wpgc.
- Information-based_complexity sameAs Q6030626.
- Information-based_complexity sameAs Q6030626.
- Information-based_complexity wasDerivedFrom Information-based_complexity?oldid=603760026.
- Information-based_complexity isPrimaryTopicOf Information-based_complexity.