Results 31 to 40 of about 1,078 (84)
On the Complexity of Finding a Sun in a Graph [PDF]
, 2010 The sun is the graph obtained from a cycle of length even and at least six by adding edges to make the even-indexed vertices pairwise adjacent. Suns play an important role in the study of strongly chordal graphs. A graph is chordal if it does not contain
Hoàng, Chính T.
core +2 more sources
On the Classical-Quantum Relation of Constants of Motion
Frontiers in Physics, 2018 Groenewold-Van Hove theorem suggest that is not always possible to transform classical observables into quantum observables (a process known as quantization) in a way that, for all Hamiltonians, the constants of motion are preserved.
Fabian Belmonte +3 more
doaj +1 more source
An improved local search algorithm for 3-SAT [PDF]
, 2004 We slightly improve the pruning technique presented in Dantsin et. al.
Brueggemann, T., Kern, W.
core +5 more sources
Algorithmic Aspects of Some Variants of Domination in Graphs
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2020 A set S ⊆ V is a dominating set in G if for every u ∈ V \ S, there exists v ∈ S such that (u, v) ∈ E, i.e., N[S] = V . A dominating set S is an isolate dominating set (IDS) if the induced subgraph G[S] has at least one isolated vertex.
Kumar J. Pavan, Reddy P.Venkata Subba
doaj +1 more source
Implementation of linear minimum area enclosing traingle algorithm [PDF]
, 2014 This article has been made available through the Brunel Open Access Publishing Fund.An algorithm which computes the minimum area triangle enclosing a convex polygon in linear time already exists in the literature.
D Goldberg +3 more
core +2 more sources
First-Order Methods for Convex Optimization
EURO Journal on Computational Optimization, 2021 First-order methods for solving convex optimization problems have been at the forefront of mathematical optimization in the last 20 years. The rapid development of this important class of algorithms is motivated by the success stories reported in various
Pavel Dvurechensky +2 more
doaj
On asymptotic estimates for arithmetic cost functions
, 1997 Let Or(n) (the cost of n) be the minimum number of arithmetic operations needed to obtain n starting from 1. We prove that Or(n) > log n -log log n for almost all n E N, and, given ?
C. Moreira
semanticscholar +1 more source
mRLWE-CP-ABE: A revocable CP-ABE for post-quantum cryptography
Journal of Mathematical CryptologyWe address the problem of user fast revocation in the lattice-based Ciphertext Policy Attribute-Based Encryption (CP-ABE) by extending the scheme originally introduced by Zhang and Zhang [Zhang J, Zhang Z.
Cianfriglia Marco +2 more
doaj +1 more source
Expansion complexity and linear complexity of sequences over finite fields
, 2016 The linear complexity is a measure for the unpredictability of a sequence over a finite field and thus for its suitability in cryptography. In 2012, Diem introduced a new figure of merit for cryptographic sequences called expansion complexity.
Mérai, László +2 more
core +1 more source
On the pseudorandomness of automatic sequences
, 2017 We study the pseudorandomness of automatic sequences in terms of well-distribution and correlation measure of order 2. We detect non-random behavior which can be derived either from the functional equations satisfied by their generating functions or from
Mérai, László, Winterhof, Arne
core +1 more source