Back to Results
First PageMeta Content
Planar graphs / Graph coloring / NP-complete problems / Matching / Tree decomposition / Edge coloring / Clique / Minimum spanning tree / Shortest path problem / Graph theory / Theoretical computer science / Graph operations


Abstracts Manuel Bodirsky, Ecole Polytechnique The Product Ramsey Theorem in Constraint Satisfaction Complexity In this talk, I show how the product Ramsey theorem can be used jointly with tools from universal algebra to
Add to Reading List

Document Date: 2008-06-05 10:03:31


Open Document

File Size: 70,38 KB

Share Result on Facebook

City

Rostock / /

Company

The star / /

Currency

USD / /

Facility

Humboldt University / University of Oslo The / /

IndustryTerm

approximation algorithm / distributed algorithm / polynomial time algorithm / constant time algorithm / non-adaptive algorithm / wireless ad hoc networks / data mining / example cell phon es networks / wireless sensor networks / approximation algorithms / /

Organization

Christian-Albrechts-Universität / Carnegie Mellon University / Yonsei University / University of Oslo / Adam Mickiewicz University / Ecole Polytechnique The Product Ramsey Theorem / Humboldt-Universität / Universität Rostock A Turan / /

Person

Oleg Pikhurko / Alan Frieze / Tom Bohman / Andrew Beveridge / Florian Pfender / Jeong Han Kim / Julia Böttcher / Wojciech Wawrzyniak / Anand Srivastav / Manuel Bodirsky / Stefan Kirchner / Andreas Würfl / G. Mariano Zelke / /

Position

first player / /

Technology

alpha / Adam / artificial intelligence / polynomial time algorithm / approximation algorithm / non-adaptive algorithm / approximation algorithms / data mining / cell phones / constant time algorithm / planar graph G. The algorithm / random access / /

SocialTag