Search for Author All Reviews
	Fortnow, Lance     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 2 of 2 reviews        Fifty years of P vs. NP and the possibility of the impossible Fortnow L., Fortnow L. Communications of the ACM 65(1): 76-85, 2021.  Type: Article The P versus NP problem is one of the most fundamental and well-known unresolved questions in computer science. In comparison with the 2009 Communications article by the same author [1], the current survey is less about progress...... Jun 27 2022     L-printable sets Fortnow L., Goldsmith J., Mahaney S., Levy M. SIAM Journal on Computing 28(1): 137-151, 1998.  Type: Article One of the central questions of complexity theory is whetherpolynomial-time computations can do something that logarithmicspace-bounded computations cannot do. The typical framework for thisquestion is language recognition, specificall...... Oct 1 1999
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy