COMPLEXITY DICHOTOMIES FOR COUNTING PROBLEMS - VOLUME 1 (BOOLEAN DOMAIN)

Cai, Jin-Yi; Chen, Xi

ISBN 10: 1107062373 / ISBN 13: 9781107062375

Editore: Cambridge University Press, 2017

Brand New Original US Edition. Customer service! Satisfaction Guaranteed. Codice articolo ASNT3-9603

Riassunto:

A sweeping classification theory for computational counting problems using new techniques and theories.

Informazioni sugli autori: Jin-Yi Cai is Professor of Computer Science and the Steenbock Professor of Mathematical Sciences at the University of Wisconsin, Madison. He studied at Fudan University, Shanghai (class of 77) and at Cornell University, New York, receiving his Ph.D. in 1986. He held faculty positions at Yale University, Connecticut (1986–1989), Princeton University, New Jersey (1989–1993), and State University of New York, Buffalo (1993–2000), where he rose from Assistant Professor to Full Professor in 1996. He received a Presidential Young Investigator Award (1990), an Alfred P. Sloan Fellowship (1994), and a John Simon Guggenheim Fellowship (1998). He is a Fellow of the Association for Computing Machinery (ACM) and the American Association for the Advancement of Science (AAAS).

Xi Chen is Associate Professor of Computer Science at Columbia University, New York. He studied at Tsinghua University and received his Ph.D. in 2007. His research focuses on complexity theory and algorithmic game theory. He is the recipient of a NSF CAREER Award, an Alfred P. Sloan Fellowship (2012), and an European Association for Theoretical Computer Science (EATCS) Presburger Award (2015).

Dati bibliografici

Titolo: COMPLEXITY DICHOTOMIES FOR COUNTING PROBLEMS...
Casa editrice: Cambridge University Press
Data di pubblicazione: 2017
Legatura: Rilegato
Condizione: New