scientific article; zbMATH DE number 3829252
From MaRDI portal
Publication:3674058
zbMATH Open0523.68036MaRDI QIDQ3674058FDOQ3674058
Authors: Hans Ulrich Simon 
Publication date: 1983
Title of this publication is not available (Why is that?)
Analysis of algorithms and problem complexity (68Q25) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Cited In (13)
- Size of Sets with Small Sensitivity: A Generalization of Simon’s Lemma
- An improved lower bound on the sensitivity complexity of graph properties
- On induced subgraphs of the cube
- Properties of complexity measures for PRAMs and WRAMs
- The equivalence of two problems on the cube
- Alternation, sparsity and sensitivity: bounds and exponential gaps
- Does Looking Inside a Circuit Help
- How low can approximate degree and quantum query complexity be for total Boolean functions?
- Title not available (Why is that?)
- Title not available (Why is that?)
- From the sum-of-squares representation of a Boolean function to an optimal exact quantum query algorithm
- Rainbow Coloring Hardness via Low Sensitivity Polymorphisms
- Rainbow Coloring Hardness via Low Sensitivity Polymorphisms
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3674058)
