Answer:
polynomial-bounded algorithms
Explanation:
There are two algorithm complexities and they are time and space complexities. They can be denoted with the big-O notation. The big-o notation for a time and space complexity gets the worst-case time and space respectively.
The time complexity gets the measure of the execution time of an algorithm. When the time function is a polynomial ( k^n + k^n-1 ...) then the algorithm is said to be a polynomial-bounded algorithm.
Answer: data security
Explanation:
The company's authentication protocols and data encryption measures denotes data security.
Data security simply means protecting unauthorized people from having access to a particular data. This is done to prevent unauthorized access of important information or to prevent fraud. Some of the data security measures include data encryption, tokenization, hashing, etc.
Those would be numbers below 1.
Explanation:
.5•.5 = .25
-2•-2 = -4
Hope this helps!
Also consider giving me brainliest.
