Results 251 to 260 of about 15,334 (300)
Some of the next articles are maybe not open access.
REDUCIBILITY AND UNIFORM REDUCIBILITY OF ALGEBRAIC OPERATIONS
Mathematics of the USSR-Sbornik, 1974This paper is devoted to a study of the conditions under which one algebraic operation can be expressed in terms of others by some arrangement of parentheses. The terminology is mainly that of Frenkin (MR 44 #6888). It is shown that the class of ?-reducible n-groupoids is axiomatizable, but not elementary, and the class of ?-uniformly reducible n ...
openaire +2 more sources
Periodica Mathematica Hungarica, 2000
In general, to decide if a given polynomial is irreducible or not is a difficult problem, however, several results have been established for families of polynomials. Among those results, one finds Capelli's theorem, see \textit{A. Schinzel} [Polynomials with special regard to reducibility, Encyclopedia of Mathematics and its Applications 77, Cambridge ...
openaire +3 more sources
In general, to decide if a given polynomial is irreducible or not is a difficult problem, however, several results have been established for families of polynomials. Among those results, one finds Capelli's theorem, see \textit{A. Schinzel} [Polynomials with special regard to reducibility, Encyclopedia of Mathematics and its Applications 77, Cambridge ...
openaire +3 more sources
Journal of Optimization Theory and Applications, 2007
The notions of exhaustive families of upper convex and lower concave approximations (in the sense of B. N. Pschenichnyi) were introduced by A. M. Rubinov. For some classes of nonsmooth functions, these tools appeared to be very productive and constructive.
openaire +2 more sources
The notions of exhaustive families of upper convex and lower concave approximations (in the sense of B. N. Pschenichnyi) were introduced by A. M. Rubinov. For some classes of nonsmooth functions, these tools appeared to be very productive and constructive.
openaire +2 more sources
A New Reducibility between Turing‐ and wtt‐Reducibility
Mathematical Logic Quarterly, 1994AbstractA new reducibility between Turing and weak truth‐table reducibility is defined, which gives an affirmative answer to the open question about the existence of such an intermediate reducibility proposed formally by M. Stob.Mathematics Subject Classification: 03D25.
openaire +2 more sources
Journal of Symbolic Logic, 1983
We see far away, Newton said, if we stand on giants' shoulders. We take him seriously here and moreover (as appropriate to recursion-theorists) we will jump from one giant to another, since this paper is mostly an exegesis of two fundamental works: Feferman's Some applications of the notions of forcing and generic sets [4] and Sacks' Forcing with ...
openaire +3 more sources
We see far away, Newton said, if we stand on giants' shoulders. We take him seriously here and moreover (as appropriate to recursion-theorists) we will jump from one giant to another, since this paper is mostly an exegesis of two fundamental works: Feferman's Some applications of the notions of forcing and generic sets [4] and Sacks' Forcing with ...
openaire +3 more sources
Mathematical Logic Quarterly, 2020
AbstractWe introduce agreement reducibility and highlight its major features. Given subsets A and B of , we write if there is a total computable function satisfying for all , .We shall discuss the central role plays in this reducibility and its connection to strong‐hyper‐hyper‐immunity.
Rachel Epstein, Karen M. Lange
openaire +3 more sources
AbstractWe introduce agreement reducibility and highlight its major features. Given subsets A and B of , we write if there is a total computable function satisfying for all , .We shall discuss the central role plays in this reducibility and its connection to strong‐hyper‐hyper‐immunity.
Rachel Epstein, Karen M. Lange
openaire +3 more sources
Epilepsy Research, 2002
Although treatment of epilepsy easily evolves into a situation of overtreatment, reversing the process can be difficult and time consuming. Benefits of reducing overtreatment may include a decrease in side effects, better seizure control, a simplification in the medication regimen, improved compliance, and reduced costs.
openaire +2 more sources
Although treatment of epilepsy easily evolves into a situation of overtreatment, reversing the process can be difficult and time consuming. Benefits of reducing overtreatment may include a decrease in side effects, better seizure control, a simplification in the medication regimen, improved compliance, and reduced costs.
openaire +2 more sources
BMJ, 2009
Hawkes emphasises the widening in health inequalities with the increasing inequality in absolute income.1 People in the most deprived areas live in the poorest quality housing with poor insulation. Thus heating the house, even inadequately, takes a disproportionate percentage of an already low income.
openaire +2 more sources
Hawkes emphasises the widening in health inequalities with the increasing inequality in absolute income.1 People in the most deprived areas live in the poorest quality housing with poor insulation. Thus heating the house, even inadequately, takes a disproportionate percentage of an already low income.
openaire +2 more sources
Reducing risk, reducing pollution
2010“We aren't passengers on Spaceship Earth; we're the crew. We aren't residents of this planet; we're citizens. The difference in both cases is responsibility.” Astronaut Rusty Schweikart Some pollution problems are daunting; others less so. This chapter begins with a brief overview as to how we can separate the “trivial” from the serious, whether the
openaire +1 more source
2015
In the Map-Reduce programming model for data parallel computation, a reducer computes an output from a list of input values associated with a key. The inputs however may not arrive at a reducer in a fixed order due to non-determinism in transmitting key-value pairs over the network.
Yu-Fang Chen 0001 +3 more
openaire +1 more source
In the Map-Reduce programming model for data parallel computation, a reducer computes an output from a list of input values associated with a key. The inputs however may not arrive at a reducer in a fixed order due to non-determinism in transmitting key-value pairs over the network.
Yu-Fang Chen 0001 +3 more
openaire +1 more source