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

This paper proposes a method for the stabilization of vehicle formations in the plane under a fixed, but not necessarily complete…

2004

In this paper we discuss the nature of the ion conduction pathways in LixRb1−xPO3 glasses. Our investigations are based on a bond…

2003

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

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…

1989

There has been a rapid increase in the availability of computer assisted instruction (CAI) software for teaching oral language…

1988

Let ${\operatorname{SAT}}_ < (\mathbb{N})$ denote the following problem. Instance. A conjunction $\varphi $ of (in)equalities…

1987

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

1961

1952

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