The bibliographic entry was discovered and compiled by a machine, and published without a person checking it against the publication. The publication itself is the authors' own work — this badge says nothing about it.

A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms

The work

AuthorsB. A. Trakhtenbrot
Editors
Typearticle
Year1984
Citekeytrakhtenbrot1984survey

Where it appeared

Published inIEEE Annals of the History of Computing
PublisherInstitute of Electrical and Electronics Engineers
Volume6
Issue4
Pages384--400

Identifiers

DOI10.1109/mahc.1984.10036
OpenAlexW2165813048
ISSN1058-6180

Empty on purpose

copy

Related

Distinct fromcook1971complexity

From OpenAlex, which stores abstracts as an index of words and their positions: what is shown is rebuilt from that, and reads fluently whether or not it is what the author wrote.

Abstract

Concerns about computational problems requiring brute-force or exhaustive search methods have gained particular attention in recent years because of the widespread research on the "P = NP?" question. The Russian word for "brute-force search" is "perebor. " It has been an active research area in the Soviet Union for several decades. Disputes about approaches to perebor had a certain influence on the development, and developers, of complexity theory in the Soviet Union. This paper is a personal account of some events, ideas, and academic controversies that surrounded this topic and to which the author was a witness and-to some extent-a participant. It covers a period that started in the 1950s and culminated with the discovery and investigation of non-deterministic polynomial (NP)-complete problems independently by S. Cook and R. Karp in the United States and L. Levin in the Soviet Union.

How it got here

How it got hereagent via openalex
Added2026-09-03 05:44 UTC
Not denied bya person 2026-10-29 17:12 UTC

Filed under

annals-history

Cite it as

@article{trakhtenbrot1984survey,
  title        = {A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms},
  author       = {B. A. Trakhtenbrot},
  year         = {1984},
  journal      = {IEEE Annals of the History of Computing},
  publisher    = {Institute of Electrical and Electronics Engineers},
  volume       = {6},
  number       = {4},
  pages        = {384--400},
  issn         = {1058-6180},
  doi          = {10.1109/mahc.1984.10036},
}

This record lives at https://refs.drheap.org/trakhtenbrot1984survey/ and will keep doing so.