MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "On Disjunctive Self-Reducibility." – sorted by Relevance.

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

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

13 documents found, showing 1 through 10. Next 10 →

ATOM

P-Selective Sets, and Reducing Search to Decision vs. Self-Reducibility
by Edith Hemaspaandra, Ashish V. Naik, Mitsunori Ogiwara, Alan L. Selman — 1993
… to decision for L, but L is not self-reducible. (iii) If UE " co-UE 6= E, then there is a disjunctive self-reducible…
Cited by 35 (10 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
… testable sets are in P [GJY93], and that all disjunctively self-reducible sets are in NP [Ko83…
Cited by 26 (6 self) – Add To MetaCart

Characterizing the Learnability of Kolmogorov Easy Circuit Expressions
by Jos'e Balc'azar, Harry Buhrman
…-known to characterize P=NP, via the computation of witnesses provided by the disjunctive self-reducibility…
Cited by 1 (1 self) – Add To MetaCart

Semi-Membership Algorithms: Some Recent Advances
by Derek Denny-brown, Yenjo Han, Lane A. Hemaspaandra, Leen Torenvliet — 1994 — SIGACT News
… of selectivity. SAT is a well-known disjunctive self-reducible set and it has long been known [Sel79,Ko83…
Cited by 14 (8 self) – Add To MetaCart

, and
by Rahul Tripathi
…/p(n) for some polynomial p. An important structural property of SAT is its 2-query disjunctive self-reducibility…
Add To MetaCart

, and
by Rahul Tripathi, P Σp
…. An important structural property of SAT is its 2-query disjunctive self-reducibility. This means that for any…
Add To MetaCart

Selectivity and Self-Reducibility: New Characterizations of Complexity Classes
by Jie Wang — 1994 — Special Issue: Proceedings of the 6th International Conference on Computing and Information
… it is p-time disjunctively self-reducible and p-selective [10][7] and all p-selective, p-time Turing self-reducible…
Cited by 4 (0 self) – Add To MetaCart

Approximable Sets
by Richard Beigel, Martin Kummer, Frank Stephan — 1994 — Information and Computation
… ("disjunctive self-reducible") if M A (x) accepts iff at least one of the queries is answered 2 positively (w…
Cited by 49 (11 self) – Add To MetaCart

Commutative Queries
by Richard Beigel, Richard Chang — 1999
…, if A is disjunctively self-reducible and A t is (2 t \Gamma 1)-enumerable, then A 2 P using a tree…
Cited by 7 (1 self) – Add To MetaCart

Lowness and the Complexity of Sparse and Tally Descriptions
by V. Arvind, J. Köbler, M. Mundhenk, Abteilung Fur Theoretische Informatik, Since R — 1992 — In Proc. 3rd Int'l Symp. on Alg. and Comput
… disjunctive self-reducible set that is many-one reducible to some sparse set is low for \Theta p 2 . Since…
Cited by 4 (2 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

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