Keyword

AM

Description: AM is a complexity class in computational complexity theory, consisting of decision problems verifiable through an Arthur–Merlin interactive proof system.
Wikidata ID: wiki/Q110989622
OpenAlex ID: keywords/am
2011 · E. Chatzopoulos, J. Craig Wheeler, et al. · The Astrophysical Journal · 81
2007 · Emil Jeřábek · Journal of Symbolic Logic · 77
2003 · Marta Santos, Joaquim Marçalo, et al. · International Journal of Mass Spectrometry · 74
2010 · Jeremiah James Willcock, Torsten Hoefler, et al. · International Conference on Parallel Architectures and Compilation Techniques (PACT) · 68
2018 · Mika Göös, Toniann Pitassi, et al. · Computational Complexity · 58
2010 · Manuel Haschke, Katja Suter, et al. · British Journal of Clinical Pharmacology · 58
2003 · Namjin Kim, N. Kehtarnavaz, et al. · IEEE Transactions on Neural Networks · 54
2002 · Oded Goldreich, Avi Wigderson · Lecture notes in computer science · 50
2009 · Rahul Santhanam · SIAM Journal on Computing · 49
2007 · Shafi Goldwasser, Dan Gutfreund, et al. · ACM Symposium on Theory of Computing (STOC) · 46
2006 · Elmar Böhler, Christian Glaßer, et al. · Journal of Computer and System Sciences · 38
1999 · Fenella Porter · Practical Action Publishing eBooks · 37
2015 · Fefferman, Bill, Kimmel, Shelby · arXiv (Cornell University) · 36
1994 · Ronald V. Book, Jack H. Lutz, et al. · Theory of Computing Systems · 36
2003 · N.K. Vereschchagin · Structure in Complexity Theory Annual Conference · 30
2010 · Marina Petrova, Petri Mahonen, et al. · International Symposium on Wireless Communication Systems · 29
1964 · Aelred Cody · Vetus Testamentum · 28
2004 · D. Gutfreund, R. Shaltiel, et al. · IEEE Conference on Computational Complexity (CCC) · 26
2018 · Laura Dilley, Mara Breen · International Symposium on Tonal Aspects of Languages (TAL) · 24
Works count: 341
Citation count: 1,659
Year
Topic
Type