Search for Author All Reviews
	Alekhnovich, Michael     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       Pseudorandom generators in propositional proof complexity Alekhnovich M., Ben-Sasson E., Razborov A., Wigderson A. SIAM Journal on Computing 34(1): 67-88, 2005.  Type: Article This paper studies the complexity of the inconsistent statement for a system of Boolean functions (S): g1(x1,...,xn)=...... Aug 4 2005     Mutilated chessboard problem is exponentially hard for resolution Alekhnovich M. Theoretical Computer Science 310(1-3): 513-525, 2004.  Type: Article Simple problems that resist routine logic tempt one to waste time. Often, a clever idea makes a result obvious, but a formal proof takes time and space....... Apr 1 2004
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy