Results 241 to 250 of about 25,607 (285)
Some of the next articles are maybe not open access.
2006
Receipt-freeness is the property of voting protocols that a voter cannot create a receipt which proves how she voted. Since Benaloh and Tuinstra introduced this property, there has been a large amount of work devoted to the construction of receipt-free voting protocols.
Jonker, H.L., Vink, de, E.P.
openaire +1 more source
Receipt-freeness is the property of voting protocols that a voter cannot create a receipt which proves how she voted. Since Benaloh and Tuinstra introduced this property, there has been a large amount of work devoted to the construction of receipt-free voting protocols.
Jonker, H.L., Vink, de, E.P.
openaire +1 more source
A Hopf Algebra Freeness Theorem
American Journal of Mathematics, 1989The authors prove the conjecture that every finite-dimensional Hopf algebra H over a field k is a free (left or right) module over any Hopf subalgebra B. This was first proved by the second author in the case when \(B=kG\), G the group of group-like elements, is semi-simple [J.
Nichols, Warren D., Zoeller, M. Bettina
openaire +1 more source
Theoretical Computer Science, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Robert Mercas
exaly +3 more sources
Proceedings of the forty-fifth annual ACM symposium on Theory of Computing, 2013
Testing a property P of graphs in the bounded-degree model deals with the following problem: given a graph G of bounded degree d, we should distinguish (with probability 2/3, say) between the case that G satisfies P and the case that one should add/remove at least e dn edges of $G$ to make it satisfy P.
Ken-ichi Kawarabayashi, Yuichi Yoshida
openaire +1 more source
Testing a property P of graphs in the bounded-degree model deals with the following problem: given a graph G of bounded degree d, we should distinguish (with probability 2/3, say) between the case that G satisfies P and the case that one should add/remove at least e dn edges of $G$ to make it satisfy P.
Ken-ichi Kawarabayashi, Yuichi Yoshida
openaire +1 more source
Scale Freeness in Factor Analysis
Psychometrika, 1978The notion of scale freeness does not seem to have been well understood in the factor analytic literature. It has been believed that if the loss function that is minimized to obtain estimates of the parameters in the factor model is scale invariant, then the estimates are scale free.
Swaminathan, Hariharan, Algina, James
openaire +2 more sources
q-Torsion freeness of symmetric powers
Rendiconti del Circolo Matematico di Palermo, 1997Let \(R\) be a commutative noetherian unitary ring and \(E\) a finitely generated \(R\)-module. Let \(S_R(E)\) be the symmetric algebra of \(E\) over \(R\) and \(S_R(R^n)= R[X_1,\dots, X_n]\) the polynomial ring over \(R\). If \(E\) is of rank \(e\) and of finite projective dimension then there is an epimorphism between the cycles of the Koszul complex
IONESCU C. G, RESTUCCIA, Gaetana
openaire +3 more sources
Freeness Analysis Through Linear Refinement
1999Linear refinement is a technique for systematically constructing abstract domains for program analysis directly from a basic domain representing just the property of interest. This paper for the first time uses linear refinement to construct a new domain instead of just reconstructing an existing one.
P. M. Hill, SPOTO, Nicola Fausto
openaire +2 more sources
Local Freeness of Profinite Groups
Canadian Mathematical Bulletin, 1982AbstractIn this paper we discuss the relationship between local properties such as freeness and projectivity of a group and the freeness or projectivity of its pro-C-completion. We show that for certain classes, C, of finite groups (e.g. p-groups, nilpotent groups, super-solvable groups) the pro-C-completion of a locally free pro-C-group is a free pro ...
openaire +2 more sources
Freeness and matrix decompositions
Science China Mathematics, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ge, Liming, Shen, Junhao
openaire +1 more source
Scale-Freeness and Biological Networks
The Journal of Biochemistry, 2005The notion of scale-freeness and its prevalence in both natural and artificial networks have recently attracted much attention. The concept of scale-freeness is enthusiastically applied to almost any conceivable network, usually with affirmative conclusions.
openaire +2 more sources