CS264: Homework #8 Due by midnight on Wednesday, November 19, 2014 Instructions: (1) Students taking the course pass-fail should complete the exercises. Students taking the course for a letter grade should also complete

Source URL: theory.stanford.edu

• Computational complexity theory
• Operations research
• Theory of computation
• Mathematics
• Knapsack problem
• Optimization problem
• NP
• Mathematical optimization
• Polynomial-time approximation scheme
• Dynamic programming
• Time complexity
• Isolation lemma

On the Hardness of Being Truthful Christos Papadimitriou Michael Schapira

Source URL: www.dcg.ethz.ch

• Theory of computation
• Complexity classes
• Mathematics
• Theoretical computer science
• Valuation
• Submodular set function
• NC
• NP
• Reduction
• P/poly

Resum men                                       Edith Vázq quez León EN NP 7 / Gabrieela Reding B Borjas ENP 9 Tips para estudiar 

Source URL: www.prepa9.unam.mx

Output-Sensitive Construction of the Union of Triangles  Esther Ezra and Micha Sharir School of Computer Science

Source URL: www.math.tau.ac.il

• Computational complexity theory
• Theory of computation
• Analysis of algorithms
• NP-complete problems
• Set cover problem
• Randomized algorithm
• Time complexity
• Minimum spanning tree
• Point location

CS681: Advanced Topics in Computational Biology Week 7 Lectures 2-3 Can Alkan EA224

Source URL: www.cs.bilkent.edu.tr

• Graph theory
• Mathematics
• Computational complexity theory
• NP-complete problems
• Hamiltonian path
• Eulerian path
• Travelling salesman problem
• Cycle
• Seven Bridges of Knigsberg
• Path
• NP-completeness
• Shortest path problem

The breakpoint distance for signed sequences (extended abstract) Guillaume Blin1 , Cedric Chauve2 and Guillaume Fertin1 1 2

Source URL: pagesperso.lina.univ-nantes.fr

• Computational complexity theory
• Graph theory
• Mathematics
• NP-complete problems
• Combinatorial optimization
• Matching
• Vertex cover
• Gene

Spectral Graph Theory and Applications WSLecture 7: Hitting Time and Cover Time of Random Walks Lecturer: Thomas Sauerwald & He Sun

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

• Graph theory
• Mathematics
• NP-complete problems
• Degree
• Algebraic graph theory
• Covering graph
• Line graph

CS261: Exercise Set #7 For the week of February 15–19, 2016 Instructions: (1) Do not turn anything in. (2) The course staff is happy to discuss the solutions of these exercises with you in office hours or on Piazza.

Source URL: theory.stanford.edu

• Graph theory
• Mathematics
• NP-complete problems
• Matroid theory
• Steiner tree problem
• Bipartite graph
• Eulerian path
• Graph
• Degree
• Ear decomposition
• Directed graph
• Cycle

Hierarchies in Fragments of Monadic Strict NP Barnaby Martin and Florent Madelaine Department of Computer Science, University of Durham, Science Labs, South Road, Durham DH1 3LE, U.K. Abstract. We expose a strict hierar

Source URL: www.bedewell.com

• Graph theory
• Mathematics
• Graph coloring
• Homomorphism
• Morphisms
• XTR
• Order

District Development Committee, Dolakha Final Report on DISTRICT CLIMATE AND ENERGY PLAN Dolakha District

Source URL: aepc.gov.np

• Energy
• Sustainability
• Natural environment
• Renewable energy
• Energy policy
• Biodegradation
• Biogas
• Fuels
• Waste management
• Cook stove
• Energy development
• Energy conservation