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.

2013

Despite their mostly-unchallenged acceptance in a reasoning agent’s ontology, states, as opposed to events, have raised some…

2010

Today reactor neutrino experiments are at the cutting edge of fundamental research in particle physics. Understanding the…

2009

Problem statement: Knapsack problem is a typical NP complete problem. During last few decades, Knapsack problem has been studied…

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…

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…

1971

In [7], D. Rutledge obtains a product integral representation for a nonexpansive, nonlinear semigroup. In [6], Neuberger gets…

1961