Results 171 to 180 of about 1,150 (221)

Weakly divisible and divisible modules

open access: yesWeakly divisible and divisible modules
openaire  
Some of the next articles are maybe not open access.

Related searches:

Meaningless Divisions

Notre Dame Journal of Formal Logic, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Damián Szmuc, Thomas Macaulay Ferguson
openaire   +2 more sources

Cell division

Nature, 2003
In creating the mitotic spindle and the contractile ring, natural selection has engineered fascinating precision machines whose movements depend upon forces generated by ensembles of cytoskeletal proteins. These machines segregate chromosomes and divide the cell with high fidelity.
Jonathan M, Scholey   +2 more
openaire   +2 more sources

Divided by division

Communications of the ACM, 2013
Is there a "best used by" date for software?
openaire   +1 more source

On a branching model of division-within-division

Mathematical Medicine and Biology, 1999
We consider a deterministic version of a stochastic model for division-within-division processes described by Kimmel (1997, In: Proceedings of the IMA Workshop 'Classical and Modern Branching Processes' (K. Arthreya and P. Jagers, eds.)???? :????). It is shown that the behaviour of the deterministic model can be analyzed by using an associated Markov ...
openaire   +3 more sources

A DIVISION ALGORITHM

Journal of Algebra and Its Applications, 2005
A divisibility test of Arend Heyting, for polynomials over a field in an intuitionistic setting, may be thought of as a kind of division algorithm. We show that such a division algorithm holds for divisibility by polynomials of content 1 over any commutative ring in which nilpotent elements are zero.
openaire   +2 more sources

On Polynomials and Divisibility

The American Mathematical Monthly, 2012
A divisibility condition, together with some kind of boundedness, ensure that a function f : ℤ → ℤ is a polynomial function.
Michael Dorfling, Johan Meyer
openaire   +1 more source

Division is good

20th Annual Symposium on Foundations of Computer Science (sfcs 1979), 1979
We study the power of RAM acceptors with several instruction sets. We exhibit several instances where the availability of the division operator increases the power of the acceptors. We also show that in certain situations parallelism and stochastic features ('distributed random choices') are provably more powerful than either parallelism or randomness ...
openaire   +1 more source

Home - About - Disclaimer - Privacy