Pages that link to "Item:Q642463"
From MaRDI portal
The following pages link to Boolean function complexity. Advances and frontiers. (Q642463):
Displaying 50 items.
- Alternation, sparsity and sensitivity: bounds and exponential gaps (Q2632012) (← links)
- Circuit lower bounds from learning-theoretic approaches (Q2636410) (← links)
- Partial order games (Q2669153) (← links)
- Nearest neighbor representations of Boolean functions (Q2672259) (← links)
- Lower bounds for Boolean circuits of bounded negation width (Q2672949) (← links)
- On the binary and Boolean rank of regular matrices (Q2689370) (← links)
- Deciding FO-definability of regular languages (Q2695357) (← links)
- Grafting key trees: efficient key management for overlapping groups (Q2697894) (← links)
- Tropical complexity, Sidon sets, and dynamic programming (Q2832574) (← links)
- No Small Nondeterministic Read-Once Branching Programs for CNFs of Bounded Treewidth (Q2946031) (← links)
- Constructive Relationships Between Algebraic Thickness and Normality (Q2947873) (← links)
- Improved Average-Case Lower Bounds for De Morgan Formula Size: Matching Worst-Case Lower Bound (Q2963581) (← links)
- (Q3077976) (← links)
- Circuit Complexity Meets Ontology-Based Data Access (Q3194705) (← links)
- On Compiling Structured CNFs to OBDDs (Q3194709) (← links)
- (Q3304156) (← links)
- A sprouting tree model for random boolean functions (Q3460511) (← links)
- (Q3762226) (← links)
- (Q4036699) (← links)
- (Q4542178) (← links)
- On the Complexity of Multivalued Logic Functions over Some Infinite Basis (Q4553643) (← links)
- Communication Lower Bounds via Critical Block Sensitivity (Q4554052) (← links)
- Formulas versus Circuits for Small Distance Connectivity (Q4554075) (← links)
- Deterministic Communication vs. Partition Number (Q4562279) (← links)
- Extension Complexity of Independent Set Polytopes (Q4606697) (← links)
- Testing \(k\)-monotonicity (Q4638079) (← links)
- What Circuit Classes Can Be Learned with Non-Trivial Savings? (Q4638080) (← links)
- Stabbing planes (Q4993273) (← links)
- (Q5009536) (← links)
- Hardness magnification near state-of-the-art lower bounds (Q5028364) (← links)
- (Q5028438) (← links)
- On the Decision Tree Complexity of Threshold Functions (Q5042240) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization (Q5080481) (← links)
- (Q5088887) (← links)
- Adventures in monotone complexity and TFNP (Q5090415) (← links)
- The Orthogonal Vectors Conjecture for Branching Programs and Formulas (Q5090426) (← links)
- Lower Bounds for DeMorgan Circuits of Bounded Negation Width (Q5090491) (← links)
- Lifting Theorems for Equality (Q5090501) (← links)
- (Q5091223) (← links)
- Hardness magnification near state-of-the-art lower bounds (Q5091779) (← links)
- Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs (Q5092411) (← links)
- Algorithms and lower bounds for de morgan formulas of low-communication leaf gates (Q5092464) (← links)
- (Q5092472) (← links)
- On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions (Q5098770) (← links)
- Worst-Case to Average-Case Reductions for Subclasses of P (Q5098780) (← links)
- On Constant-Depth Canonical Boolean Circuits for Computing Multilinear Functions (Q5098782) (← links)
- Query-to-Communication Lifting for BPP (Q5117373) (← links)
- (Q5121893) (← links)
- (Q5121902) (← links)