Search for Author All Reviews
	Sudan, Madhu     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 5 of 7 reviews       Probabilistically checkable proofs Sudan M. Communications of the ACM 52(3): 76-84, 2009.  Type: Article If a mathematical proof can be lengthy, verifying its validity may turn out to be almost as complex. Sudan offers a brief review of an alternative procedure to analyze mathematical proofs, using probabilistic algorithms. His explanatio...... May 7 2009     Complexity classifications of Boolean constraint satisfaction problems Creignou N., Khanna S., Sudan M., Society for Industrial and Applied Mathematics, Philadelphia, PA, 2001. 106 pp.  Type: Book (9780898714791) Satisfiability (SAT) solvers are algorithms that determine whether or not there exist assignments to Boolean variables such that conditions in those variables yield TRUE. These algorithms are now part of the program verification/softwa...... Jun 12 2007     Derandomization of auctions Aggarwal G., Fiat A., Goldberg A., Hartline J., Immorlica N., Sudan M.  Theory of computing (Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, Baltimore, MD, May 22-24, 2005) 619-625, 2005.  Type: Proceedings In a single-round, sealed-bid auction, every bidder, independently, submits a single bid without seeing the bids of others. One talks about unlimited supply, unit-demand auctions when an infinite number of items is for sale, and every ...... Jul 31 2006     Gadgets, approximation, and linear programming Trevisan L., Sorkin G., Williamson D., Sudan M. SIAM Journal on Computing 29(6): 2074-2097, 2000.  Type: Article The goal of this work, in which combinatorial optimization problems are addressed, is to assign values to Boolean variables in order to satisfy as many constraints as possible and, specifically, to maximize the sum of some Boolean func...... Jan 1 2001     Approximate graph coloring by semidefinite programming Karger D., Motwani R., Sudan M. Journal of the ACM 45(2): 246-265, 1998.  Type: Article The authors approach the coloring problem, which is known to be NP-hard, by finding an approximate optimum graph coloring. They relax the coloring problem by assigning unit vectors to graph vertices instead of assigning colors, and the...... Jul 1 1998     Display 510152550100 per column
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy