Surfing with Rod (Q2973715)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Surfing with Rod	scientific article

Statements

scholarly article

0 references

Surfing with Rod (English)

0 references

Michael R. Fellows

0 references

Computability and Complexity

0 references

publication date

4 April 2017

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-50062-1_2

0 references

On Problems without Polynomial Kernels (Extended Abstract)

0 references

Beyond <i>NP</i>-completeness for problems of bounded width (extended abstract)

0 references

Advice classes of parametrized tractability

0 references

0 references

The Birth and Early Years of Parameterized Complexity

0 references

0 references

Parameterized circuit complexity and the \(W\) hierarchy

0 references

Threshold dominating sets and an improved characterization of \(W[2]\)

0 references

0 references

The Parametrized Complexity of Some Fundamental Problems in Coding Theory

0 references

Nonconstructive advances in polynomial-time complexity

0 references

Nonconstructive tools for proving polynomial-time decidability

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-50062-1_2

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2973715

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2973715&oldid=36313624"