Search results
Results from the WOW.Com Content Network
This is a list of algorithm general topics. Analysis of algorithms; Ant colony algorithm; Approximation algorithm; Best and worst cases; Big O notation; Combinatorial search; Competitive analysis; Computability theory; Computational complexity theory; Embarrassingly parallel problem; Emergent algorithm; Evolutionary algorithm; Fast Fourier ...
Special cases of nonlinear programming: See Linear programming and Convex optimization above; Geometric programming — problems involving signomials or posynomials Signomial — similar to polynomials, but exponents need not be integers; Posynomial — a signomial with positive coefficients; Quadratically constrained quadratic program
List of scientific method topics; List of analyses of categorical data; List of fields of application of statistics; List of graphical methods; List of statistical software. Comparison of statistical packages; List of graphing software; Comparison of Gaussian process software; List of stochastic processes topics; List of matrices used in statistics
Lists of mathematics topics cover a variety of topics related to mathematics. Some of these lists link to hundreds of articles; some link only to a few. The template to the right includes links to alphabetical lists of all mathematical articles. This article brings together the same content organized in a manner better suited for browsing.
Many mathematical problems have been stated but not yet solved. These problems come from many areas of mathematics, such as theoretical physics, computer science, algebra, analysis, combinatorics, algebraic, differential, discrete and Euclidean geometries, graph theory, group theory, model theory, number theory, set theory, Ramsey theory, dynamical systems, and partial differential equations.
These are lists of research topics, research problems and current research activities in various scientific areas. Pages in category "Lists of research topics" The following 3 pages are in this category, out of 3 total.
P versus NP problem; What is the relationship between BQP and NP?; NC = P problem The P vs NP problem is a major unsolved question in computer science that asks whether every problem whose solution can be quickly verified by a computer (NP) can also be quickly solved by a computer (P).
Main page; Contents; Current events; Random article; About Wikipedia; Contact us; Pages for logged out editors learn more