Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms A. Hardness of V ITERBI PATH with small alphabet: Proof Throughout the proof, we set p = d Cε e and α = C

Source URL: proceedings.mlr.press

Optimal Deterministic Routing and Sorting on the Congested Clique Christoph Lenzen Massachusetts Institute of Technology 32 Vassar StreetCambridge, USA

Source URL: people.csail.mit.edu

Proof, beliefs, and algorithms through the lens of sum-of-squares 1 An integrality gap for the planted clique problem The Planted Clique problem (sometimes referred to as the hidden clique

Source URL: sumofsquares.org

Noname manuscript No. (will be inserted by the editor) Algebraic Methods in the Congested Clique Keren Censor-Hillel · Petteri Kaski · Janne H. Korhonen · Christoph Lenzen · Ami Paz · Jukka Suomela

Source URL: people.mpi-inf.mpg.de

CS364A: Algorithmic Game Theory Lecture #20: Mixed Nash Equilibria and PPAD-Completeness∗ Tim Roughgarden† December 4, 2013 Today we continue our study of the limitations of learning dynamics and polynomial-time

Source URL: theory.stanford.edu

• Computational complexity theory
• Theory of computation
• Complexity classes
• NP
• Clique problem
• Linear programming
• P
• Algorithm
• Time complexity
• Optimization problem
• Book:Graph Theory
• P versus NP problem

Efficient Comparison of Massive Graphs Through The Use Of ‘Graph Fingerprints’ Stephen Bonner John Brennan

Source URL: www.mlgworkshop.org

• Graph theory
• Graph
• Vertex
• Clique
• Matching
• Neighbourhood
• Ear decomposition
• Line graph

On the Structure of Affective and Effective Sociometric Relations in a Closed Group Over Time H. Russell Bernard Dept. of Soc./Anthro. West Virginia University Morgantown, W. VaPeter D. Killworth Dept. of Applied

Source URL: nersp.nerdc.ufl.edu

• Academia
• Social groups
• Organizational theory
• Psychodrama
• Quantitative research
• Sociometry
• Clique
• Adolescent cliques
• Social network
• Sociogram
• Peter Killworth
• Emotion

Noname manuscript No. (will be inserted by the editor) Subjective interestingness of subgraph patterns Matthijs van Leeuwen · Tijl De Bie · Eirini Spyropoulou · C´

Source URL: www.patternsthatmatter.org

• Graph theory
• Mathematics
• Dense graph
• Graph
• Clique
• NP-complete problems
• Spanning tree

Literaturverzeichnis 1. Alizadeh, F): A sublinear-time randomized parallel algorithm for the maximum clique problem in perfect graphs. Proceedings of the second ACMSIAM Symposium on Discrete Algorithms 2. Alizade

Source URL: www.opt.uni-duesseldorf.de

• Mathematical optimization
• Numerical analysis
• Mathematical analysis
• Linear programming
• Convex optimization
• Interior point method
• Quadratic programming
• Global optimization
• Robert J. Vanderbei
• Quasi-Newton method
• Nonlinear programming
• Linear matrix inequality

Distributed Computing manuscript No. (will be inserted by the editor) Determining Majority in Networks with Local Interactions and very Small Local Memory George B. Mertzios · Sotiris E. Nikoletseas ·

Source URL: community.dur.ac.uk

• Graph theory
• Mathematics
• Discrete mathematics
• Graph coloring
• Graph
• Clique
• Randomized algorithm