S. Jukna, Finite limits and monotone computations: the lower bounds criterion. In: Proc. of the 12th IEEE Conf. on Comput. Complexity , (1997), 302-313. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Higher Lower Bounds On Monotone Size - Harnik, Raz (2000) (1 citation) (Correct)
.... [AmMa96] BeUl97] SiTs97] However, Haken s work inspired a new symmetric version of the method of approximations, that generates simpler proofs to the previous bounds for the Clique function and Andreev s function ( AmMa96] BeUl97] Another way to present Haken s method was derived by Jukna [Ju97], this time as a criterion for lower bounds. All of the methods mentioned, as well as the one that we are about to present here are equivalent to the method of approximations. Unfortunately, this means that they cannot be used to prove super linear lower bounds in the general (non monotone) ....
S. Jukna, Finite limits and monotone computations: the lower bound criterion, Proc. of the 12th IEEE Conference on Computational Complexity (1997), pp. 302--312.
Separation of the Monotone NC Hierarchy - Raz, McKenzie (1999) (14 citations) (Correct)
....every i 1, monotone NC i 6= monotone NC i 1 . 1.1 Relevance of Monotone Complexity Monotone complexity has always attracted many researchers. Since the result of [Ra85a] many papers on monotone complexity have appeared, and this includes many interesting papers in the last 3 years (e.g. [Ya94, GoHa95, Ha95, AmMa96, BeUl97, SiTs97, Ju97]) Is monotone complexity research useful Although the separation results of [Ra85a] and [KaWi88] are among the most famous and most impressive results in complexity theory, it is still under debate whether monotone complexity is worth pursuing. Indeed, by the results of [Ra85b, Ta88] the ....
S. Jukna, Finite limits and monotone computations: the lower bound criterion, Preprint 1997.
Combinatorics of Monotone Computations - Jukna (1998) (1 citation) Self-citation (Jukna) (Correct)
No context found.
S. Jukna, Finite limits and monotone computations: the lower bounds criterion. In: Proc. of the 12th IEEE Conf. on Comput. Complexity , (1997), 302-313.
Combinatorics of Monotone Computations - Jukna (1998) (1 citation) Self-citation (Jukna) (Correct)
No context found.
S. Jukna, Finite limits and monotone computations: the lower bounds criterion. In: Proc. of the 12th IEEE Conf. on Comput. Complexity , (1997), 302-313.
Monotone Complexity by Switching Lemma - Harnik, Raz (Correct)
No context found.
S. Jukna, Finite limits and monotone computations: the lower bound criterion, Proc. of the 12th IEEE Conference on Computational Complexity (1997), pp. 302--312.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC