Bounded oracles and complexity classes inside linear space

1986 ◽  
pp. 347-361
Author(s):  
Carol Tretkoff
Keyword(s):  
Linear Space ◽  
Complexity Classes

scholarly journals Uncountable classical and quantum complexity classes

2018 ◽  
Vol 52 (2-3-4) ◽  
pp. 111-126
Author(s):  
Maksims Dimitrijevs ◽  
Abuzer Yakaryılmaz
Keyword(s):  
Linear Space ◽  
Time Constant ◽  
Complexity Classes ◽  
Turing Machines ◽  
Small Space ◽  
Logarithmic Space ◽  
Unary Languages ◽  
Bounded Error ◽  
Counter Machines ◽  
Quantum Complexity

It is known that poly-time constant-space quantum Turing machines (QTMs) and logarithmic-space probabilistic Turing machines (PTMs) recognize uncountably many languages with bounded error (A.C. Cem Say and A. Yakaryılmaz, Magic coins are useful for small-space quantum machines. Quant. Inf. Comput. 17 (2017) 1027–1043). In this paper, we investigate more restricted cases for both models to recognize uncountably many languages with bounded error. We show that double logarithmic space is enough for PTMs on unary languages in sweeping reading mode or logarithmic space for one-way head. On unary languages, for quantum models, we obtain middle logarithmic space for counter machines. For binary languages, arbitrary small non-constant space is enough for PTMs even using only counter as memory. For counter machines, when restricted to polynomial time, we can obtain the same result for linear space. For constant-space QTMs, we obtain the result for a restricted sweeping head, known as restarting realtime.

Processing uncertain information in the linear space of fuzzy sets

1991 ◽  
Vol 44 (2) ◽  
pp. 187-198 ◽  
Author(s):  
Wladyslaw Homenda ◽  
Witold Pedrycz
Keyword(s):  
Fuzzy Sets ◽  
Linear Space ◽  
Uncertain Information

Logical Decision Problems and Complexity of Logic Programs

1987 ◽  
Vol 10 (1) ◽  
pp. 1-33
Author(s):  
Egon Börger ◽  
Ulrich Löwen
Keyword(s):  
Fixed Point ◽  
Computational Complexity ◽  
Decision Problem ◽  
Decision Problems ◽  
Complexity Classes ◽  
Logic Programs ◽  
Finite Structures ◽  
Syntactic Restrictions

We survey and give new results on logical characterizations of complexity classes in terms of the computational complexity of decision problems of various classes of logical formulas. There are two main approaches to obtain such results: The first approach yields logical descriptions of complexity classes by semantic restrictions (to e.g. finite structures) together with syntactic enrichment of logic by new expressive means (like e.g. fixed point operators). The second approach characterizes complexity classes by (the decision problem of) classes of formulas determined by purely syntactic restrictions on the formation of formulas.

scholarly journals Injection of a self-consistent beam with linear space charge force into a ring

2018 ◽  
Vol 21 (12) ◽  
Author(s):  
J. A. Holmes ◽  
T. Gorlov ◽  
N. J. Evans ◽  
M. Plum ◽  
S. Cousineau
Keyword(s):  
Space Charge ◽  
Linear Space ◽  
Self Consistent

scholarly journals Spectral Transformations and Associated Linear Functionals of the First Kind

Axioms ◽  
2021 ◽  
Vol 10 (2) ◽  
pp. 107
Author(s):  
Juan Carlos García-Ardila ◽  
Francisco Marcellán
Keyword(s):  
Orthogonal Polynomials ◽  
Linear Space ◽  
Linear Functional ◽  
Linear Functionals ◽  
Spectral Transformations ◽  
Christoffel Transformation ◽  
Complex Coefficients

Given a quasi-definite linear functional u in the linear space of polynomials with complex coefficients, let us consider the corresponding sequence of monic orthogonal polynomials (SMOP in short) (Pn)n≥0. For a canonical Christoffel transformation u˜=(x−c)u with SMOP (P˜n)n≥0, we are interested to study the relation between u˜ and u(1)˜, where u(1) is the linear functional for the associated orthogonal polynomials of the first kind (Pn(1))n≥0, and u(1)˜=(x−c)u(1) is its Christoffel transformation. This problem is also studied for canonical Geronimus transformations.

Completeness for nondeterministic complexity classes

1991 ◽  
Vol 24 (1) ◽  
pp. 179-200 ◽  
Author(s):  
Harry Buhrman ◽  
Steven Homer ◽  
Leen Torenvliet
Keyword(s):  
Complexity Classes

scholarly journals Fixed points of quasi-nonexpansive mappings

1972 ◽  
Vol 13 (2) ◽  
pp. 167-170 ◽  
Author(s):  
W. G. Dotson
Keyword(s):  
Fixed Points ◽  
Banach Spaces ◽  
Linear Space ◽  
Complex Plane ◽  
Normed Linear Space ◽  
Nonexpansive Mappings ◽  
Common Fixed Points ◽  
The Other ◽  
Commuting Mappings ◽  
Analytic Mappings

A self-mapping T of a subset C of a normed linear space is said to be non-expansive provided ║Tx — Ty║ ≦ ║x – y║ holds for all x, y ∈ C. There has been a number of recent results on common fixed points of commutative families of nonexpansive mappings in Banach spaces, for example see DeMarr [6], Browder [3], and Belluce and Kirk [1], [2]. There have also been several recent results concerning common fixed points of two commuting mappings, one of which satisfies some condition like nonexpansiveness while the other is only continuous, for example see DeMarr [5], Jungck [8], Singh [11], [12], and Cano [4]. These results, with the exception of Cano's, have been confined to mappings from the reals to the reals. Some recent results on common fixed points of commuting analytic mappings in the complex plane have also been obtained, for example see Singh [13] and Shields [10].

Sign in / Sign up

Export Citation Format

Share Document