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

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… Expand
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… Expand
  • table 1
  • table 2
  • table 3
Highly Cited
2013
Highly Cited
2013
  • Roman V Yampolskiy
  • Artificial Intelligence, Evolutionary Computing…
  • 2013
  • Corpus ID: 7880844
The paper contributes to the development of the theory of AI-Completeness by formalizing the notion of AI-Complete, C-Complete… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
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… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Highly Cited
2006
Highly Cited
2006
Spatial assimilation theory predicts that racial and ethnic residential segregation results at least in part from socioeconomic… Expand
  • figure 1
Highly Cited
2004
Highly Cited
2004
This article examines how the concentration of low-income African American students in urban elementary schools is deeply coupled… Expand
  • table 1
Highly Cited
2003
Highly Cited
2003
We introduce captcha, an automated test that humans can pass, but current computer programs can't pass: any program that has high… Expand
  • figure 1
  • figure 2
Highly Cited
1996
Highly Cited
1996
From the Publisher: The nucleus of the Java 2 platform, the Java virtual machine is the technology that enables the Java 2… Expand
  • table 2.1
  • table 2.2
  • table 2.3
  • table 4.1
  • table 4.3
Highly Cited
1996
Highly Cited
1996
A fundamental assumption made by classical AI planners is that there is no uncertainty in the world: the planner has full… Expand
  • figure 11
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… Expand
Review
1990
Review
1990
This article discusses frameworks for studying expertise at the knowledge level and knowledge-use level. It reviews existing… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5