Finite canonization
نویسندگان
چکیده
The canonization theorem says that for given m, n for some m (the first one is called ER(n;m)) we have for every function f with domain [1, . . . , m], for some A ∈ [1, . . . , m], the question of when the equality f(i1, . . . , in) = f(j1, . . . , jn) (where i1 < · · · < in and j1 < · · · jn are from A) holds has the simplest answer: for some v ⊆ {1, . . . , n} the equality holds iff ∧
منابع مشابه
Canonization for Lk-equivalence is Hard
Let Lk be the k-variable fragment of first-order logic, for some k 3. We prove that equivalence of finite structures in Lk has no P-computable canonization function unless NP P=poly. The latter assumption is considered as highly unlikely; in particular it implies a collapse of the polynomial hierarchy. The question for such a canonization function came up in the context of the problem of whethe...
متن کاملOn Isomorphism and Canonization of Tournaments and Hypertournaments
We give a polynomial-time oracle algorithm for Tournament Canonization that accesses oracles for Tournament Isomorphism and Rigid-Tournament Canonization. Extending the Babai-Luks Tournament Canonization algorithm, we give an n n) algorithm for canonization and isomorphism testing of k-hypertournaments, where n is the number of vertices and k is the size of hyperedges.
متن کاملA Log-space Algorithm for Canonization of Planar Graphs
Planar graph canonization is known to be hard for L this directly follows from L-hardness of tree-canonization [Lin92]. We give a log-space algorithm for planar graph canonization. This gives completeness for log-space under AC many-one reductions and improves the previously known upper bound of AC [MR91]. A planar graph can be decomposed into biconnected components. We give a log-space procedu...
متن کامل3-connected Planar Graph Isomorphism is in Log-space
We consider the isomorphism and canonization problem for 3-connected planar graphs. The problem was known to be L -hard and in UL ∩ coUL [TW08]. In this paper, we give a deterministic log-space algorithm for 3-connected planar graph isomorphism and canonization. This gives an L -completeness result, thereby settling its complexity. The algorithm uses the notion of universal exploration sequence...
متن کاملOn canonical forms of ring-linear codes
This work presents an algorithm for the computation of canonical forms of linear codes over arbitrary finite chain rings under the action of the linear isometry group. It is a generalization of a previous work by the author on the canonization of linear codes over finite fields. The algorithm is based on the ideas of partition refinements and it will compute the automorphism group of the code a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995