Efficient constructions of hitting sets for systems of linear functions
type: Item
instance of: scholarly article
title: Efficient constructions of Hitting Sets for systems of linear functions
zbMATH Open document ID: 1499.68138
published in: Lecture Notes in Computer Science
publication date: 2022-11-09T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 06E30
Mathematics Subject Classification ID: 68Q06
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 7614483
author: Alexander E. Andreev
author: Andrea Clementi
author: José Rolim
MaRDI profile type: MaRDI publication profile
cites work: On the complexity of realization of partial Boolean functions by circuits of functional elements
cites work: Q4818849
cites work: On the power of two-point based sampling
cites work: Matchings and covers in hypergraphs
cites work: Approximating the Number of Zeroes of a GF[2] Polynomial
cites work: Efficient construction of a small hitting set for combinatorial rectangles in high dimension
cites work: Q5672822
cites work: Hardness vs randomness
cites work: Q3745279
DOI: 10.1007/BFB0023475
Recommended article: Efficient construction of a small hitting set for combinatorial rectangles in high dimension
Recommended article: Q4501678
Recommended article: Optimal Hitting Sets for Combinatorial Shapes
Recommended article: Optimal hitting sets for combinatorial shapes
Recommended article: A lower bound for the hitting set size for combinatorial rectangles and an application
description: scientific article; zbMATH DE number 7614483