article

A note on closure properties of logspace MOD classes

Authors:

Ulrich Hertrampf,

Steffen Reith,

Heribert VollmerAuthors Info & Claims

Information Processing Letters, Volume 75, Issue 3

Pages 91 - 93

https://doi.org/10.1016/S0020-0190(00)00091-0

Published: 31 August 2000 Publication History

Abstract

No abstract available.

Cited By

View all

De Beaudrap N(2018)A linearized stabilizer formalism for systems of finite dimensionQuantum Information & Computation10.5555/2481591.248159713:1-2(73-115)Online publication date: 27-Dec-2018
https://dl.acm.org/doi/10.5555/2481591.2481597
Blondin MKrebs AMckenzie P(2018)The complexity of intersecting finite automata having few final statesComputational Complexity10.1007/s00037-014-0089-925:4(775-814)Online publication date: 26-Dec-2018
https://dl.acm.org/doi/10.1007/s00037-014-0089-9
Creignou NMeier AVollmer HThomas M(2012)The Complexity of Reasoning for Fragments of Autoepistemic LogicACM Transactions on Computational Logic (TOCL)10.1145/2159531.215953913:2(1-22)Online publication date: 1-Apr-2012
https://dl.acm.org/doi/10.1145/2159531.2159539
Show More Cited By

Index Terms

A note on closure properties of logspace MOD classes
1. Theory of computation

Recommendations

The closure properties on real numbers under limits and computable operators

In effective analysis, various classes of real numbers are discussed. For example, the classes of computable, semi-computable, weakly computable, recursively approximable real numbers, etc. All these classes correspond to some kind of (weak) ...
On the structure of low sets [complexity classes]
SCT '95: Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)

Over a decade ago, V. Schoning introduced the concept of lowness into structural complexity theory. Since then a large body of results has been obtained classifying various complexity classes according to their lowness properties. In this paper we ...
On decidability and closure properties of language classes with respect to bio-operations

We present general results that are useful in showing closure and decidable properties of large classes of languages with respect to biologically-inspired operations. We use these results to prove new decidability results and closure properties of some ...

Comments

Information & Contributors

Information

Published In

Information Processing Letters Volume 75, Issue 3

Aug. 31, 2000

44 pages

ISSN:0020-0190

Editors:
F. Dehne
Carleton Univ., Ott., Canada
,
D. Gries
Univ. of Georgia, Atehns, GA
,
W. M. Turski
Warsaw Univ., Warsaw, Poland

Issue’s Table of Contents

Publisher

Elsevier North-Holland, Inc.

United States

Publication History

Published: 31 August 2000

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 25 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

De Beaudrap N(2018)A linearized stabilizer formalism for systems of finite dimensionQuantum Information & Computation10.5555/2481591.248159713:1-2(73-115)Online publication date: 27-Dec-2018
https://dl.acm.org/doi/10.5555/2481591.2481597
Blondin MKrebs AMckenzie P(2018)The complexity of intersecting finite automata having few final statesComputational Complexity10.1007/s00037-014-0089-925:4(775-814)Online publication date: 26-Dec-2018
https://dl.acm.org/doi/10.1007/s00037-014-0089-9
Creignou NMeier AVollmer HThomas M(2012)The Complexity of Reasoning for Fragments of Autoepistemic LogicACM Transactions on Computational Logic (TOCL)10.1145/2159531.215953913:2(1-22)Online publication date: 1-Apr-2012
https://dl.acm.org/doi/10.1145/2159531.2159539
Datta SKulkarni RLimaye NMahajan M(2010)Planarity, Determinants, Permanents, and (Unique) MatchingsACM Transactions on Computation Theory10.1145/1714450.17144531:3(1-20)Online publication date: 1-Mar-2010
https://dl.acm.org/doi/10.1145/1714450.1714453
Datta SKulkarni RLimaye NMahajan M(2007)Planarity, determinants, permanents, and (unique) matchingsProceedings of the Second international conference on Computer Science: theory and applications10.5555/2391910.2391924(115-126)Online publication date: 3-Sep-2007
https://dl.acm.org/doi/10.5555/2391910.2391924

Abstract

Cited By

Index Terms

Recommendations

The closure properties on real numbers under limits and computable operators

On the structure of low sets [complexity classes]

On decidability and closure properties of language classes with respect to bio-operations

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations