Complexity Dichotomies for Counting Problems: Boolean Domain - Hardcover

Jin-Yi Cai , Xi Chen

Hardcover

ISBN 10: 1107062373 ISBN 13: 9781107062375

Verlag: Cambridge University Press, 2017

Inhaltsangabe

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

Über diesen Titel

Über die Autorinnen und Autoren

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).

Details zur Ausgabe

• Verlag: Cambridge University Press
• Erscheinungsdatum: 2017
• Sprache: Englisch
• ISBN 10: 1107062373
• ISBN 13: 9781107062375
• Einband: Gebundene Ausgabe
• Anzahl der Seiten: 320
• Kontakt zum Hersteller: Nicht verfügbar
• Verantwortliche Person: Avery; https://www.avery.fr/; ; chemin des peupliers 27; Dardilly; Frankreich