Pages that link to "Item:Q1095658"
From MaRDI portal
The following pages link to Matching is as easy as matrix inversion (Q1095658):
Displaying 50 items.
- A note on parallel complexity of maximum \(f\)-matching (Q293199) (← links)
- Solving linear equations parameterized by Hamming weight (Q309792) (← links)
- Rural postman parameterized by the number of components of required edges (Q314816) (← links)
- Is Valiant-Vazirani's isolation probability improvable? (Q354652) (← links)
- On enumerating monomials and other combinatorial structures by polynomial interpolation (Q385504) (← links)
- Log-space algorithms for paths and matchings in \(k\)-trees (Q385514) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- New approaches to multi-objective optimization (Q403670) (← links)
- A two-stage hardware scheduler combining greedy and optimal scheduling (Q436901) (← links)
- Space complexity of perfect matching in bounded genus bipartite graphs (Q439936) (← links)
- The consequences of eliminating NP solutions (Q458458) (← links)
- Read-once polynomial identity testing (Q496300) (← links)
- Finding a shortest non-zero path in group-labeled graphs via permanent computation (Q524371) (← links)
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle (Q543415) (← links)
- Computing the shortest essential cycle (Q603870) (← links)
- Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in (Q654006) (← links)
- Minimizing the number of late jobs on a single machine under due date uncertainty (Q657256) (← links)
- Independent sets versus perfect matchings (Q673116) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization (Q708777) (← links)
- Deterministic algorithms for multi-criteria max-TSP (Q713324) (← links)
- Green's theorem and isolation in planar graphs (Q714498) (← links)
- A combinatoric interpretation of dual variables for weighted matching and \(f\)-factors (Q714819) (← links)
- Shortest \((A+B)\)-path packing via hafnian (Q724248) (← links)
- Approximating weighted matchings in parallel (Q845697) (← links)
- Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms (Q865749) (← links)
- A parallel algorithm for eliminating cycles in undirected graphs (Q910243) (← links)
- Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs (Q911300) (← links)
- A complexity theory of efficient parallel algorithms (Q913512) (← links)
- Subtree isomorphism is in random NC (Q922707) (← links)
- Nonlinear bipartite matching (Q924630) (← links)
- The ideal membership problem and polynomial identity testing (Q963063) (← links)
- Deterministically testing sparse polynomial identities of unbounded degree (Q976069) (← links)
- Approximation algorithms for maximum latency and partial cycle cover (Q1015324) (← links)
- Approximation algorithms for multi-criteria traveling salesman problems (Q1017906) (← links)
- List edge multicoloring in graphs with few cycles (Q1029053) (← links)
- Maximum weight bipartite matching in matrix multiplication time (Q1035683) (← links)
- Improved deterministic approximation algorithms for max TSP (Q1041779) (← links)
- Complexity of parallel matrix computations (Q1100892) (← links)
- A parallel algorithm for the maximal path problem (Q1100916) (← links)
- A random NC algorithm for depth first search (Q1104756) (← links)
- Parallel evaluation of the determinant and of the inverse of a matrix (Q1115596) (← links)
- Subtree isomorphism is NC reducible to bipartite perfect matching (Q1115630) (← links)
- Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs (Q1116690) (← links)
- NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems (Q1120597) (← links)
- On the random generation and counting of matchings in dense graphs (Q1129018) (← links)
- The image of weighted combinatorial problems (Q1179736) (← links)
- An introduction to randomized algorithms (Q1182319) (← links)
- Las Vegas RNC algorithms for unary weighted perfect matching and \(T\)-join problems (Q1183464) (← links)
- Perfect matching for regular graphs is \(AC^ 0\)-hard for the general matching problem (Q1185245) (← links)
