New Upper Bounds on the Average PTF Density of Boolean Functions-Reference-Cited by-同舟云学术

New Upper Bounds on the Average PTF Density of Boolean Functions

Published:2010 Issue: Volume: Page:304-315
ISSN:0302-9743
Container-title:Algorithms and Computation
language:
Short-container-title:

Author:

Amano Kazuyuki

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-17517-6_28

Reference16 articles.

1. Amano, K.: Supplemental data of the paper are available at http://www.cs.gunma-u.ac.jp/~amano/poly/index.html

2. Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press, Cambridge (2009)

3. Cover, T.: Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition. IEEE Trans. Electronic Computers EC-14(3), 326–334 (1965)

4. Gotsman, C.: On Boolean Functions, Polynomials and Algebraic Threshold Functions. Tech. Rep. TR-89-18, Department of Computer Science, Hebrew University (1989)

5. Makhorin, A.: The GLPK (GNU Linear Programming Kit) Package, http://www.gnu.org/software/glpk/

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On XOR lemmas for the weight of polynomial threshold functions;Information and Computation;2019-12

2. Algorithms for Obtaining Parsimonious Higher Order Neurons;Artificial Neural Networks and Machine Learning – ICANN 2017;2017

3. On XOR Lemma for Polynomial Threshold Weight and Length;Language and Automata Theory and Applications;2016

4. Minimal Sign Representation of Boolean Functions: Algorithms and Exact Results for Low Dimensions;Neural Computation;2015-08