Co-Nondeterminism in Compositions
type: Item
instance of: scholarly article
title: Co-Nondeterminism in Compositions
zbMATH Open document ID: 1398.68249
DOI: 10.1145/2635808
author: Stefan Kratsch
published in: ACM Transactions on Algorithms
publication date: 2018-10-30T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C55
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6968283
zbMATH Keywords: kernelization
zbMATH Keywords: Ramsey numbers
zbMATH Keywords: nondeterminism
zbMATH Keywords: parameterized complexity
MaRDI profile type: MaRDI publication profile
full work available at URL: https://doi.org/10.1145/2635808
OpenAlex ID: W2133839241
Recommended article: Q5743382
Recommended article: RAMSEY-LIKE THEOREMS AND MODULI OF COMPUTATION
Recommended article: A lower bound for certain Ramsey type problems
Recommended article: Q3201758
Recommended article: An analogue of the Erdős-Ko-Rado theorem for weak compositions
Recommended article: Constructive bounds for a Ramsey-type problem
Recommended article: ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM
Recommended article: A lower bound on the size of resolution proofs of the Ramsey theorem
Recommended article: A new lower bound for a Ramsey-type problem
Recommended article: A short proof of an Erdős-Ko-Rado theorem for compositions
description: scientific article; zbMATH DE number 6968283