Skip to search formSkip to main contentSkip to account menu

R (complexity)

Known as: R (complexity class), R (disambiguation) 
In computational complexity theory, R is the class of decision problems solvable by a Turing machine, which is the set of all recursive languages.
Wikipedia (opens in a new tab)

Related topics

Related topics

10 relations
Computable functionComputational complexity theoryDecision problemELEMENTARY

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
On the problem of existence in principal value of a Calderón–Zygmund operator on a space of non‐homogeneous type
In this paper, we study the relationship between two fundamental regularity properties of an s ‐dimensional Calderón–Zygmund… 
2018
2018
Pointed Closed Convex Sets are the Intersection of All Rational Supporting Closed Halfspaces
We prove that every pointed closed convex set in $\mathbb{R}^n$ is the intersection of all the rational closed halfspaces that… 
2015
2015
Derivations with power values on multilinear polynomials
A polynomial   1 2 ( , , , ) n f X X X is called multilinear if it is homogeneous and linear in every one of its variables… 
2010
2010
Geometric analysis on small unitary representations of GL(N,R)
2006
2006
The existence of positive solution and bounded oscillation for even-order neutral differential equations with unstable type
2006
2006
The compactificability classes: The behavior at infinity
We study the behavior of certain spaces and their compactificability classes at infinity. Among other results we show that every… 
2000
2000
Separation of Orbits under Group Actions with an Application to Quantum Systems
Abstract. Motivated by the task to decide whether two quantum states are equally entangled we consider the orbits under the… 
Highly Cited
1996
Highly Cited
1996
Estimates in L^p for magnetic Schrodinger operators
We study the magnetic Schrödinger operator H(a,V ) in R, n ≥ 3. The L (1 < p < ∞) and weak-type (1,1) estimates are obtained… 
1996
1996
ON k-REFLEXIVE REPRESENTATIONS OF ALGEBRAS
Module theoretic methods are employed to obtain simple proofs of extensions of two theorems of E. A. Azoff regarding the… 
Review
1985
Review
1985
On the ideals of a Noetherian ring
We construct various examples of Noetherian rings with peculiar ideal structure. For example, there exists a Noetherian domain R… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)