Q5226195 (Q5226195): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 16:27, 30 December 2024

scientific article; zbMATH DE number 7087310

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7087310

Statements

scholarly article

0 references

publication date

30 July 2019

0 references

MaRDI profile type

MaRDI publication profile

0 references

Near-optimal pseudorandom generators for constant-depth read-once formulas

0 references

Fourier and circulant matrices are not rigid

0 references

Nullstellensatz size-degree trade-offs from reversible pebbling

0 references

Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity

0 references

0 references

0 references

Time-space lower bounds for two-pass learning

0 references

Parity helps to compute majority

0 references

Size-degree trade-offs for sums-of-squares and positivstellensatz proofs

0 references

Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision

0 references

0 references

0 references

0 references

Relations and equivalences between circuit lower bounds and karp-lipton theorems

0 references

A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties

0 references

Imperfect gaps in Gap-ETH and PCPs

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

10.4230/LIPICS.CCC.2019.0

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5226195

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