DNA Computing: New Ideas and Paradigms
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Some Theorems Concerning the Core Function
Concurrency, Graphs and Models
The status of the P versus NP problem
Communications of the ACM - The Status of the P versus NP Problem
Automated deduction for verification
ACM Computing Surveys (CSUR)
On optimal algorithms and optimal proof systems
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
From logic to theoretical computer science: an update
Pillars of computer science
Boris A. Trakhtenbrot: academic genealogy and publications
Pillars of computer science
A novel strategy for multi-resource load balancing in agent-based systems
International Journal of Intelligent Information and Database Systems
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
Journal of Computer and System Sciences
Optimal acceptors and optimal proof systems
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
The legacy of turing in numerical analysis
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
A parameterized halting problem
The Multivariate Algorithmic Revolution and Beyond
Inductive complexity of p versus NP problem
UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation
| Hi-index | 0.01 |
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.