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={Boris A. Trakhtenbrot},
journal={Annals of the History of Computing},
year={1984},
volume={6},
pages={384-400}
}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…
261 Citations
A Brief History of NP-Completeness, 1954-2012
- Linguistics
- 2012
This chapter shall briefly sketch the history and pre-history of NP-completeness, and provide a brief personal survey of the developments in the theory over the last 40 years and their impact (or lack thereof) on the practice and theory of optimization.
The history and status of the P versus NP question
- Computer ScienceSTOC '92
- 1992
The P versus NP question grew out of developments in mathematical logic and electronic technology during the middle part of the twentieth century. It is now considered to be one of the most important…
The importance of the P versus NP question
- MathematicsJACM
- 2003
The P versus NP problem is to determine whether every language accepted by some nondeterministic Turing machine in polynomial time is also accepted by some deterministic Turing machine in polynomial…
Kolmogorov complexity in the USSR (1975-1982): isolation and its end
- Computer ScienceArXiv
- 2019
These reminiscences are about the "dark ages" of algorithmic information theory in the USSR. After a great interest in this topic in 1960s and the beginning of 1970s the number of people working in…
Connecting perebor conjectures: search to decision reduction for formulas
- Computer Science, MathematicsComputational Complexity Conference
- 2020
The main idea behind the algorithms is in some sense a "reverse application" of the gate elimination technique, which makes progress in connecting the search and decision complexity of minimizing formulas.
The P versus NP Problem
- Computer ScienceArXiv
- 2010
P is a robust class and has equivalent definitions over a large class of computer models because Turing machines, the standard computer model in computability theory, are defined in terms of Turing machines.
An Introduction to Kolmogorov Complexity and Its Applications
- Computer ScienceTexts and Monographs in Computer Science
- 1993
The book presents a thorough treatment of the central ideas and their applications of Kolmogorov complexity with a wide range of illustrative applications, and will be ideal for advanced undergraduate students, graduate students, and researchers in computer science, mathematics, cognitive sciences, philosophy, artificial intelligence, statistics, and physics.
Von Neumann, Gödel and Complexity Theory
- PhilosophyThe Bulletin of Symbolic Logic
- 2010
Abstract Around 1989, a striking letter written in March 1956 from Kurt Gödel to John von Neumann came to light. It poses some problems about the complexity of algorithms; in particular, it asks a…
A Short History of Computational Complexity
- Computer ScienceBull. EATCS
- 2003
It all started with a machine and the first notion of efficient computation by using time polynomial in the input size led to complexity’s most important concept, NP-completeness, and its most fundamental question, whether P = NP.
Fighting Perebor: New and Improved Algorithms for Formula and QBF Satisfiability
- Computer Science, Mathematics2010 IEEE 51st Annual Symposium on Foundations of Computer Science
- 2010
It is shown that every function computable by linear-size formulae can be represented by decision trees of size $2^{n - \Omega(n)}$.
References
SHOWING 1-10 OF 67 REFERENCES
A Logical Approach to the Problem "P=NP?"
- MathematicsMFCS
- 1980
The Main Result of this paper states, for some natural theory T, unprovability of the assertion on exponential lower time complexity bound of acceptin6 NP-sets.
The consistency of "P = NP" and related problems with fragments of number theory
- MathematicsSTOC '80
- 1980
The main results of this paper demonstrate the consistency of “P &equil; NP” and a variant of “NP @@@@ coNP” with certain natural fragments of number theory to be defined precisely in the sequel.@@@@…
The complexity of theorem-proving procedures
- Mathematics, Computer ScienceSTOC
- 1971
It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a…
Observations about the development of theoretical computer science
- Education20th Annual Symposium on Foundations of Computer Science (sfcs 1979)
- 1979
A personal account of some developments in automata theory and computational complexity theory and discusses the underlying beliefs and philosophy which guided this research as well as the intellectual environment and the ideas and contacts which influenced it.
THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- Computer Science
- 1970
The present article is a survey of the fundamental results connected with the concept of complexity as the minimum number of binary signs containing all the information about a given object that are sufficient for its recovery (decoding).
Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
- Mathematics, Computer Science
- 1975
Relativized versions of the open question of whether every language accepted nondeterministically in polynomial time can be recognized deterministic in poynomial time are investigated.