Every graph is easy or hard: dichotomy theorems for graph problems Dániel Marx1 1 Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI) Budapest, Hungary

Source URL: www.cs.bme.hu

Introduction Underlying Mathematical Components Specification Security Theorems and Security Bounds Properties Hardware Results

Source URL: www.cryptoexperts.com

INDEPENDENT SETS IN HYPERGRAPHS ´ JOZSEF BALOGH, ROBERT MORRIS, AND WOJCIECH SAMOTIJ Abstract. Many important theorems and conjectures in combinatorics, such as the theorem of Szemer´edi on arithmetic progressions and

Source URL: w3.impa.br

Approximate Euclidean Ramsey theorems Adrian Dumitrescu∗ October 27, 2010 Abstract According to a classical result of Szemer´edi, every dense subset of 1, 2, . . . , N contains an

Source URL: www.cs.uwm.edu

A general framework for fixed point theorems, and more Franz-Viktor Kuhlmann joint work with Katarzyna Kuhlmann New York, July 2014

Source URL: math.usask.ca

Can the computer really help us to prove theorems?

Source URL: www.cs.ru.nl

• Proof assistants
• Automated theorem proving
• Logic in computer science
• Type theory
• Automath
• Logic for Computable Functions
• Nqthm
• Proof theory
• ACL2
• Mathematical proof
• Andrzej Trybulec
• Isabelle

Every graph is easy or hard: dichotomy theorems for graph problems Dániel Marx1 1 Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI) Budapest, Hungary

Source URL: www.cs.bme.hu

Three Theorems, with Computer-Aided Proofs, on Three-Dimensional Fa es and Quotients of Polytopes G unter Meisinger

Source URL: www.ma.huji.ac.il

Some Limit Theorems for M E, M D and CM ∞ J.Paris and A.Vencovsk´a ∗ Department of Mathematics University of Manchester Manchester M13 9PL UK

Source URL: www.maths.manchester.ac.uk

Stability Theorems for Fourier Frames and Wavelet Riesz Bases Radu Balan Program in Applied and Computational Mathematics Princeton University Princeton , NJ 08544

Source URL: www.math.umd.edu