Dartmouth College Computer Science
Technical Report series
TR search TR listserv
|By author:||A B C D E F G H I J K L M N O P Q R S T U V W X Y Z|
|By number:||2017, 2016, 2015, 2014, 2013, 2012, 2011, 2010, 2009, 2008, 2007, 2006, 2005, 2004, 2003, 2002, 2001, 2000, 1999, 1998, 1997, 1996, 1995, 1994, 1993, 1992, 1991, 1990, 1989, 1988, 1987, 1986|
Boolean functions are at the heart of all computations, and all
Boolean functions can be reduced to a sum of pattern-matching
functions, called minterm-cyclic functions. In this thesis, we
examine properties of polynomials representing minterm-cyclic
Boolean functions. We use the term "saturated" to represent a
polynomial with degree equal to input size n for all n; this indicates
the intuitive notion that such functions are in some way complex,
or difficult to compute.
We present three main results. Firstly, there exist an infinite number of monotone minterm-cyclic functions that are not saturated. Secondly, for a specific class of minterms called self-avoiding minterms, we prove that the associated pattern-matching functions are not saturated; specifically, they can only have non-zero degree-n coefficients for n a multiple of the size of the minterm. Thirdly, for self-avoiding minterms that contain some '*', the degree-n coefficients are always zero. These results may have implications in the fields of algebraic cryptographic attacks or efficiency of error-correcting codes.
Senior Honors Thesis. Advisor: Amit Chakrabarti.
Bibliographic citation for this report: [plain text] [BIB] [BibTeX] [Refer]
Or copy and paste:
Matthew J. Harding, "Polynomial and Query Complexity of Minterm-Cyclic Functions." Dartmouth Computer Science Technical Report TR2013-740, May 2013.
Notify me about new tech reports.
Search the technical reports.
To receive paper copy of a report, by mail, send your address and the TR number to reports AT cs.dartmouth.edu
Copyright notice: The documents contained in this server are included by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
Technical reports collection maintained by David Kotz.