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

@article{Trakhtenbrot1984ASO,
  title={A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms},
  author={B. Trakhtenbrot},
  journal={Annals of the History of Computing},
  year={1984},
  volume={6},
  pages={384-400}
}
  • B. Trakhtenbrot
  • Published 1984
  • Computer Science
  • Annals of the History of Computing
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… Expand

Paper Mentions

A Brief History of NP-Completeness, 1954-2012
The history and status of the P versus NP question
The importance of the P versus NP question
Kolmogorov complexity in the USSR (1975-1982): isolation and its end
Connecting perebor conjectures: search to decision reduction for formulas
  • Rahul Ilango
  • Mathematics, Computer Science
  • Computational Complexity Conference
  • 2020
The P versus NP Problem
An Introduction to Kolmogorov Complexity and Its Applications
  • Ming Li, P. Vitányi
  • Computer Science, Psychology
  • Texts and Monographs in Computer Science
  • 1993
Von Neumann, Gödel and Complexity Theory
  • A. Urquhart
  • Mathematics, Computer Science
  • The Bulletin of Symbolic Logic
  • 2010
A Short History of Computational Complexity
Fighting Perebor: New and Improved Algorithms for Formula and QBF Satisfiability
  • R. Santhanam
  • Mathematics, Computer Science
  • 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
  • 2010
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 67 REFERENCES
A Logical Approach to the Problem "P=NP?"
On the Structure of Sets in NP and Other Complexity Classes
Independence Results in Computer Science?
The complexity of theorem-proving procedures
  • S. Cook
  • Mathematics, Computer Science
  • STOC '71
  • 1971
A Formal Theory of Inductive Inference. Part II
The Theory of Automata, a Survey
Observations about the development of theoretical computer science
  • J. Hartmanis
  • Computer Science
  • 20th Annual Symposium on Foundations of Computer Science (sfcs 1979)
  • 1979
Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
...
1
2
3
4
5
...