| slovo | definícia |
complexity
(mass) | complexity
- komplexnosť |
complexity
(encz) | complexity,komplexnost n: Zdeněk Brož |
complexity
(encz) | complexity,komplikovanost n: Zdeněk Brož |
complexity
(encz) | complexity,obtížnost [tech.] Pavel Cvrček |
complexity
(encz) | complexity,složitost n: Zdeněk Brož |
complexity
(encz) | complexity,spletitost Pavel Cvrček |
Complexity
(gcide) | Complexity \Com*plex"i*ty\, n.; pl. Complexities. [Cf. F.
complexit['e].]
1. The state of being complex; intricacy; entanglement.
[1913 Webster]
The objects of society are of the greatest possible
complexity. --Burke.
[1913 Webster]
2. That which is complex; intricacy; complication.
[1913 Webster]
Many-corridored complexities
Of Arthur's palace. --Tennyson.
[1913 Webster] |
complexity
(wn) | complexity
n 1: the quality of being intricate and compounded; "he enjoyed
the complexity of modern computers" [syn: complexity,
complexness] [ant: simpleness, simplicity] |
complexity
(foldoc) | complexity
The level in difficulty in solving mathematically
posed problems as measured by the time, number of steps or
arithmetic operations, or memory space required (called time
complexity, computational complexity, and space complexity,
respectively).
The interesting aspect is usually how complexity scales with
the size of the input (the "scalability"), where the size of
the input is described by some number N. Thus an algorithm
may have computational complexity O(N^2) (of the order of the
square of the size of the input), in which case if the input
doubles in size, the computation will take four times as many
steps. The ideal is a constant time algorithm (O(1)) or
failing that, O(N).
See also NP-complete.
(1994-10-20)
|
| | podobné slovo | definícia |
overcomplexity
(encz) | overcomplexity,přílišná složitost n: Zdeněk Brož |
Complexity
(gcide) | Complexity \Com*plex"i*ty\, n.; pl. Complexities. [Cf. F.
complexit['e].]
1. The state of being complex; intricacy; entanglement.
[1913 Webster]
The objects of society are of the greatest possible
complexity. --Burke.
[1913 Webster]
2. That which is complex; intricacy; complication.
[1913 Webster]
Many-corridored complexities
Of Arthur's palace. --Tennyson.
[1913 Webster] |
complexity analysis
(foldoc) | complexity analysis
In sructured program design, a quality-control operation that
counts the number of "compares" in the logic implementing a
function; a value of less than 10 is considered acceptable.
|
complexity class
(foldoc) | complexity class
A collection of algorithms or {computable
functions} with the same complexity.
(1996-04-24)
|
complexity measure
(foldoc) | complexity measure
A quantity describing the complexity of a
computation.
(1996-04-24)
|
computational complexity
(foldoc) | computational complexity
The number of steps or arithmetic operations
required to solve a computational problem. One of the three
kinds of complexity.
(1996-04-24)
|
cyclomatic complexity
(foldoc) | cyclomatic complexity
A measure of the number of linearly
independent paths through a program module. Cyclomatic
complexity is a measure for the complexity of code related to
the number of ways there are to traverse a piece of code.
This determines the minimum number of inputs you need to test
all ways to execute the program.
(1998-03-17)
|
essential complexity
(foldoc) | essential complexity
A measure of the "structuredness" of a program.
(1996-05-13)
|
space complexity
(foldoc) | space complexity
The way in which the amount of storage space
required by an algorithm varies with the size of the problem
it is solving. Space complexity is normally expressed as an
order of magnitude, e.g. O(N^2) means that if the size of the
problem (N) doubles then four times as much working storage
will be needed.
See also computational complexity, time complexity.
(1996-05-08)
|
time complexity
(foldoc) | time complexity
The way in which the number of steps required by
an algorithm varies with the size of the problem it is
solving. Time complexity is normally expressed as an order of
magnitude, e.g. O(N^2) means that if the size of the problem
(N) doubles then the algorithm will take four times as many
steps to complete.
See also computational complexity, space complexity.
(1996-05-08)
|
|