Results 11 to 20 of about 100,241 (207)
Sharing a Library between Proof Assistants: Reaching out to the HOL Family [PDF]
, 2018 We observe today a large diversity of proof systems. This diversity has the negative consequence that a lot of theorems are proved many times. Unlike programming languages, it is difficult for these systems to co-operate because they do not implement the
Thiré, François
core +3 more sources
Rainbow Coloring Hardness via Low Sensitivity Polymorphisms [PDF]
, 2019 A k-uniform hypergraph is said to be r-rainbow colorable if there is an r-coloring of its vertices such that every hyperedge intersects all r color classes.
Guruswami, Venkatesan, Sandeep, Sai
core +1 more source
Several types of types in programming languages [PDF]
, 2015 Types are an important part of any modern programming language, but we often forget that the concept of type we understand nowadays is not the same it was perceived in the sixties. Moreover, we conflate the concept of "type" in programming languages with
A Church +19 more
core +5 more sources
A finer reduction of constraint problems to digraphs [PDF]
, 2015 It is well known that the constraint satisfaction problem over a general relational structure A is polynomial time equivalent to the constraint problem over some associated digraph.
Bulín, Jakub +3 more
core +1 more source
The power of linear programming for general-valued CSPs
, 2014 Let $D$, called the domain, be a fixed finite set and let $\Gamma$, called the valued constraint language, be a fixed set of functions of the form $f:D^m\to\mathbb{Q}\cup\{\infty\}$, where different functions might have different arity $m$.
Kolmogorov, Vladimir +2 more
core +2 more sources
From ACT-ONE to Miranda, a Translation Experiment [PDF]
, 1997 It is now almost universally acknowledged that the data language ACT-ONE associated with the formal description technique LOTOS is inappropriate for the purpose of OSI formal description.
Bowman, Howard +2 more
core +2 more sources
Hybrid VCSPs with crisp and conservative valued templates [PDF]
, 2017 A constraint satisfaction problem (CSP) is a problem of computing a homomorphism ${\bf R} \rightarrow {\bf \Gamma}$ between two relational structures.
Takhanov, Rustem
core +2 more sources
An intracellular transporter mitigates the CO2‐induced decline in iron content in Arabidopsis shoots
FEBS Letters, EarlyView.This study identifies a gene encoding a transmembrane protein, MIC, which contributes to the reduction of shoot Fe content observed in plants under elevated CO2. MIC is a putative Fe transporter localized to the Golgi and endosomal compartments. Its post‐translational regulation in roots may represent a potential target for improving plant nutrition ...
Timothy Mozzanino +7 more
wiley +1 more source
Algorithmic and Statistical Perspectives on Large-Scale Data Analysis [PDF]
, 2010 In recent years, ideas from statistics and scientific computing have begun to interact in increasingly sophisticated and fruitful ways with ideas from computer science and the theory of algorithms to aid in the development of improved worst-case ...
Mahoney, Michael W.
core
CO2 packing polymorphism under pressure: mechanism and thermodynamics of the I-III polymorphic transition [PDF]
, 2017 In this work we describe the thermodynamics and mechanism of CO$_2$ polymorphic transitions under pressure from form I to form III combining standard molecular dynamics, well-tempered metadynamics and committor analysis.
Gimondi, Ilaria, Salvalaglio, Matteo
core +2 more sources