A terminological proposal

@article{Knuth1974ATP,
  title={A terminological proposal},
  author={Donald Ervin Knuth},
  journal={SIGACT News},
  year={1974},
  volume={6},
  pages={12-18}
}
  • D. Knuth
  • Published 1974
  • Mathematics
  • SIGACT News
While preparing a book on combinatorial algorithms, I felt a strong need for a new technical term, a word which is essentially a one-sided version of polynomial complete. A great many problems of practical interest have the property that they are at least as difficult to solve in polynomial time as those of the Cook-Karp class KP. I needed an adjective to convey such a degree of difficulty, both formally and informally; and since the range of practical applications is so broad, I felt it would… 

Internal Differentiation, Comparative Variability, Structural Morphology, Normative Aspect Of Prognostication Of Ipse Dixit Np Hard Problems-A Totalistic Paradigmatic Statement

TLDR
A progressive comparable to Bank's General Ledger is developed, and a General Theory of all the problems under the head of NP hard problems is called, which is a journey to find the final balance which probably never ends like an account never closes.

A Complexity Theory for Feasible Closure Properties

Dynamic Initial Weight Assignment for MaxSAT

TLDR
This research experimentally investigated the performance gains of extending the most recently developed SAT dynamic Initial Weight assignment technique (InitWeight) to handle theMaxSAT problems and showed that the InitWeight technique could be extended to handling partial MaxSAT with minor modifications.

THE GUIDE TO NP-COMPLETENESS IS 40 YEARS OLD: AN HOMAGE TO DAVID S. JOHNSON

TLDR
The popularity of the NP-completeness concept and of its guidebook increased when the P versus NP problem was selected by the Clay Mathematics Institute as one of the seven Millennium Problems to motivate research on important classic dates.

DEGREE BOUNDED GEOMETRIC SPANNING TREES WITH A BOTTLENECK OBJECTIVE FUNCTION

  • Patrick J. Andersen
  • Mathematics, Computer Science
    Bulletin of the Australian Mathematical Society
  • 2019
We introduce the geometric $\delta$-minimum bottleneck spanning tree problem ($\delta$-MBST), which is the problem of finding a spanning tree for a set of points in a geometric space (e.g., the

Cognition and intractability: a guide to classical and parameterized complexity analysis

TLDR
Cognition and Intractability is the first book to provide an accessible introduction to computational complexity analysis and its application to questions of intractability in cognitive science.

A cross-disciplinary introduction to quantum annealing-based algorithms

TLDR
The structure of quantum annealing-based algorithms as well as two examples of this kind of algorithms for solving instances of the max-SAT and Minimum Multicut problems are introduced.

A Comparison of Metaheuristics for the Allocation of Elevators to Calls in Buildings

Bu calisma binalarda dusey tasimacilikta kullanilan asansorler icin cagrilarin kabinlere dagitilmasi problemi uzerinedir.  Genis bir spektrumda farkli sezgisel optimizasyon algoritmalari problem

How Hard Is a Problem

TLDR
To show that P = NP it suffices to find a polynomial time solution for any of the “hardest” problems in NP.

Computing equilibria: a computational complexity perspective

  • T. Roughgarden
  • Computer Science
    Electron. Colloquium Comput. Complex.
  • 2015
TLDR
This survey explains how complexity theory defines “hard problems”; applies these concepts to several equilibrium computation problems; and discusses implications for computation, games, and behavior.