"Brute-force algorithm" nghĩa là gì?


"Brute-force algorithm" -> nghĩa là thuật toán vét cạn, chạy tất cả các trường hợp có thể giải quyết vấn đề (bao gồm cả đúng và sai).

Ví dụ
With the appropriate encryption (mã hóa), you can go about your work confident that your information is secure and that there is no plausible (hợp lý, đáng tin cậy) method for hackers to get the raw data. A brute-force algorithm would need more than a generation to decode all the information correctly.

A brute-force algorithm that determines (quyết định) a natural number's divisors (ước số) would list all integers (số nguyên) from 1 to n and determine whether each one divides n exactly. For the eight queens puzzle, a brute-force method would look at every possible arrangement of 8 pieces on the 64-square chessboard and determine whether each (queen) piece could attack any other part in that arrangement.

So a brute-force algorithm with exponential (số mũ) time complexity working on a 128-bit encryption key would need to attempt 2128 values at a minimum.

Ngọc Lân

Tags: ngoclanword

Post a Comment

Tin liên quan

    Hôn nhân

    Suy ngẫm