Sciweavers

107 search results - page 11 / 22
» New Structure Theorem for Subresultants
Sort
View
CSL
2007
Springer
14 years 1 months ago
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
Dale Miller, Alexis Saurin
ENTCS
2006
172views more  ENTCS 2006»
13 years 7 months ago
Locality of Queries and Transformations
Locality is a standard notion of finite model theory. There are two well known flavors of it, based on Hanf's and Gaifman's theorems. Essentially they say that structure...
Leonid Libkin
CSR
2006
Springer
13 years 11 months ago
Unfolding Synthesis of Asynchronous Automata
Zielonka's theorem shows that each regular set of Mazurkiewicz traces can be implemented as a system of synchronized processes provided with some distributed control structure...
Nicolas Baudru, Rémi Morin
SAT
2010
Springer
125views Hardware» more  SAT 2010»
13 years 11 months ago
Two Techniques for Minimizing Resolution Proofs
Some SAT-solvers are equipped with the ability to produce resolution proofs for problems which are unsatisfiable. Such proofs are used in a variety of contexts, including finding...
Scott Cotton
BMCBI
2008
214views more  BMCBI 2008»
13 years 6 months ago
Enhanced Bayesian modelling in BAPS software for learning genetic structures of populations
Background: During the most recent decade many Bayesian statistical models and software for answering questions related to the genetic structure underlying population samples have...
Jukka Corander, Pekka Marttinen, Jukka Siré...