Complete (complexity)

Known as: Complete problem, Hard (complexity)

In computational complexity theory, a computational problem is complete for a complexity class if it is, in a technical sense, among the "hardest…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2009

We look at composition of (possibly nonterminating) high-level programs over situation calculus action theories. Specifically the…

2003

Unmanaged Internet Protocol (UIP) is a fully selforganizing network-layer protocol that implements scalable identity-based…

2002

M(atrix) theory is known to be mass-deformed in the pp-wave background and still retains all 16 dynamical supersymmetries. We…

2002

We calculate spatial localization and phase properties of spontaneously emitted photons. Our model is simple yet fully quantized…

2000

Abstract. Communication is an interactive, complex, structured process involving agents that are capable of drawing conclusions…

1991

1 In his 1949 paper, "The completeness of the first-order calculus", Henkin developed what is now called the method of…

1987

Classification constraints are rules for assigning access classes to data when they are entered into a database. In order that a…

1961

1955

Certain aspects of the C.B.R. test procedure and design standards are discussed and certain modifications are proposed with the…

1952

The first spectra of helium, neon, argon, krypton, and xenon, excited by discharges in Geissler tubes, operated by direct…