In Theorem 8.17, you say that your condition (**) on the isomorphism a is enough to guarantee that ahA belongs to X (hA being the morphism defining the Hodge structure on H1 (A, Q)). However I believe that this only impl

Source URL: jmilne.org

Skolemising Blank Nodes while Preserving Isomorphism Aidan Hogan ∗ Department of Computer Science

Source URL: ciws.cl

Linear process algebra Vaughan Pratt Stanford University, Stanford CA, USA Abstract. A linear process is a system of events and states related

Source URL: boole.stanford.edu

• Algebra
• Mathematics
• Linear algebra
• Abstract algebra
• Transformation
• Functions and mappings
• Chu space
• Topology
• Linear map
• Vector space
• Algebra over a field
• Isomorphism

The Complexity of Order Type Isomorphism implementation of the predicate (e.g. solving geoGreg Aloupis1 John Iacono2 Stefan Langerman3 2 Stefanie Wuhrer4 ¨ ur Ozkan ¨ Ozg¨ Abstract The order type of a point set in Rd

Source URL: www-cs.engr.ccny.cuny.edu

Isomorphism Criterion for Monomial Graphs Vasyl Dmytrenko,1 Felix Lazebnik,1 and Raymond Viglione2 1

Source URL: www.math.udel.edu

2015 Knuth Prize Citation for L´ aszl´ o Babai The 2015 Donald E. Knuth Prize is awarded to L´aszl´o Babai of the University of Chicago for his fundamental contributions to theoretical computer science, including alg

Source URL: www.sigact.org

• Probabilistic complexity theory
• Theoretical computer science
• Morphisms
• Computational complexity theory
• PCP theorem
• Mathematical optimization
• Probabilistically checkable proof
• Combinatorica
• IP
• Algorithm
• Russell Impagliazzo
• Graph isomorphism

Graph Isomorphism Problem Parameterized by Width Parameters Yota Otachi1 1 Japan Pascal Schweitzer2

Source URL: 195.134.81.187

ISOMORPHISM RIGIDITY OF IRREDUCIBLE ALGEBRAIC Zd -ACTIONS BRUCE KITCHENS AND KLAUS SCHMIDT Abstract. An irreducible algebraic Zd -action α on a compact abelian group X is a Zd -action by automorphisms of X such that eve

Source URL: www.mat.univie.ac.at

Polynomial Time Algorithm for Graph Isomorphism Testing (V6 corrections) Michael I. Trofimov October 23, 2013 email: Definition 1. Vertex v ∈ V of a graph G = (V, E) and vertex v 0 ∈ V 0 of

Source URL: mt2.comtv.ru

A Structured-Specification Approach to Descriptive Complexity Claudia Elena Chiriţă – Faculty of Mathematics and Computer Science, University of Bucharest, Romania 1. Outline Theorem (Fagin). An isomorphism-closed cl

Source URL: womencourage.acm.org