Complexity Theory

By Eric Allender, Michael C. Loui, Kenneth W. Regan. Computing Handbook, 3rd ed., 2019

294 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/52d540a4c829f0556e96fc830c8697ad11991786

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Thorsten Bernholt

Citations in the corpus

• Robust Estimators are Hard to Compute (2006, background): “Explanations of P, NP and NP-hardness can be found in [14].”
• Exploring Engagement in Tasks in the Language Classroom (2016, unknown): “domains in learning and development (e.g., Adolph & Berger, 2011; Geeslin & Long, 2014; Lantolf, 2012; Larsen-Freeman, 2014; S. Mercer, 2011; Pekrun, Goetz, Titz, & Perry, 2002; Posner & Rothbart, 2000).”