We show that thepermanent cannot be computed by uniform constantdepth threshold circuits of size Tn, for any function T such that for all k, Tk n = o2n. More generally, we show th...
In [?], a practical algorithm for precise interval analysis is provided for which, however, no non-trivial upper complexity bound is known. Here, we present a lower bound by showin...
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems...
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
Michelangelo Grigni, Vincent Mirelli, Christos H. ...