Skip to main navigation Skip to search Skip to main content

Symmetric functions capture general functions (Extended abstract)

  • Georgia Institute of Technology

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We show that the set of all functions is equivalent to the set of all symmetric functions (possibly over a larger domain) up to deterministic time complexity. In particular, for any function f, there is an equivalent symmetric function f sym such that f can be computed from f sym and vice-versa (modulo an extra deterministic linear time computation). For f over finite fields, f sym is (necessarily) over an extension field. This reduction is optimal in size of the extension field. For polynomial functions, the degree of f sym is not optimal. We present another reduction that has optimal degree "blowup" but is worse in the other parameters.

Original languageEnglish
Title of host publicationMathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Proceedings
Pages436-447
Number of pages12
DOIs
StatePublished - 2011
Event36th International Symposium on Mathematical Foundations of Computer Science, MFCS 2011 - Warsaw, Poland
Duration: Aug 22 2011Aug 26 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6907 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference36th International Symposium on Mathematical Foundations of Computer Science, MFCS 2011
Country/TerritoryPoland
CityWarsaw
Period08/22/1108/26/11

Fingerprint

Dive into the research topics of 'Symmetric functions capture general functions (Extended abstract)'. Together they form a unique fingerprint.

Cite this