The following pages link to (Q4255576):
Displaying 50 items.
- Kolmogorov width of discrete linear spaces: an approach to matrix rigidity (Q301519) (← links)
- The relative exponential time complexity of approximate counting satisfying assignments (Q309794) (← links)
- On sunflowers and matrix multiplication (Q354642) (← links)
- DNF sparsification and a faster deterministic counting algorithm (Q354649) (← links)
- On minimum saturated matrices (Q367048) (← links)
- Random low-degree polynomials are hard to approximate (Q430841) (← links)
- Reaction systems and extremal combinatorics properties (Q496044) (← links)
- Enumerating matroids of fixed rank (Q510313) (← links)
- Maximum cardinality neighbourly sets in quadrilateral free graphs (Q511689) (← links)
- An initial study of time complexity in infinite-domain constraint satisfaction (Q514144) (← links)
- On the complexity of deciding avoidability of sets of partial words (Q606993) (← links)
- Singular surfaces, mod 2 homology, and hyperbolic volume. II. (Q616950) (← links)
- More on the Magnus-Derek game (Q620945) (← links)
- On strategy improvement algorithms for simple stochastic games (Q635740) (← links)
- Dominating set is fixed parameter tractable in claw-free graphs (Q650938) (← links)
- Set systems: order types, continuous nondeterministic deformations, and quasi-orders (Q653312) (← links)
- On the induced matching problem (Q657915) (← links)
- Partial covering arrays: algorithms and asymptotics (Q726106) (← links)
- Invitation to intersection problems for finite sets (Q739389) (← links)
- Random deviations of ergodic sums for the Pascal adic transformation in the case of the Lebesgue measure (Q748505) (← links)
- Unrestricted vs restricted cut in a tableau method for Boolean circuits (Q812394) (← links)
- Avoiding arithmetic progressions in cyclic groups (Q817414) (← links)
- A note on the size of minimal covers (Q845985) (← links)
- A Boolean measure of similarity (Q860381) (← links)
- Problems and results in extremal combinatorics. II (Q941386) (← links)
- Lower bounds for the transition complexity of NFAs (Q955341) (← links)
- Problems and results in extremal combinatorics. I. (Q1417566) (← links)
- Sixty years of network reliability (Q1616159) (← links)
- Note on maximal bisection above tight lower bound (Q1675768) (← links)
- A modular approach to shared-memory consensus, with applications to the probabilistic-write model (Q1938364) (← links)
- On the automatizability of polynomial calculus (Q1959382) (← links)
- The hardest halfspace (Q1983325) (← links)
- Hypergraph encodings of arbitrary toric ideals (Q2000641) (← links)
- Fooling views: a new lower bound technique for distributed computations under congestion (Q2220402) (← links)
- The multicovering radius problem for some types of discrete structures (Q2248636) (← links)
- \(\{0, 2 \}\)-degree free spanning forests in graphs (Q2339439) (← links)
- On matrices, automata, and double counting in constraint programming (Q2342587) (← links)
- Cancellation-free circuits in unbounded and bounded depth (Q2348031) (← links)
- Treewidth computation and extremal combinatorics (Q2392037) (← links)
- The covering radius problem for sets of 1-factors of the complete uniform hypergraphs (Q2407022) (← links)
- On kernelization and approximation for the vector connectivity problem (Q2408198) (← links)
- The inverse Shapley value problem (Q2411521) (← links)
- The unbounded-error communication complexity of symmetric functions (Q2428632) (← links)
- Optimal cover time for a graph-based coupon collector process (Q2434930) (← links)
- Toric algebra of hypergraphs (Q2441562) (← links)
- Forbidden graphs for classes of split-like graphs (Q2441949) (← links)
- Choosability of graphs with infinite sets of forbidden differences (Q2462372) (← links)
- Mediated digraphs and quantum nonlocality (Q2565849) (← links)
- Locally consistent constraint satisfaction problems (Q2581264) (← links)
- Two algorithms for LCS consecutive suffix alignment (Q2643733) (← links)
