Results 51 to 60 of about 1,659,955 (202)
Magic Sets for disjunctive Datalog programs [PDF]
, 2012 In this paper, a new technique for the optimization of (partially) bound queries over disjunctive Datalog programs with stratified negation is presented.
Alviano, Mario +10 more
core +1 more source
, 2017 MagIC is a high-performance code that solves the magneto-hydrodynamics equations in rotating spherical ...
Rakesh Yadav +6 more
core +1 more source
Designs from Magic-Augmented Clifford Circuits
PRX QuantumWe introduce magic-augmented Clifford circuits—architectures in which Clifford circuits are preceded and/or followed by constant-depth circuits of non-Clifford (“magic”) gates—as a resource-efficient way to realize approximate k-designs, with reduced ...
Yuzhen Zhang +3 more
doaj +1 more source
, 2017 MagIC is a high-performance code that solves the magneto-hydrodynamics equations in rotating spherical ...
Rakesh Yadav +6 more
core +1 more source
Framing Performance Magic: The Role of Contract, Discourse and Effect [PDF]
, 2013 A wide continuum of genres in performance magic has developed since the Victorian period, including stage magic, street magic, close-up magic, comedy magic, mentalism, bizarre and mystery entertainment.
Landman, Todd
core +1 more source
On super edge-magic deficiency of volvox and dumbbell graphs
AKCE International Journal of Graphs and Combinatorics, 2016 Let G=(V,E) be a finite, simple and undirected graph of order p and size q. A super edge-magic total labeling of a graph G is a bijection λ:V(G)∪E(G)→{1,2,…,p+q}, where the vertices are labeled with the numbers 1,2,…,p and there exists a constant t such ...
Muhammad Imran +2 more
doaj +1 more source
The Distance Magic Index of a Graph
Discussiones Mathematicae Graph Theory, 2018 Let G be a graph of order n and let S be a set of positive integers with |S| = n. Then G is said to be S-magic if there exists a bijection ϕ : V (G) → S satisfying ∑x∈N(u)ϕ(x) = k (a constant) for every u ∈ V (G). Let α(S) = max{s : s ∈ S}.
Godinho Aloysius +2 more
doaj +1 more source
Super edge-magic labeling of m-node k-uniform hyperpaths and m-node k-uniform hypercycles
AKCE International Journal of Graphs and Combinatorics, 2016 We generalize the notion of the super edge-magic labeling of graphs to the notion of the super edge-magic labeling of hypergraphs. For a hypergraph H with a finite vertex set V and a hyperedge set E, a bijective function f:V∪E→{1,2,3,…,|V|+|E|} is called
Ratinan Boonklurb +2 more
doaj +1 more source
Magic state distillation with low space overhead and optimal asymptotic input count [PDF]
Quantum, 2017 We present an infinite family of protocols to distill magic states for $T$-gates that has a low space overhead and uses an asymptotic number of input magic states to achieve a given target error that is conjectured to be optimal.
Jeongwan Haah +3 more
doaj +1 more source
Open Mathematics, 2017 An edge-magic total labeling of an (n,m)-graph G = (V,E) is a one to one map λ from V(G) ∪ E(G) onto the integers {1,2,…,n + m} with the property that there exists an integer constant c such that λ(x) + λ(y) + λ(xy) = c for any xy ∈ E(G).
Javed Sana +5 more
doaj +1 more source