Search for Author All Reviews
	Krause, Matthias     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       Geometric arguments yield better bounds for threshold circuits and distributed computing Krause M. Theoretical Computer Science 156(1-2): 99-117, 1996.  Type: Article Krause presents a technique to establish minimal computational requirements (lower bounds) for evaluating Boolean functions f : { 0 , 1 } n × { 0 , 1 } n &...... Jun 1 1997     Separating the eraser Turing machine classes Le, NLe, co-NLe and Pe Krause M., Meinel C., Waack S. Theoretical Computer Science 86(2): 267-275, 1991.  Type: Article The authors have studied many variants of branching programs in a series of papers. Here, they study read-once branching programs, corresponding to logarithmic space-bounded Turing machines that erase each input bit after reading it (e...... Jul 1 1992
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy