We present an explicit construction of a circuit for the COMPARISON function in c LT 2 , the class of polynomial-size linear threshold circuits of depth two with polynomially growing weights. Goldmann and Karpinski proved that LT 1 c LT 2 in 4]. Hofmeister presented a simpliied version of the same result in 6]. We have further simpliied the results of these two papers by limiting ourselves to t...

Greedy: Θ(min(logd,q)): Θ(H(d)) (this also implies O(logn), n is number of elements). (Note: Feige [3] prove that there is no substantially improvement (for greedy algo).) Also O(q) and exists tight example (section 2.5); so, Θ(q) in general. Note that this bound is asymptotically tight (see Vazirani’s book [10] section 29.9) Slav́ık [9] also gives exact analysis lnn− lnlnn+Θ(1). LP Rounding: O(...

Tadeusz Robak, Jerzy Z. Blonski, Joanna Gora-Tybor, Krzysztof Jamroziak, Jadwiga Dwilewicz-Trojaczek, Agnieszka Tomaszewska, Lech Konopka, Bernadetta Ceglarek, Anna Dmoszynska, Malgorzata Kowal, Janusz Kloczko, Beata Stella-Holowiecka, Kazimierz Sulek, Malgorzata Calbecka, Krystyna Zawilska, Kazimierz Kuliczkowski, Aleksander B. Skotnicki, Krzysztof Warzocha, Marek Kasznicki, and the Polish Leu...

Running title: 1 Label-based comparative co-expression 2 3 Title: 4 FamNet: A framework to identify multiplied modules driving pathway expansion in 5 plants. 6 7 Colin Ruprecht1, Amelie Mendrinna1,2, Takayuki Tohge1, Arun Sampathkumar3, 8 Sebastian Klie1, Alisdair R. Fernie1, Zoran Nikoloski1, Staffan Persson1,2,4#, Marek 9 Mutwil1*# 10 11 1 Max-Planck-Institute for Molecular Plant Physiology, ...

Michal Matuszewski, Boris A. Malomed, and Marek Trippenbach Institute of Theoretical Physics, Physics Department, Warsaw University, Hoża 69, PL-00-681 Warsaw, Poland Department of Physical Electronics, School of Electrical Engineering, Faculty of Engineering, Tel Aviv University, Tel Aviv 69978, Israel Soltan Institute for Nuclear Studies, Hoża 69, PL-00-681 Warsaw, Poland Received 13 July 200...

0950-5849/$ see front matter Crown Copyright 2013 Published by Elsevier B.V. All rights reserved. http://dx.doi.org/10.1016/j.infsof.2013.05.006 ⇑ Corresponding author. Tel.: +1 778 782 7431. E-mail addresses: [email protected] (B. Mohabbati), [email protected] (M. Asadi), [email protected] (D. Gašević), [email protected] (M. Hatala), [email protected] (H.A. Bardia Mohabbati a,⇑, Mohsen Asadi , Dragan Gaš...

Marek Karpinski Rustam Mubarakzjanov y Abstract We prove that the error-free (Las Vegas) randomized OBDDs are computationally equivalent to the deterministic OBDDs. In contrast, it is known the same is not true for the Las Vegas read-once branching programs.

Karpinski and Nekrich (2008) introduced the problem of parameterized range majority, which asks to preprocess a string of length n such that, given the endpoints of a range, one can quickly find all the distinct elements whose relative frequencies in that range are more than a threshold τ . Subsequent authors have reduced their time and space bounds such that, when τ is given at preprocessing t...