Results 111 to 120 of about 12,115,560 (297)
BENT POLYNOMIALS OVER FINITE FIELDS
, 2008 . The definition of bent is redefined for any finite field. Our main result is a complete description of the relationship between bent polynomials and perfect non-linear functions over finite fields: we show they are equivalent.
Rex, Robert S Coulter, W Matthews
core
Composition‐Aware Cross‐Sectional Integration for Spatial Transcriptomics
Advanced Intelligent Discovery, EarlyView.Multi‐section spatial transcriptomics demands coherent cell‐type deconvolution, domain detection, and batch correction, yet existing pipelines treat these tasks separately. FUSION unifies them within a composition‐aware latent framework, modeling reads as cell‐type–specific topics and clustering in embedding space.
Qishi Dong +5 more
wiley +1 more source
Feasibility of primality in bounded arithmetic
Forum of Mathematics, SigmaWe prove the correctness of the AKS algorithm [1] within the bounded arithmetic theory $T^{\text {count}}_2$ or, equivalently, the first-order consequences of the theory $\text {VTC}^0$ expanded by the smash function, which we denote by
Raheleh Jalali, Ondřej Ježil
doaj +1 more source
Deterministic distinct-degree factorization of polynomials over finite fields [PDF]
, 2004 A deterministic polynomial time algorithm is presented for finding the distinct-degree factorization of multivariate polynomials over finite fields. As a consequence, one can count the number of irreducible factors of polynomials over finite fields in ...
Lauder, AG +5 more
core +1 more source
Advanced Intelligent Systems, Volume 7, Issue 3, March 2025.This review aims to provide a broad understanding for interdisciplinary researchers in engineering and clinical applications. It addresses the development and control of magnetic actuation systems (MASs) in clinical surgeries and their revolutionary effects in multiple clinical applications.
Yingxin Huo +3 more
wiley +1 more source
Verifiable geometric homomorphic secret sharing for outsourced polynomial evaluations
Journal of King Saud University: Computer and Information SciencesHomomorphic Secret Sharing (HSS) enables a client to outsource the evaluation of a function f on a private input $$\textbf{x}$$ x to multiple servers.
Minghao Yang, Liang Feng Zhang
doaj +1 more source
Gauss factorials of polynomials over finite fields
, 2017 In this paper, we initiate a study on Gauss factorials of polynomials over finite fields, which are the analogues of Gauss factorials of positive integers.
Min Sha, Xiumei Li
core +1 more source
Pre‐Curved Everting Robots With Embedded Steering Intelligence Fabricated by CO2 Laser Welding
Advanced Intelligent Systems, EarlyView.Design and experimental demonstration of a laser welded growing robot for anatomically guided navigation. The robot follows an aortic arch phantom entering the branchiocephalic branch through steering by design. The figure shows the physical phantom setup, CAD defined weld geometry and full robot eversion.
Brandon Saldarriaga +5 more
wiley +1 more source
Relative rank and regularization
Forum of Mathematics, SigmaWe introduce a new concept of rank – relative rank associated to a filtered collection of polynomials. When the filtration is trivial, our relative rank coincides with Schmidt rank (also called strength).
Amichai Lampert, Tamar Ziegler
doaj +1 more source
Additive polynomials over perfect fields
, 2011 Additive polynomials in one variable over valued fields of positive characteristic are sufficiently well understood in terms of their approximation properties. We extend results in this direction to multi-variable additive polynomials over perfect valued
Durhan, Salih
core