Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
The recently introduced series of description logics under the common moniker 'DL-Lite' has attracted attention of the… Expand
  • table 1
  • figure 1
  • figure 2
  • table 2
  • figure 3
Review
2004
Review
2004
  • H. Choset
  • Annals of Mathematics and Artificial Intelligence
  • 2004
  • Corpus ID: 23835708
This paper surveys recent results in coverage path planning, a new path planning approach that determines a path for a robot to… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Review
2002
Review
2002
Empirical software engineering research needs research guidelines to improve the research and reporting processes. We propose a… Expand
Highly Cited
2002
Highly Cited
2002
Within the information systems field, the task of conceptual modeling involves building a representation of selected phenomena in… Expand
  • figure 1
  • table 1
  • table 2
Highly Cited
2000
Highly Cited
2000
  • Peter Bürgisser
  • Algorithms and computation in mathematics
  • 2000
  • Corpus ID: 118738946
1 Introduction.- 2 Valiant's Algebraic Model of NP-Completeness.- 3 Some Complete Families of Polynomials.- 4 Cook's versus… Expand
Review
1998
Review
1998
Foreword. Preface to Second Edition. Preface. 1. Getting Started. An Iterative Software Process. An Example Project. The Project… Expand
Highly Cited
1997
Highly Cited
1997
When looking at a scene, observers feel that they see its entire structure in great detail and can immediately notice any changes… Expand
  • figure 2
  • figure 3
Highly Cited
1991
Highly Cited
1991
Many phenomena from physics, control theory, and economics have been successfully described by differential equations with… Expand
Highly Cited
1988
Highly Cited
1988
It is no more useful for researchers to acknowledge simply that subjectivity is an invariable component of their research than it… Expand
Highly Cited
1983
Highly Cited
1983
An algorithm is described which is capable of solving certain word problems: i.e. of deciding whether or not two words composed… Expand