scientific article
From MaRDI portal
Publication:3674058
zbMath0523.68036MaRDI QIDQ3674058
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items
Alternation, sparsity and sensitivity: bounds and exponential gaps, On induced subgraphs of the cube, Size of Sets with Small Sensitivity: A Generalization of Simon’s Lemma, Unnamed Item, From the sum-of-squares representation of a Boolean function to an optimal exact quantum query algorithm, How low can approximate degree and quantum query complexity be for total Boolean functions?, The equivalence of two problems on the cube, An improved lower bound on the sensitivity complexity of graph properties, Properties of complexity measures for PRAMs and WRAMs, Rainbow Coloring Hardness via Low Sensitivity Polymorphisms, Unnamed Item, Does Looking Inside a Circuit Help, Rainbow Coloring Hardness via Low Sensitivity Polymorphisms
