5,609 research outputs found
Enumeration of integral tetrahedra
We determine the numbers of integral tetrahedra with diameter up to
isomorphism for all via computer enumeration. Therefore we give an
algorithm that enumerates the integral tetrahedra with diameter at most in
time and an algorithm that can check the canonicity of a given
integral tetrahedron with at most 6 integer comparisons. For the number of
isomorphism classes of integral matrices with diameter
fulfilling the triangle inequalities we derive an exact formula.Comment: 10 pages, 1 figur
Pre-Reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs
The study of graph products is a major research topic and typically concerns
the term , e.g., to show that . In this paper, we
study graph products in a non-standard form where is a
"reduction", a transformation of any graph into an instance of an intended
optimization problem. We resolve some open problems as applications.
(1) A tight -approximation hardness for the minimum
consistent deterministic finite automaton (DFA) problem, where is the
sample size. Due to Board and Pitt [Theoretical Computer Science 1992], this
implies the hardness of properly learning DFAs assuming (the
weakest possible assumption).
(2) A tight hardness for the edge-disjoint paths (EDP)
problem on directed acyclic graphs (DAGs), where denotes the number of
vertices.
(3) A tight hardness of packing vertex-disjoint -cycles for large .
(4) An alternative (and perhaps simpler) proof for the hardness of properly
learning DNF, CNF and intersection of halfspaces [Alekhnovich et al., FOCS 2004
and J. Comput.Syst.Sci. 2008]
- …