Pages that link to "Item:Q5470804"
From MaRDI portal
The following pages link to On the Complexity of Some Enumeration Problems for Matroids (Q5470804):
Displaying 35 items.
- Monadic second-order model-checking on decomposable matroids (Q548278) (← links)
- On the complexity of enumerating pseudo-intents (Q628340) (← links)
- Trichotomies in the complexity of minimal inference (Q692908) (← links)
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry (Q708383) (← links)
- Generating cut conjunctions in graphs and related problems (Q930604) (← links)
- Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions (Q943838) (← links)
- On the complexity of monotone dualization and generating minimal hypergraph transversals (Q943847) (← links)
- Scientific contributions of Leo Khachiyan (a short overview) (Q944704) (← links)
- Jump number problem: The role of matroids (Q1057289) (← links)
- Matroid Steiner problems, the Tutte polynomial and network reliability (Q1088995) (← links)
- An inequality for polymatroid functions and its applications. (Q1410680) (← links)
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem (Q2007824) (← links)
- On the complexity of solution extension of optimization problems (Q2072063) (← links)
- Algorithmic aspects of Steiner convexity and enumeration of Steiner trees (Q2259027) (← links)
- Incremental delay enumeration: space and time (Q2274091) (← links)
- Linear codes over signed graphs (Q2291662) (← links)
- a-tint: a polymake extension for algorithmic tropical intersection theory (Q2441658) (← links)
- On the (co)girth of a connected matroid (Q2462384) (← links)
- Some hard problems on matroid spikes (Q2464317) (← links)
- On enumerating minimal dicuts and strongly connected subgraphs (Q2471808) (← links)
- Invited talks (Q2692717) (← links)
- Precision and sensitivity in detailed-balance reaction networks (Q2832989) (← links)
- On the Complexity of Matroid Isomorphism Problems (Q3392964) (← links)
- Matroid Complexity and Nonsuccinct Descriptions (Q3629456) (← links)
- Covering Vectors by Spaces: Regular Matroids (Q4555045) (← links)
- (Q5092436) (← links)
- Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular Matrices (Q5116482) (← links)
- Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices (Q5220475) (← links)
- ENUMERATING SPANNING AND CONNECTED SUBSETS IN GRAPHS AND MATROIDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) (Q5385037) (← links)
- A combinatorial search problem on matroids (Q5957832) (← links)
- Min‐sum controllable risk problems with concave risk functions of the same value range (Q6065855) (← links)
- Polynomial-delay enumeration algorithms in set systems (Q6104349) (← links)
- Quantum algorithms for learning hidden strings with applications to matroid problems (Q6199225) (← links)
- Hardness and approximation of submodular minimum linear ordering problems (Q6634527) (← links)
- New theoretical results on the monotone Boolean duality and the monotone Boolean dualization problems (Q6657241) (← links)
