Pages that link to "Item:Q5916126"
From MaRDI portal
The following pages link to Derandomizing polynomial identity tests means proving circuit lower bounds (Q5916126):
Displaying 50 items.
- Subexponential size hitting sets for bounded depth multilinear formulas (Q301528) (← links)
- Factors of low individual degree polynomials (Q301529) (← links)
- Amplifying circuit lower bounds against polynomial time, with applications (Q354644) (← links)
- Is Valiant-Vazirani's isolation probability improvable? (Q354652) (← links)
- Pseudorandom generators for combinatorial checkerboards (Q395607) (← links)
- On derandomization and average-case complexity of monotone functions (Q428873) (← links)
- Pseudorandom generators, typically-correct derandomization, and circuit lower bounds (Q430845) (← links)
- Weak derandomization of weak algorithms: explicit versions of Yao's lemma (Q451107) (← links)
- A Wronskian approach to the real \(\tau\)-conjecture (Q480686) (← links)
- Lower bounds against weakly-uniform threshold circuits (Q486977) (← links)
- Read-once polynomial identity testing (Q496300) (← links)
- Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds (Q645124) (← links)
- Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in (Q654006) (← links)
- Building above read-once polynomials: identity testing and hardness of representation (Q727964) (← links)
- Deterministic polynomial identity tests for multilinear bounded-read formulae (Q901932) (← links)
- Deterministically testing sparse polynomial identities of unbounded degree (Q976069) (← links)
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time (Q976105) (← links)
- Exotic quantifiers, complexity classes, and complete problems (Q1022429) (← links)
- Constructive non-commutative rank computation is in deterministic polynomial time (Q1630376) (← links)
- Sums of read-once formulas: how many summands are necessary? (Q1686070) (← links)
- Deterministic identity testing for sum of read-once oblivious arithmetic branching programs (Q1686835) (← links)
- Evaluation of circuits over nilpotent and polycyclic groups (Q1750355) (← links)
- Towards a tight hardness-randomness connection between permanent and arithmetic circuit identity testing (Q1941704) (← links)
- Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games (Q2012178) (← links)
- Fourier concentration from shrinkage (Q2012185) (← links)
- Complexity of packing common bases in matroids (Q2039228) (← links)
- Blackbox identity testing for sum of special ROABPs and its border class (Q2041244) (← links)
- Factorization of polynomials given by arithmetic branching programs (Q2051373) (← links)
- Singular tuples of matrices is not a null cone (and the symmetries of algebraic varieties) (Q2054204) (← links)
- A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with \(2\times 2\) submatrices (Q2061866) (← links)
- Edmonds' problem and the membership problem for orbit semigroups of quiver representations (Q2079660) (← links)
- Improved hitting set for orbit of ROABPs (Q2087774) (← links)
- A combinatorial algorithm for computing the rank of a generic partitioned matrix with \(2 \times 2\) submatrices (Q2089763) (← links)
- Computing valuations of the Dieudonné determinants (Q2100059) (← links)
- Real \(\tau \)-conjecture for sum-of-squares: a unified approach to lower bound and derandomization (Q2117077) (← links)
- Compression techniques in group theory (Q2117795) (← links)
- Emptiness problems for integer circuits (Q2182324) (← links)
- A note on parameterized polynomial identity testing using hitting set generators (Q2274524) (← links)
- Operator scaling: theory and applications (Q2309517) (← links)
- Proving that \(\mathrm{prBPP}=\mathrm{prP}\) is as hard as proving that ``almost NP'' is not contained in P/poly (Q2328311) (← links)
- Equivalence of polynomial identity testing and polynomial factorization (Q2351391) (← links)
- Mining circuit lower bound proofs for meta-algorithms (Q2351392) (← links)
- Monomials in arithmetic circuits: complete problems in the counting hierarchy (Q2353185) (← links)
- Generalized Wong sequences and their applications to Edmonds' problems (Q2353409) (← links)
- Reconstructive dispersers and hitting set generators (Q2391190) (← links)
- Non-commutative Edmonds' problem and matrix semi-invariants (Q2410690) (← links)
- Tripartite-to-bipartite entanglement transformation by stochastic local operations and classical communication and the structure of matrix spaces (Q2413447) (← links)
- The complexity of two problems on arithmetic circuits (Q2465637) (← links)
- Polynomial identity testing for depth 3 circuits (Q2472430) (← links)
- On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant (Q2514144) (← links)
