Results 91 to 100 of about 37,491 (303)

DiskScissors: Cutting Arbitrary‐Topology Solids for Bijective Mapping

Computer Graphics Forum, EarlyView.
Abstract An algorithm for cutting solid objects in a topology‐controlled manner is presented. Concretely, given a loop on the object boundary, a disk‐topology cut surface bounded by the loop is constructed in the interior. In contrast to various previous approaches, both disk topology and conformance to the prescribed loop are ensured by construction ...
S. Hinderink, M. Campen
wiley   +1 more source

Establishing Shape Correspondences: A Survey

Computer Graphics Forum, EarlyView.
Abstract Shape correspondence between surfaces in 3D is a central problem in geometry processing, concerned with establishing meaningful relations between surfaces. While all correspondence problems share this goal, specific formulations can differ significantly: Downstream applications require certain properties that correspondences must satisfy ...
A. Heuschling, H. Meinhold, L. Kobbelt
wiley   +1 more source

Feasibility of primality in bounded arithmetic

Forum of Mathematics, Sigma
We 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

Metrics on the Sets of Nonsupersingular Elliptic Curves in Simplified Weierstrass Form over Finite Fields of Characteristic Two

International Journal of Mathematics and Mathematical Sciences, 2015
Elliptic curves have a wide variety of applications in computational number theory such as elliptic curve cryptography, pairing based cryptography, primality tests, and integer factorization.
Keisuke Hakuta
doaj   +1 more source

A conceptual proposal on the undecidability of the distribution law of prime numbers and theoretical consequences

Ratio Mathematica, 2019
Within the conceptual framework of number theory, we consider prime numbers and the classic still unsolved problem to find a complete law of their distribution.
Gianfranco Minati
doaj   +1 more source

An extension of Babbage’s criterion for primality

, 2013
Let n > 1 and k > 1 be positive integers. We show that if $$\left( {\begin{array}{*{20}c} {n + m} \\ n \\ \end{array} } \right) \equiv 1 (\bmod k)$$ for each integer m with 0 ≤ m ≤ n − 1, then k is a prime and n is a power of this prime.
R. Mestrovic
semanticscholar   +1 more source

Beyond Immediate Givenness: Husserl's Content‐Apprehension Schema in Light of Merleau‐Ponty's Critique of Sensation

European Journal of Philosophy, EarlyView.
Abstract Merleau‐Ponty's Phenomenology of Perception (2012 [1945]) opens with a detailed critique of traditional philosophical accounts of sensation, generally understood as having Husserl's “content‐apprehension schema” among its targets. The schema sees perception as resulting from the interpretation (“apprehension” or “apperception”) of “raw ...
Yamina Venuta
wiley   +1 more source

Solving some specific tasks by Euler's and Fermat's Little theorem

Ratio Mathematica, 2019
Euler's and Fermat's Little theorems have a great use in number theory. Euler's theorem is currently widely used in computer science and cryptography, as one of the current encryption methods is an exponential cipher based on the knowledge of number ...
Viliam Ďuriš
doaj   +1 more source

Retrieving Your Concepts: Iris Murdoch on Original Sin

European Journal of Philosophy, EarlyView.
Abstract In The Sovereignty of Good, Iris Murdoch argues that our moral thinking will be impoverished until it possesses a secular conception of original sin. Such a notion would need to remove unacceptable Christian baggage while retaining a genuine claim to be a descendant of the original Christian concept.
Samuel Filby
wiley   +1 more source

Integer factoring and compositeness witnesses

Journal of Mathematical Cryptology, 2020
We describe a reduction of the problem of factorization of integers n ≤ x in polynomial-time (log x)M+O(1) to computing Euler’s totient function, with exceptions of at most xO(1/M) composite integers that cannot be factored at all, and at most x exp −cM ...
Pomykała Jacek, Radziejewski Maciej
doaj   +1 more source