arXiv:cs/9911002v2 [cs.CC] 20 Jan 2000 Numeration systems on a regular language : Arithmetic operations, Recognizability and Formal power series Michel Rigo Institut de Math´ematiques, Universit´e de Li`ege, Grande Traverse 12 (B 37), B-4000 Li`ege, Belgium. arXiv:cs.CC/0508071 v1 16 Aug 2005 Every decision tree has an influential variable Ryan O’Donnell∗ Microsoft Research [email protected] Michael Saks† Rutgers University [email protected] Oded Schramm Microsoft Research Rocco A. Servedio‡ Columbia University [email protected] December 22, 2005 Abstract arXiv:2010.04527 [pdf] [bibtex] Constant-time connectivity tests Philipp Klaus Krause Submitted on 2020-10-09. arXiv:cs.CC/0302003 v1 3 Feb 2003 Approximate analysis of search algorithms with “physical” methods S. Cocco,1 R. Monasson,2,3 A. Montanari,2 and G. Semerjian2 1CNRS-Laboratoire de Dynamique des Fluides Complexes, 3 rue de l’universit´e 67084 Strasbourg, France 2CNRS-Laboratoire de Physique Th´eorique de l’ENS, 24 rue Lhomond, 75005 Paris, France Subjects: Data Structures and Algorithms (cs.DS); Computational Complexity (cs.CC) [5] arXiv:2007.14179 (cross-list from cs.DS) [ pdf , other ] Title: Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidth [email protected] January 17, … Subjects: Computational Complexity (cs.CC); Data Structures and Algorithms (cs.DS) [2] arXiv:2012.00330 [ pdf , other ] Title: Time-Space Lower Bounds for Simulating Proof Systems with Quantum and Randomized Verifiers Contribute to arXiv/arxiv-classifier development by creating an account on GitHub. Subjects: Computational Complexity (cs.CC); Data Structures and Algorithms (cs.DS) [2] arXiv:1801.00734 [ pdf , other ] Title: Complexity Theory, Game … arXiv:0803.1030v3 [cs.CC] 28 Jan 2009 Robust Stochastic Chemical Reaction Networks and Bounded Tau-Leaping David Soloveichik∗ [email protected] Abstract The behavior of some stochastic chemical reaction networks is largely unaffected by slight inaccuracies in reaction rates. Subjects: Data Structures and Algorithms, Computational Complexity, Discrete Mathematics acm: G.2.2; G.3. Search results 1–10 of 7714 for class:arXiv,cs.CC. arXiv:cs/0301024v1 [cs.CC] 23 Jan 2003 COMPLEXITY AND COMPLETENESS OF IMMANANTS JEAN-LUC BRYLINSKI AND RANEE BRYLINSKI Abstract. We formalize the robustness of state probabilities arXiv:cs/0102024v1 [cs.CC] 23 Feb 2001 P-Immune Sets with Holes Lack Self-Reducibility Properties Lane A. Hemaspaandra∗ Department of Computer Science University of Rochester Rochester, NY 14627-0226, USA Harald Hempel† Institut fu¨r Informatik Friedrich-Schiller-Universit¨at Jena D-07743 Jena, Germany February 23, 2001 Abstract arXiv classifier. arXiv:cs/0404044v1 [cs.CC] 22 Apr 2004 A note on dimensions of polynomial size circuits∗ Xiaoyang Gu Department of Computer Science Iowa State University Ames, IA 50011, USA [email protected] Abstract In this paper, we use resource-bounded dimension theory to investigate polynomial size circuits.