MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Near-Testable Sets." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

10 documents found, showing 1 through 10.

ATOM

On the Size of Classes with Weak Membership Properties
by Marius Zimand
… sets, the class of easily approximable sets, the class of neartestable sets, the class of nearly near-testable…
Cited by 2 (2 self) – Add To MetaCart

On Serializable Languages
by Mitsunori Ogihara — 1994 — University of Rochester, Department of Computer Science
… of nearly near-testable sets. For languages recognized by bottleneck Turing machines with intermediate width…
Cited by 6 (1 self) – Add To MetaCart

The Power of Local Self-Reductions
by Richard Beigel, Howard Straubing — 1995 — In Proceedings of the 10th Structure in Complexity Theory Conference
… to EXP and some of them are p m -complete for EXP [1]. The complexity of near-testable sets is also…
Cited by 3 (0 self) – Add To MetaCart

Reductions to Sets of Low Information Content (Extended Abstract)
by V. Arvind, Y. Han, L. Hemachandra, J. Köbler, A. Lozano, M. Mundhenk, M. Ogiwara, U. Schöning, R. Silvestri, T. Thierauf
… to a sparse set, then Mod k P = P. For nearly near-testable sets [HH91], the class of sets that have…
Add To MetaCart

Strong Self-Reducibility Precludes Strong Immunity
by Lane A. Hemaspaandra, Marius Zimand — 1995
… separation from P possible for the class NT (the "near-testable" sets [GJY87,GHJY91]). We show that NT is P…
Cited by 4 (3 self) – Add To MetaCart

Sets Computable in Polynomial Time on Average
by Rainer Schuler, Tomoyuki Yamakami — 1995
…, Corollary 8 implies that SPARSE " PP-comp 6` P. We denote by NT the collection of near-testable sets, where…
Cited by 9 (3 self) – Add To MetaCart

Towards a Measure for P
by Eric Allender, Martin Strauss — 1994
…-reducible sets (in fact, near-testable sets [GH]) that are bi-immune to P. However, all of our attempts…
Cited by 1 (0 self) – Add To MetaCart

P-selective Self-reducible sets: A New Characterization of P
by Harry Buhrman, Leen Torenvliet — 1996 — In Proceedings of the 8th Structure in Complexity Theory Conference
…, interest has shifted from P to classes `near' P , and classes of 1 sets as `near-testable' [GHJY91], `p…
Cited by 26 (6 self) – Add To MetaCart

Polynomial-Time Semi-Rankable Sets
by Lane A. Hemaspaandra, Mohammed J. Zaki, Marius Zimand — 1995 — Special Issue: Proceedings of the 8th International Conference on Computing and Information
… relative to which they are not in d EL 2 . We also observe that the nearly near-testable sets [HH91] also…
Cited by 4 (4 self) – Add To MetaCart

Universally Serializable Computation
by Lane A. Hemaspaandra, Mitsunori Ogihara — 1996
…]. Let NNT denote the nearly near-testable sets [HH91], the class of sets L having a polynomial…
Cited by 2 (2 self) – Add To MetaCart

Showing 1 through 10.

ATOM

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB