Complexity with Rod (Q2970952)

From MaRDI portal

Jump to:navigation, search

scientific article

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

Statements

scholarly article

0 references

Complexity with Rod (English)

0 references

Computability and Complexity

0 references

publication date

4 April 2017

0 references

Lance J. Fortnow

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_8

0 references

Uniformly hard languages.

0 references

0 references

Algorithmic Randomness and Complexity

0 references

Infeasibility of instance compression and succinct PCPs for NP

0 references

On problems without polynomial kernels

0 references

On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications

0 references

New Limits to Classical and Quantum Instance Compression

0 references

Recursively enumerable sets of positive integers and their decision problems

0 references

0 references

On the Structure of Polynomial Time Reducibility

0 references

Robust simulations and significant separations

0 references

New non-uniform lower bounds for uniform classes

0 references

Identifiers

zbMATH Open document ID

0 references

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

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2970952

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