Recommendations
- Parameterized complexity of reconfiguration of atoms
- The complexity of selecting maximal solutions
- Turing machines with atoms, constraint satisfaction problems, and descriptive complexity
- Complexity of atoms, combinatorially
- scientific article; zbMATH DE number 176526
- scientific article; zbMATH DE number 1882054
- scientific article; zbMATH DE number 4130407
- The strong at-most-once problem
- The Maximum Solution Problem on Graphs
Cited in
(12)- Tropically convex constraint satisfaction
- Tractable combinations of theories via sampling
- Loop-checking and the uniform word problem for join-semilattices with an inflationary endomorphism
- Extremals of the supereigenvector cone in max algebra: a combinatorial description
- Tropical Fourier-Motzkin elimination, with an application to real-time verification
- Tropical linear-fractional programming and parametric mean payoff games
- Constraint satisfaction problems over numeric domains
- Tropical polar cones, hypergraph transversals, and mean payoff games
- MAX-closed semilinear constraint satisfaction
- Mean-payoff games and propositional proofs
- Algorithms and complexity of difference logic
- Hard problems in max-algebra, control theory, hypergraphs and other areas
This page was built for publication: The Max-Atom Problem and Its Relevance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505542)