logo
    Invertible Polynomial Representation for Private Set Operations.
    IACR Cryptology ePrint Archive (2012)
    Hyung Tae LeeHyunsook HongJung Hee Cheon
    0
    Citation
    0
    Reference
    20
    Related Paper
    Keywords:
    Representation
    Topics:
    Logic, Reasoning, and Knowledge
    Polynomial and algebraic computation
    Complexity and Algorithms in Graphs
    Graph Polynomials: From Recursive Definitions To Subset Expansion Formulas
    arXiv (Cornell University) (2008)
    Benny GodlinEmilia KatzJohann A. Makowsky
    Many graph polynomials, such as the Tutte polynomial, the interlace polynomial and the matching polynomial, have both a recursive definition and a defining subset expansion formula. In this paper we present a general, logic-based framework which gives a precise meaning to recursive definitions of graph polynomials. We then prove that in this framework every recursive definition of a graph polynomial can be converted into a subset expansion formula.
    Tutte polynomial
    Chromatic polynomial
    Citations (3)
    The complexity of the word problems for commutative semigroups and polynomial ideals
    Advances in Mathematics (1982)
    Ernst MayrAlbert R. Meyer
    Citations (485)
    Polynomial approximations of the relational semantics of imperative programs
    Science of Computer Programming (2006)
    Michael A. Colón
    Abstract Interpretation
    Degree (music)
    Lattice (music)
    Citations (14)
    EUROSAM 84 : International Symposium on Symbolic and Algebraic Computation, Cambridge, England, July 9-11, 1984
    Springer eBooks (1984)
    EurosamJohn Fitch
    Gröbner basis
    Citations (0)
    A polynomial representation of algorithms
    Tomaso PoggioW. ReichardtW. Reichardt T. Poggio
    Representation
    Citations (0)
    Testing isomorphism of modules
    Journal of Algebra (2008)
    Peter A. BrooksbankEugene M. Luks
    Isomorphism (crystallography)
    Citations (51)
    Graph Polynomials: From Recursive Definitions to Subset Expansion Formulas
    Journal of Logic and Computation (2010)
    Benny GodlinEmilia KatzJohann A. Makowsky
    Journal Article Graph Polynomials: From Recursive Definitions to Subset Expansion Formulas Get access B. Godlin, B. Godlin Department of Computer Science, Technion–Israel Institute of Technology, 32000 Haifa, Israel.E-mail: bgodlin@cs.technion.ac.il; emika@cs.technion.ac.il; janos@cs.technion.ac.il Search for other works by this author on: Oxford Academic Google Scholar E. Katz, E. Katz Department of Computer Science, Technion–Israel Institute of Technology, 32000 Haifa, Israel.E-mail: bgodlin@cs.technion.ac.il; emika@cs.technion.ac.il; janos@cs.technion.ac.il Search for other works by this author on: Oxford Academic Google Scholar J. A. Makowsky J. A. Makowsky Department of Computer Science, Technion–Israel Institute of Technology, 32000 Haifa, Israel.E-mail: bgodlin@cs.technion.ac.il; emika@cs.technion.ac.il; janos@cs.technion.ac.il Search for other works by this author on: Oxford Academic Google Scholar Journal of Logic and Computation, Volume 22, Issue 2, April 2012, Pages 237–265, https://doi.org/10.1093/logcom/exq006 Published: 15 February 2010 Article history Received: 01 December 2008 Published: 15 February 2010
    Tutte polynomial
    Chromatic polynomial
    Citations (6)
    An Algorithmic Characterization of Polynomial Functions over ${\mathbb{Z}}_{p^{n}} $
    Algorithmica (2013)
    Ashwin GuhaAmbedkar Dukkipati
    Characterization
    Theory of computation
    Citations (3)
    Polynomial Embeddings and Representations
    Springer eBooks (2007)
    Tim Becker
    Citations (1)
    Algebraic Numbers, Field Extensions, and Minimal Polynomials
    Cambridge University Press eBooks (2004)
    John Swallow
    A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
    Citations (0)