Pages that link to "Item:Q1808187"
From MaRDI portal
The following pages link to The parallel search bench ZRAM and its applications (Q1808187):
Displaying 16 items.
- ZRAM (Q13782) (← links)
- Memory-efficient enumeration of constrained spanning trees (Q294700) (← links)
- Matroid enumeration for incidence geometry (Q664549) (← links)
- Optimal complexity reduction of polyhedral piecewise affine systems (Q958262) (← links)
- Solving large-scale QAP problems in parallel with the serach library ZRAM (Q1268834) (← links)
- Estimating the number of vertices of a polyhedron (Q1607035) (← links)
- \texttt{mplrs}: a scalable parallel vertex/facet enumeration code (Q1621690) (← links)
- A simple proof that the \((n^{2} - 1)\)-puzzle is hard (Q1637231) (← links)
- Parallel enumeration of triangulations (Q1658781) (← links)
- On parallel branch and bound frameworks for global optimization (Q1683320) (← links)
- Solving the \((n^2-1)\)-puzzle with \(\frac{8}{3}n^3\) expected moves (Q1736675) (← links)
- A Portable Parallel Implementation of the lrs Vertex Enumeration Code (Q2867140) (← links)
- (Q4399891) (← links)
- Hyperplane Arrangements in polymake (Q5041056) (← links)
- Output-sensitive cell enumeration in hyperplane arrangements (Q5054865) (← links)
- Enumerating the \(k\) best plane spanning trees (Q5931369) (← links)
