Parameterized Derandomization (Q3503586)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Parameterized Derandomization	scientific article

Statements

scholarly article

0 references

Parameterized Derandomization (English)

0 references

0 references

Parameterized and Exact Computation

0 references

publication date

5 June 2008

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-540-79723-4_15

0 references

Resolution Is Not Automatizable Unless W[P] Is Tractable

0 references

0 references

The parameterized complexity of maximality and minimality problems

0 references

Machine-based methods in parameterized complexity theory

0 references

Parameterized circuit complexity and the \(W\) hierarchy

0 references

Parametrized complexity theory.

0 references

Randomized Approximations of Parameterized Counting Problems

0 references

0 references

Towards a Taxonomy of Techniques for Designing Parameterized Algorithms

0 references

PP is as Hard as the Polynomial-Time Hierarchy

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-540-79723-4_15

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3503586

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