8021 - 8030 of 10072 for copyingSearch Results
View search results from all Wolfram sites (14307 matches)
GraphPath   (Graph Utilities Package Symbol)
GraphPath[g, start, end] finds a shortest path between vertices start and end in graph g.
MinimumBandwidthOrdering   (Graph Utilities Package Symbol)
MinimumBandwidthOrdering[g] attempts to find a vertex ordering that minimizes the bandwidth of the undirected graph g.MinimumBandwidthOrdering[m] attempts to find row and ...
Hypothesis Testing Package   (Hypothesis Testing Package Tutorial)
This package contains functions for computing confidence intervals from data and p-values and confidence intervals for distributions related to the normal distribution. Given ...
QuadraticFormDistribution   (Multivariate Statistics Package Symbol)
QuadraticFormDistribution[{a, b, c}, {\[Mu], \[CapitalSigma]}] represents the distribution of a quadratic form z.a.z + b.z + c for multivariate normal z.
Notation, Symbolize and InfixNotation   (Notation Package Tutorial)
Syntax of notation declarations. Notation takes both an external representation and an internal representation as arguments. Mathematica translates any input matching the ...
Options and Auxiliary Functions   (Notation Package Tutorial)
Notation , Symbolize and InfixNotation have several options that modify their behavior. These notation functions all take the options WorkingForm and Action. In addition the ...
NLimit   (Numerical Calculus Package Symbol)
NLimit[expr, z -> z_0] numerically finds the limiting value of expr as z approaches z_0.
Plot Legends Package   (Plot Legends Package Tutorial)
There are two ways to use the functions in this package to place a legend in a graphic: the first can only be used as an option to the built-in functions Plot, ListPlot and ...
Polyhedron Operations Package   (Polyhedron Operations Package Tutorial)
A Platonic solid is a convex polyhedron whose faces and vertices are all of the same type. There are five such solids. There are also a few nonconvex polyhedra known that ...
Primality Proving Package   (Primality Proving Package Tutorial)
This package implements primality proving. If ProvablePrimeQ[n] returns True, then the number n can be mathematically proven to be prime. In addition, PrimeQCertificate[n] ...
1 ... 800|801|802|803|804|805|806 ... 1008 Previous Next

...