✦ LIBER ✦

Characterizing weak compatibility in terms of weighted quartets

✍ Scribed by Stefan Grünewald; Katharina T. Huber; Vincent Moulton; Charles Semple; Andreas Spillner

Book ID: 108047137
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 257 KB
Volume: 42
Category: Article
ISSN: 0196-8858
DOI: 10.1016/j.aam.2008.07.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Encoding phylogenetic trees in terms of

Encoding phylogenetic trees in terms of weighted quartets

✍ Stefan Grünewald; Katharina T. Huber; Vincent Moulton; Charles Semple 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 225 KB

Characterizing TC0in Terms of Infinite G

Characterizing TC0in Terms of Infinite Groups

✍ Andreas Krebs; Klaus-Jorn Lange; Stephanie Reifferscheid 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 384 KB

Characterizing Linear Size Circuits in T

Characterizing Linear Size Circuits in Terms of Privacy

✍ Eyal Kushilevitz; Rafail Ostrovsky; Adi Rosén 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 145 KB

In this paper we prove a perhaps unexpected relationship between the complexity class of the boolean functions that have linear size circuits and n-party private protocols. Specifically, let f be a boolean function. We show that f has a linear size circuit if and only if f has a 1-private n-party pr

Characterizing Quantum Theory in Terms o

Characterizing Quantum Theory in Terms of Information-Theoretic Constraints

✍ Rob Clifton; Jeffrey Bub; Hans Halvorson 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 374 KB

On characterizing optimal competitive pr

On characterizing optimal competitive programs in terms of decentralizable conditions

✍ William A Brock; Mukul Majumdar 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 564 KB

Characterizing (quasi-)ultrametric finit

Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs

✍ Vladimir Gurvich; Mikhail Vyalyi 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 322 KB