<--- Back to Details
First PageDocument Content
NP-complete problems / Clique / Matching / Vertex cover / Tree / Circuit / Aanderaa–Karp–Rosenberg conjecture / Path decomposition / Graph theory / Theoretical computer science / Mathematics
Date: 2013-04-06 16:29:26
NP-complete problems
Clique
Matching
Vertex cover
Tree
Circuit
Aanderaa–Karp–Rosenberg conjecture
Path decomposition
Graph theory
Theoretical computer science
Mathematics

SIAM J. Comput-98 DISPROVING THE SINGLE LEVEL CONJECTURE ∗

Add to Reading List

Source URL: lovelace.thi.informatik.uni-frankfurt.de

Download Document from Source Website

File Size: 242,60 KB

Share Document on Facebook

Similar Documents

Artificial intelligence / Applied mathematics / Learning / Machine learning / Computational neuroscience / Artificial neural networks / Computational statistics / Monte Carlo tree search / Convolutional neural network / Reinforcement learning / Q-learning / Structured prediction

Thinking Fast and Slow with Deep Learning and Tree Search Thomas Anthony1, , Zheng Tian1 , and David Barber1,2 arXiv:1705.08439v4 [cs.AI] 3 Dec 2017

DocID: 1xVZc - View Document

Multiplexing / T-carrier / Schedule

SYNT Workshop - SyGuS Comp’17 SaturdayE3Solver: Decision Tree Unification by Enumeration

DocID: 1xVIR - View Document

Health / Caregiving / Worksafe / Home care / Insurance / Caregiver

Testimonial Green Tree Implements Simple, Impactful Safety Program with WorkSafe Website: greentreehc.com As a home care agency owner I had limited options for workers’

DocID: 1xV42 - View Document

arXiv:1802.00921v1 [cs.SE] 3 FebA deep tree-based model for software defect prediction Hoa Khanh Dam Trang Pham

DocID: 1xV1q - View Document