scientific article; zbMATH DE number 1324671
From MaRDI portal
Publication:4255576
Recommendations
Cited in
(72)- Problems and results in extremal combinatorics. I.
- Sixty years of network reliability
- Note on maximal bisection above tight lower bound
- A modular approach to shared-memory consensus, with applications to the probabilistic-write model
- On the automatizability of polynomial calculus
- The hardest halfspace
- Hypergraph encodings of arbitrary toric ideals
- Fooling views: a new lower bound technique for distributed computations under congestion
- The multicovering radius problem for some types of discrete structures
- \(\{0, 2 \}\)-degree free spanning forests in graphs
- On matrices, automata, and double counting in constraint programming
- Cancellation-free circuits in unbounded and bounded depth
- Treewidth computation and extremal combinatorics
- The covering radius problem for sets of 1-factors of the complete uniform hypergraphs
- On kernelization and approximation for the vector connectivity problem
- The unbounded-error communication complexity of symmetric functions
- Optimal cover time for a graph-based coupon collector process
- Toric algebra of hypergraphs
- Forbidden graphs for classes of split-like graphs
- Choosability of graphs with infinite sets of forbidden differences
- Mediated digraphs and quantum nonlocality
- Locally consistent constraint satisfaction problems
- Two algorithms for LCS consecutive suffix alignment
- Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey
- The relative exponential time complexity of approximate counting satisfying assignments
- Parameterized algorithms and kernels for 3-hitting set with parity constraints
- Kolmogorov width of discrete linear spaces: an approach to matrix rigidity
- Dispersing Hash functions
- Extremal combinatorics. With applications in computer science
- Extremal and probabilistic combinatorics. Paper from the 28th Brazilian mathematics colloquium -- 28\(^{\text o}\) Colóquio Brasileiro de Matemática, Rio de Janeiro, Brazil, July 2011
- The relative exponential time complexity of approximate counting satisfying assignments
- Witness Sets
- On sunflowers and matrix multiplication
- DNF sparsification and a faster deterministic counting algorithm
- Balanced hashing, color coding and approximate counting
- On minimum saturated matrices
- scientific article; zbMATH DE number 3974960 (Why is no real title available?)
- scientific article; zbMATH DE number 41612 (Why is no real title available?)
- Random low-degree polynomials are hard to approximate
- scientific article; zbMATH DE number 2059950 (Why is no real title available?)
- scientific article; zbMATH DE number 1792287 (Why is no real title available?)
- Extremal problems for finite sets
- scientific article; zbMATH DE number 815093 (Why is no real title available?)
- Reaction systems and extremal combinatorics properties
- Estimating parameters associated with monotone properties
- Parameterized constraint satisfaction problems: a survey
- Lattices and hypergraphs associated to square-free monomial ideals
- Enumerating matroids of fixed rank
- Maximum cardinality neighbourly sets in quadrilateral free graphs
- An initial study of time complexity in infinite-domain constraint satisfaction
- Separation and Witnesses
- The Parameterized Complexity of the Unique Coverage Problem
- Extremal combinatorial problems and their applications.
- On the complexity of deciding avoidability of sets of partial words
- Extremal bipartite independence number and balanced coloring
- Singular surfaces, mod 2 homology, and hyperbolic volume. II.
- More on the Magnus-Derek game
- On strategy improvement algorithms for simple stochastic games
- Dominating set is fixed parameter tractable in claw-free graphs
- Set systems: order types, continuous nondeterministic deformations, and quasi-orders
- On the induced matching problem
- On the number of ideals of the Niederreiter-Rosenbloom-Tsfasman poset and lower bounds on covering codes
- Ascending subgraph decomposition
- Derandomization with Conditional Expectations
- Invitation to intersection problems for finite sets
- Random deviations of ergodic sums for the Pascal adic transformation in the case of the Lebesgue measure
- Unrestricted vs restricted cut in a tableau method for Boolean circuits
- Avoiding arithmetic progressions in cyclic groups
- A note on the size of minimal covers
- A Boolean measure of similarity
- Problems and results in extremal combinatorics. II
- Lower bounds for the transition complexity of NFAs
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 Q4255576)
