Pages that link to "Item:Q642463"
From MaRDI portal
The following pages link to Boolean function complexity. Advances and frontiers. (Q642463):
Displaying 35 items.
- (Q5121903) (← links)
- On the resolution of the sensitivity conjecture (Q5123060) (← links)
- Exploring the Limits of Subadditive Approaches: Parallels between Optimization and Complexity Theory (Q5135262) (← links)
- On the hardness of approximate and exact (bichromatic) maximum inner product (Q5140838) (← links)
- Monotone circuit lower bounds from resolution (Q5140848) (← links)
- ON THE COMPLEXITY OF CIRCUITS IN BASES CONTAINING MONOTONE ELEMENTS WITH ZERO WEIGHTS (Q5150707) (← links)
- ON THE MEANING OF WORKS BY V. M. KHRAPCHENKO (Q5151450) (← links)
- On Expressing Majority as a Majority of Majorities (Q5220471) (← links)
- Flipping Out with Many Flips: Hardness of Testing $k$-Monotonicity (Q5243170) (← links)
- On the $AC^0$ Complexity of Subgraph Isomorphism (Q5737815) (← links)
- String Matching: Communication, Circuits, and Learning. (Q5875515) (← links)
- MaxSAT Resolution and Subcube Sums (Q5875950) (← links)
- Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes (Q5889793) (← links)
- Book review of: S. Jukna, Boolean function complexity. Advances and frontiers. (Q5890688) (← links)
- Rectangles are nonnegative juntas (Q5890971) (← links)
- Non-commutative circuits and the sum-of-squares problem (Q5892594) (← links)
- Regular expression length via arithmetic formula complexity (Q5918469) (← links)
- New bounds for energy complexity of Boolean functions (Q5918995) (← links)
- On (simple) decision tree rank (Q6050134) (← links)
- Algorithms and lower bounds for comparator circuits from shrinkage (Q6107895) (← links)
- Improvement of nonmonotone complexity estimates of \(k\)-valued logic functions (Q6114318) (← links)
- Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic (Q6135954) (← links)
- On the extension complexity of polytopes separating subsets of the Boolean cube (Q6156096) (← links)
- Communication and information complexity (Q6200329) (← links)
- Symmetrizable Boolean networks (Q6496146) (← links)
- Complexity of quantum circuits via sensitivity, magic, and coherence (Q6564161) (← links)
- Monotone classes beyond VNP (Q6589844) (← links)
- One-tape Turing machine and branching program lower bounds for MCSP (Q6614616) (← links)
- Depth-3 circuits for inner product (Q6614883) (← links)
- CNF encodings of symmetric functions (Q6635697) (← links)
- Energy and output patterns in Boolean circuits (Q6636082) (← links)
- Computationally hard problems for logic programs under answer set semantics (Q6636616) (← links)
- Cutting planes width and the complexity of graph isomorphism refutations (Q6636618) (← links)
- Perspective on complexity measures targeting read-once branching programs (Q6647765) (← links)
- Notes on Boolean read-\(k\) and multilinear circuits (Q6648273) (← links)
