On the Complexity of Nondeterministically Testable Hypergraph Parameters Marek Karpinski∗ Roland Markó† - Marko - Document - PDFSEARCH.IO

First Page	Meta Content
	On the Complexity of Nondeterministically Testable Hypergraph Parameters Marek Karpinski∗ Roland Markó† Add to Reading List Document Date: 2015-03-25 03:59:26 Open Document File Size: 242,55 KB Share Result on Facebook Company Let AG / / Currency pence / / / Facility University of Bonn / / IndustryTerm machinery / / Organization University of Bonn / Hausdorff Center for Mathematics / Hausdroff Center for Mathematics / / Person Gq / / Product Pentax K-x Digital Camera / Altec XT1 Speakers / / SocialTag Line graph Hypergraph Graph theory Covering graph

On the Complexity of Nondeterministically Testable Hypergraph Parameters Marek Karpinski∗ Roland Markó†Add to Reading List