AI-complete

Known as: AI-hard, Computational complexity of artificial intelligence, Unsolved problems in artificial intelligence 
In the field of artificial intelligence, the most difficult problems are informally known as AI-complete or AI-hard, implying that the difficulty of… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
One long-term goal of machine learning research is to produce methods that are applicable to reasoning and natural language, in… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
2013
2013
The paper contributes to the development of the theory of AICompleteness by formalizing the notion of AI-Complete, C-Complete and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2012
2012
The paper contributes to the development of the theory of AI-Completeness by formalizing the notion of AIComplete and AI-Hard… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2012
Highly Cited
2012
We present a technique for estimating the spatial layout of humans in still images—the position of the head, torso and arms. The… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Face identification is the problem of determining whether two face images depict the same person or not. This is difficult due to… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Image auto-annotation is an important open problem in computer vision. For this task we propose TagProp, a discriminatively… (More)
  • figure 1
  • table 1
  • figure 2
  • table 2
  • figure 3
Is this relevant?
Highly Cited
2009
Highly Cited
2009
The goal of this paper is to evaluate and compare models and methods for learning to recognize basic entities in images in an… (More)
Is this relevant?
2007
2007
In this paper we present a novel classification of computational problems. Motivated by a theoretical investigation of Artificial… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1992
Highly Cited
1991
Highly Cited
1991
5. M. Green, J. Schwarz, and E. Witten, Superstring theory, Cambridge Univ. Press, 1987. 6. J. Isenberg, P. Yasskin, and P. Green… (More)
Is this relevant?