Results 11 to 20 of about 58 (41)
G. Th. Guilbaud et la théorie du choix social
, 2011 URL des Documents de travail : http://centredeconomiesorbonne.univ-paris1.fr/bandeau-haut/documents-de-travail/ Classification AMS : 03B05, 91B14.Documents de travail du Centre d'Economie de la Sorbonne 2011.47 - ISSN : 1955-611XOne year after the ...
Monjardet, Bernard
core +1 more source
Lower Bounds for the Polynomial Calculus and the Gröbner Basis Algorithm
, 1997 . Razborov (1996) recently proved that polynomial calculus proofs of the pigeonhole principle PHP m n must have degree at least dn=2e+1 over any field. We present a simplified proof of the same result.
Jirí Sgall +3 more
core
A short Note on Linear Autarkies, q-Horn Formulas and the Complexity Index
, 1999 It is shown that the tractable class of CNF formulas solvable by Linear Autarkies properly contains the class of q-Horn formulas and that it is incomparable with SLUR. Keywords: Satisfiability, Autarkies, Horn, Complexity.
H. Van Maaren
core
Assessing Chronotypes by Ambulatory Circadian Monitoring. [PDF]
Front Physiol, 2019 Martinez-Nicolas A +5 more
europepmc +1 more source
A dPIP5K dependent pool of phosphatidylinositol 4,5 bisphosphate (PIP2) is required for G-protein coupled signal transduction in Drosophila photoreceptors. [PDF]
PLoS Genet, 2015 Chakrabarti P +6 more
europepmc +1 more source
Genetic snapshots of the Rhizobium species NGR234 genome. [PDF]
Genome Biol, 2000 Viprey V +3 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Suppes-style sequent calculus for probability logic
Journal of Logic and Computation, 2015M. Boricic
semanticscholar +1 more source
A branch and cut algorithm for MAX-SAT and weighted MAX-SAT
Satisfiability Problem: Theory and Applications, 1996Steve Joy, J. Mitchell, B. Borchers
semanticscholar +1 more source