ALGOUK - A Network for Algorithms and Complexity in the UK

算法的概念可能是计算机科学中的关键基础概念，算法及其实现所使用的资源的度量，即它们的计算复杂性，对它们的研究和应用至关重要。随着科学、技术和社会中可用数据量的爆炸式增长，以及新的潜在应用的出现，算法学（算法科学）的研究转化为有效的实现以及算法学研究的重要性对新的潜在应用的影响从未如此重要。计算机科学是现代计算机科学的核心。算法学的研究有两个主要方面：获得一个给定问题的解决方案中所使用的资源的越来越好的上限;以及证明任何这样的解决方案所需的资源的越来越好的下限。上界的研究显然转化为实际的进步;然而，下界的研究也可以，更一般的复杂性理论（完备性）的结果，在密码学和伪随机性等领域。现实世界与算法的接口会激发新的算法分析，例如，当出现新问题或新的实际限制禁止现有方法时;此外，现实世界问题的复杂性理论完备性结果激发了对新的启发式，随机，近似，而固定─参数算法，转化为有效的实际解决方案。算法的研究传统上发生在理论计算机科学，在计算机科学内部和外部都有无数的接口。2然而，通常深刻的理论见解和进展不会迅速地“向上”渗透到现实世界的实现中，也不会“横向”渗透到其他学术领域。另一方面，在工业、科学和社会中出现的算法问题并不总是“向下”渗透到拥有工具和技术来提供改进的算法解决方案的理论家那里。此外，计算机科学和其他学科之间的边界变得越来越不稳定;例如，计算的各个方面越来越多地嵌入到核心数学中，并且组合学、概率、代数和拓扑学等主题的新算法方面正在迅速出现。简而言之，算法研究有大量的机会在科学，技术和社会中产生变革。AlgoUK研究人员网络的主要目的是促进英国算法研究社区内的多方面互动，以及这些研究人员与工业和其他学科（如数学，生物学和化学）之间的跨学科互动。研讨会的创始研究小组和主办地点位于达勒姆、国王学院伦敦、莱斯特、利物浦、皇家、霍洛威和沃里克，但该网络对所有希望参与的人开放。

The notion of an algorithm is perhaps the key foundational concept in Computer Science, with the measurement of the resources used by algorithms and their implementations, that is, their computational complexity, central to their study and application. As the amount of available data explodes across science, technology, and society, and new potential applications emerge, never has it been so important that research in algorithmics, the science of algorithms, translates into effective implementations and that the weight of algorithmics research is brought to bear on new potential applications. Algorithmics is absolutely central within modern-day Computer Science. Research in algorithmics has two broad strands: obtaining better and better upper bounds as regards the resources used within a solution to a given problem; and proving better and better lower bounds as to the resources required for any such solution. The study of upper bounds obviously translates into practical advances; however, so can the study of lower bounds, and more generally complexity-theoretic (completeness) results, in areas such as cryptography and pseudorandomness. The real-world interface with algorithmics inspires new algorithmic analyses, when, for instance, new problems are thrown up or new practically-imposed restrictions forbid existing methodologies; in addition, complexity-theoretic completeness results for real-world problems inspire the search for new heuristic, randomized, approximate, and fixed-parameter algorithms that translate to effective practical solutions.The study of algorithmics traditionally takes place within Theoretical Computer Science although there are myriad interfaces both within Computer Science and without.However, often deep theoretical insights and advances do not rapidly percolate 'upwards' into real-world implementations and 'sideways' into other academic domains. On the other hand, algorithmic problems emerging within industry, science, and society do not always percolate 'downwards' to the theoreticians who have the tools and techniques to provide improved algorithmic solutions. Moreover, the boundary between Computer Science and other subjects is becoming ever more fluid; for instance, aspects of computation are becoming increasingly embedded in core Mathematics and new algorithmic aspects of topics such as combinatorics, probability, algebra, and topology, are rapidly emerging. In short, there are massive opportunities for research in algorithmics to be transformative across science, technology, and society. The key aim of the AlgoUK network of researchers is to facilitate multi-faceted interactions within the UK's algorithmic research community and also inter-disciplinary interactions between these researchers and those in industry and other subjects such as Mathematics, Biology, and Chemistry. The founding research groups, and hosting sites for the workshops, are at Durham, Kings College London, Leicester, Liverpool, Royal Holloway, and Warwick, but the network is open to all who wish to engage with it.