Query complexity of membership comparable sets

Authors:
Till Tantau
Affiliations:
Fakultät IV - Elektrotechnik und Informatik, Technische Universität Berlin, Franklinstraße 28/29, 10587 Berlin, Germany
Venue:
Theoretical Computer Science
Year:
2003

Citing 8
Cited 1

Query-limited reducibilities

Query-limited reducibilities
Approximable sets

Information and Computation
Polynomial-time Membership Comparable Sets

SIAM Journal on Computing
Quasi-linear truth-table reductions to p-selective sets

Theoretical Computer Science
Reducibility classes of P-selective sets

Theoretical Computer Science
Reconstructing Algebraic Functions from Mixed Data

SIAM Journal on Computing
On membership comparable sets

Journal of Computer and System Sciences
Some connections between nonuniform and uniform complexity classes

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing

Partial information classes

ACM SIGACT News

Quantified Score

Hi-index	5.23

Visualization

Abstract

Episturmian morphisms generalize Sturmian morphisms. Here, we study some intrinsic properties of these morphisms: invertibility, presentation, cancellativity, unitarity, characterization by conjugacy. Most of them are generalizations of known properties ...