J. Hartmanis and L.A. Hemachandra (1987). One-way functions, robustness and nonisomorphism of NP-complete classes. Tech. Rep. DCS TR86-796, Cornell University. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On the Monte Carlo Boolean Decision Tree Complexity of Read-Once.. - Santha (1991) (6 citations) (Correct)
....are also called Monte Carlo complexity, and the zero error randomized complexity is called Las Vegas complexity. For every p; we have the following obvious relationships between these complexity measures: R p 2 (f) R p 1 (f) R(f) D(f) Blum and Impagliazzo [1] Hartmanis and Hemachandra [3], and Tardos [11] observed independently that there is at most a quadratic gap between the deterministic complexity and the Las Vegas complexity. More precisely, for every f we have D(f) R(f) 2 : Nisan [7] showed that the deterministic complexity can not exceed more than polynomially the ....
J. Hartmanis and L. Hemachandra (1987), One-way functions, robustness, and non-isomorphism of NP -complete sets, Proceedings of 2nd Structure in Complexity Theory, 160-173.
On P versus NP∩co-NP for Decision Trees and.. - Jukna, Razborov.. (1997) (Correct)
....both can be computed by Sigma p 3 circuits whereas the minimal 1 b.p. computing f has quasipolynomial size (Theorem 3.4) 1 This result is not stated explicitly in [6] so we describe it more precisely in Theorem 2.1 below. For the analogous result about the depth of decision trees see [4, 9, 17]. 2 2 Decision Trees In this section we establish the announced bounds for decision trees. Recall that a (deterministic) decision tree is a binary tree whose internal nodes have labels from f1; ng and whose leaves have labels from f0; 1g. If a node has label i then one of the outgoing ....
J. Hartmanis and L.A. Hemachandra (1987). One-way functions, robustness and nonisomorphism of NP-complete classes. Tech. Rep. DCS TR86-796, Cornell University.
On P versus NP∩co-NP for Decision Trees and.. - Jukna, Razborov.. (1997) (Correct)
No context found.
J. Hartmanis and L.A. Hemachandra (1987). One-way functions, robustness and nonisomorphism of NP-complete classes. Tech. Rep. DCS TR86-796, Cornell University.
A Tight Relationship between Generic Oracles and Type-2 .. - Cook, Impagliazzo.. (1997) (Correct)
No context found.
Hartmanis, J., and Hemachandra, L. A. (1987), One-way functions, robustness, and the non-isomorphism of NP-complete sets, in "Proceedings, 2nd Conference on Structure in Complexity Theory", pp. 160--174.
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