Zobrazeno 1 - 10
of 39
pro vyhledávání: '"Exact division"'
Publikováno v:
Applied Sciences, Vol 11, Iss 3752, p 3752 (2021)
Applied Sciences
Volume 11
Issue 9
Applied Sciences
Volume 11
Issue 9
In classical computation, Toom–Cook is one of the multiplication methods for large numbers which offers faster execution time compared to other algorithms such as schoolbook and Karatsuba multiplication. For the use in quantum computation, prior wo
Publikováno v:
ISSAC
No polynomial-time algorithm is known to test whether a sparse polynomial G divides another sparse polynomial F . While computing the quotient Q = F quo G can be done in polynomial time with respect to the sparsities of F , G and Q, this is not yet s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8bf3cca2ec29f500ee71257ddfb18d3b
https://hal.archives-ouvertes.fr/hal-03136945
https://hal.archives-ouvertes.fr/hal-03136945
Autor:
Hemant Amhia, Vishnu Kant Chaurasia
Publikováno v:
2019 International Conference on Communication and Signal Processing (ICCSP).
The main object of our research work is to look at the execution of different division systems for shading pictures. Division by K-implies bunching and Thresholding methods are thought about for their execution in division of shading pictures. Divisi
Autor:
Eugeny Smirnov
Publikováno v:
British Journal of Mathematics & Computer Science. 4:307-321
Autor:
Janusz Łyko
Publikováno v:
Procedia - Social and Behavioral Sciences. 65:76-82
One of the basic socio-economic problems is the problem of distribution of benefits and dues. The historically shaped principles of justice direct the solution to the problem of the Aristotelian rule of proportionality. But applying this rule not alw
Autor:
Dejan Velušček, Igor Klep
Publikováno v:
Journal of Algebra. 279(1):345-361
In [Comm. Algebra 29 (2001) 193–201] Cimpric gave examples of division rings containing an ordering of level 2m but not of level m for m∈ N . His examples were quite complicated. We give substantially simplified examples in Section 2. In Sections
Autor:
J. H. Reijnierse, Jos A. M. Potters
Publikováno v:
Mathematical Programming, 83, pp. 291-311
Mathematical Programming, 83, 291-311
Mathematical Programming, 83, 291-311
This paper describes an algorithm to find an (α-)envy-free Pareto-optimal division in the case of a finite number of homogeneous infinitely divisible goods and linear utility functions. It is used to find an allocation in the classical cake division
Autor:
Arnaud Tisserand, T. Chabrier
Publikováno v:
ARITH-21st IEEE International Symposium on Computer Arithmetic
ARITH-21st IEEE International Symposium on Computer Arithmetic, Apr 2013, Austin, TX, United States. pp.219-228, ⟨10.1109/ARITH.2013.17⟩
IEEE Symposium on Computer Arithmetic
ARITH-21st IEEE International Symposium on Computer Arithmetic, Apr 2013, Austin, TX, United States. pp.219-228, ⟨10.1109/ARITH.2013.17⟩
IEEE Symposium on Computer Arithmetic
International audience; Scalar recoding is popular to speed up ECC scalar multiplication: non-adjacent form, double-base number system, multi-base number system. But fast recoding methods require pre-computations: multiples of base point or off-line
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c43c0fb25841a0853f0f3beb4d8d2243
https://hal.inria.fr/hal-00772613/file/PID2635353.pdf
https://hal.inria.fr/hal-00772613/file/PID2635353.pdf
Autor:
David W. Krumme
Publikováno v:
Discrete Mathematics. 156(1-3):113-140
This paper presents a new theorem called the reordering theorem for the problem of gossiping by telephone. The theorem says the calls of any complete gossiping can be rearranged into a sequence such that at most two calls cause each participant to be
Autor:
Vivien Dubois, Jean-Gabriel Kammerer
Publikováno v:
Public Key Cryptography – PKC 2011
Public Key Cryptography – PKC 2011, Mar 2011, Taormina, Italy. 2011, 〈http://link.springer.com/book/10.1007/978-3-642-19379-8〉. 〈10.1007/978-3-642-19379-8_28〉
Public Key Cryptography – PKC 2011 ISBN: 9783642193781
Public Key Cryptography
Public Key Cryptography – PKC 2011, International Association for Cryptologic Research, Mar 2011, Taormina, Italy. ⟨10.1007/978-3-642-19379-8_28⟩
Public Key Cryptography – PKC 2011, Mar 2011, Taormina, Italy. 2011, 〈http://link.springer.com/book/10.1007/978-3-642-19379-8〉. 〈10.1007/978-3-642-19379-8_28〉
Public Key Cryptography – PKC 2011 ISBN: 9783642193781
Public Key Cryptography
Public Key Cryptography – PKC 2011, International Association for Cryptologic Research, Mar 2011, Taormina, Italy. ⟨10.1007/978-3-642-19379-8_28⟩
International audience; Ten years ago, Ko et al. described a Diffie-Hellman like protocol based on decomposition with respect to a non-commutative semigroup law. Instantiation with braid groups had first been considered, however intense research on b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8d1d0c16d2e0c82a082c1648f712b7cb
https://hal.archives-ouvertes.fr/hal-01104498
https://hal.archives-ouvertes.fr/hal-01104498