On deterministic approximation of DNF (Q1923857): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: \(\Sigma_ 1^ 1\)-formulae on finite structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast and simple randomized parallel algorithm for the maximal independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parity, circuits, and the polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monte-Carlo approximation algorithms for enumeration problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate inclusion-exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small-Bias Probability Spaces: Efficient Constructions and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01940873 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2114870555 / rank
 
Normal rank

Latest revision as of 12:11, 30 July 2024

scientific article
Language Label Description Also known as
English
On deterministic approximation of DNF
scientific article

    Statements

    Identifiers