Results 21 to 30 of about 441,303 (257)
Abelian varieties with isogenous reductions
Comptes Rendus. Mathématique, 2021 Let $A_1$ and $A_2$ be abelian varieties over a number field $K$. We prove that if there exists a non-trivial morphism of abelian varieties between reductions of $A_1$ and $A_2$ at a sufficiently high percentage of primes, then there exists a non-trivial
Khare, Chandrashekhar B. +1 more
doaj +1 more source
Iterated Clique Reductions in Vertex Weighted Coloring for Large Sparse Graphs [PDF]
, 2023 The Minimum Vertex Weighted Coloring (MinVWC) problem is an important generalization of the classic Minimum Vertex Coloring (MinVC) problem which is NP-hard. Given a simple undirected graph G=(V,E), the MinVC problem is to find a coloring s.t.
Yongxuan Lai +15 more
core +1 more source
Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers), 2015 We reduce phrase-representation parsing to dependency parsing. Our reduction is grounded on a new intermediate representation, "head-ordered dependency trees", shown to be isomorphic to constituent trees. By encoding order information in the dependency labels, we show that any off-the-shelf, trainable dependency parser can be used to produce ...
Daniel Fernández-González +1 more
openaire +5 more sources
Beilstein Journal of Organic Chemistry, 2014 New compounds with carbohydrate-similar structure (carbohydrate mimetics) are presented in this article. Starting from enantiopure nitrones and lithiated TMSE-allene we prepared three 1,2-oxazine derivatives which underwent a highly stereoselective Lewis
Léa Bouché +2 more
doaj +1 more source
Surface Embeddability of Graphs via Reductions [PDF]
, 2011 On the basis of reductions, polyhedral forms of Jordan axiom on closed curve in the plane are extended to establish characterizations for the surface embeddability of a ...
Liu, Yanpei
core +1 more source
, 2015 We reduce non-deterministic time $T \ge 2^n$ to a 3SAT instance $ϕ$ of quasilinear size $|ϕ| = T \cdot \log^{O(1)} T$ such that there is an explicit circuit $C$ that on input an index $i$ of $\log |ϕ|$ bits outputs the $i$th clause, and each output bit of $C$ depends on $O(1)$ input bits. The previous best result was $C$ in NC$^1$.
Hamidreza Jahanjou +2 more
openaire +4 more sources
Reductions of exceptional field theories
Journal of High Energy Physics, 2020 Double Field Theory (DFT) and Exceptional Field Theory (EFT), collectively called ExFTs, have proven to be a remarkably powerful new framework for string and M-theory.
David S. Berman, Ray Otsuki
doaj +1 more source
Anaerobic co-digestion of swine manure and forage at two harvesting ages
Ciência Rural, 2021 : The co-digestion of swine manure with vegetable waste is an alternative that can increase the production of biogas and methane generated by the isolated digestion of manure.
Juliana Dias de Oliveira +9 more
doaj +1 more source
NP-Logic Systems and Model-Equivalence Reductions [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 In this paper we investigate the existence of model-equivalence reduction between NP-logic systems which are logic systems with model existence problem in NP.
Yuping Shen, Xishun Zhao
doaj +1 more source
PRICING OF BT COTTON SEEDS IN INDIA: THE DEBATE BEHIND [PDF]
Review of Agricultural and Applied Economics, 2014 In 2006 the state government of Andhra Pradesh reduced the Bt cotton seed prices from Indian Rs1600 to Rs750 in order to make the technology affordable and accessible to small and marginal farmers in the state and also to prevent the monopolistic market ...
Anchal ARORA
doaj +1 more source