CARTESIAN PRODUCT PARTITIONING OF MULTI-DIMENSIONAL REACHABLE STATE SPACES

DOI10.1017/S0269964816000085zbMath1370.60124OpenAlexW2404352813MaRDI QIDQ5358087

M. Can Orhan, Tuǧrul Dayar

Publication date: 19 September 2017

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0269964816000085

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

On Vector-Kronecker Product Multiplication with Rectangular Factors, CARTESIAN PRODUCT PARTITIONING OF MULTI-DIMENSIONAL REACHABLE STATE SPACES

Uses Software

• LDQBD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rectangular partition is polynomial in two dimensions but NP-complete in three
• Note on induced subgraphs of the unit distance graph \(E^ n\)
• Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles
• Comparison of multilevel methods for Kronecker-based Markovian representations
• Structured analysis approaches for large Markov chains
• Analyzing Markov Chains using Kronecker Products
• Minimal rectangular partitions of digitized blobs
• Three Partition Refinement Algorithms
• Lectures on Polytopes
• CARTESIAN PRODUCT PARTITIONING OF MULTI-DIMENSIONAL REACHABLE STATE SPACES
• PARTITIONING 3D PHANTOMS INTO HOMOGENEOUS CUBOIDS