#### Filter Results:

- Full text PDF available (5)

#### Publication Year

1992

2012

- This year (0)
- Last 5 years (1)
- Last 10 years (3)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Yenjo Han, Lane A. Hemaspaandra, Thomas Thierauf
- SIAM J. Comput.
- 1993

Threshold machines are Turing machines whose acceptance is determined by what portion of the machine's computation paths are accepting paths. Probabilistic machines are Turing machines whose acceptance is determined by the probability weight of the machine's accepting computation paths. In 1975, Simon proved that for unbounded-error polynomial-time machines… (More)

- Vikraman Arvind, Yenjo Han, +7 authors Thomas Thierauf
- Complexity Theory: Current Research
- 1992

In this paper we study the complexity of sets that reduce to sparse sets (and tally sets), and the complexity of the simplest sparse sets to which such sets reduce. We show even with respect to very exible reductions that NP cannot have sparse hard sets unless P = NP; an immediate consequence of our results is: If any NP-complete set conjunctively reduces… (More)

- Derek Denny-Brown, Yenjo Han, Lane A. Hemaspaandra, Leen Torenvliet
- SIGACT News
- 1994

A semi-membership algorithm for a set <i>A</i> is, informally, a program that when given any two strings determines which is logically more likely to be in <i>A</i>. <i>A</i> flurry of interest in this topic in the late seventies and early eighties was followed by a relatively quiescent half-decade. However, in the 1990s there has been a resurgence of… (More)

- Yenjo Han, Lane A. Hemaspaandra
- Journal of Cryptology
- 1995

Allender [2] showed that if there are dense P languages containing only a finite set of Kolmogorov-simple strings, then all pseudorandom generators are insecure. We extend this by proving that if there are dense P (or even BPP) languages containing only a sparse set of Kolmogorov-simple strings, then all pseudorandom generators are insecure.

- Yenjo Han, Thomas Thierauf
- Structure in Complexity Theory Conference
- 1995

We investigate classes of sets that can be decided by bounded truth-table reductions to an NP set in which evaluators do not have full access to the answers to the queries but get only restricted information such as the number of queries that are in the oracle set or even just this number modulo m, for some m 2. We also investigate the case in which… (More)

- Junwook Kwak, Sechul Shin, +6 authors Jin Seok
- 2009 International Conference on Information…
- 2009

Windows Servers for sever-based computing are usually organized with many servers, regardless of the applications. Because more server systems require higher management cost, powerful and easily usable tools are mandatory to manage massive numbers of Windows Servers. In this paper, we present a very flexible management environment that is able to organize… (More)

- Heejun Shim, Minwook Ahn, JinSae Jung, Yenjo Han, Soojung Ryu
- MTV
- 2012

I just attended the 9th Structure in Complexity Theory Conference, which was in Amsterdam this year. 100% of the rst three papers in the proceedings ;?) were devoted to the study of semi-membership algorithms! In fact, during the last half-decade, there has been a marked surge of interest in semi-membership algorithms. The article below surveys some of the… (More)

- ‹
- 1
- ›