Detecting monomials with \(k\) distinct variables
type: Item
instance of: scholarly article
title: Detecting monomials with \(k\) distinct variables
zbMATH Open document ID: 1302.68312
author: Peter Floderus
author: Andrzej Lingas
author: Mia Persson
author: Dzmitry Sledneu
published in: Information Processing Letters
publication date: 2014-12-09T00:00:00Z
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6378631
zbMATH Keywords: algorithms
zbMATH Keywords: polynomial
zbMATH Keywords: monomial
zbMATH Keywords: arithmetic circuit
zbMATH Keywords: parametrized complexity
zbMATH Keywords: approximation hardness
MaRDI profile type: Publication
full work available at URL: j.ipl.2014.07.003
OpenAlex ID: W1966623661
cites work: On r-Simple k-Path
cites work: Secluded connectivity problems
cites work: Monomial Testing and Applications
cites work: The Parametrized Complexity of Some Fundamental Problems in Coding Theory
cites work: A threshold of ln n for approximating set cover
cites work: Faster Algebraic Algorithms for Path and Packing Problems
cites work: Limits and Applications of Group Algebras for Parameterized Problems
cites work: Q5710169
cites work: Finding paths of length \(k\) in \(O^{*}(2^k)\) time
DOI: 10.1016/J.IPL.2014.07.003
description: scientific article; zbMATH DE number 6378631