Výsledky vyhledávání - "Boolean function complexity"

Boolean Function Complexity : Advances and Frontiers

Autoři: Stasys Jukna

Resource Type: eBook.

Témata: Computational complexity, Computer science--Mathematics, Combinatorial analysis

Categories: MATHEMATICS / Applied, COMPUTERS / Computer Science, MATHEMATICS / Discrete Mathematics

Composition Limits and Separating Examples for Some Boolean Function Complexity Measures

Autoři: GILMER, J SAKS, M SRINIVASAN, S

Zdroj: 2013 IEEE Conference on Computational Complexity. :185-196

Témata: FOS: Computer and information sciences, Computer Science - Computational Complexity, Prams, 0102 computer and information sciences, Computational Complexity (cs.CC), 0101 mathematics, 16. Peace & justice, 01 natural sciences

Přístupová URL adresa: http://arxiv.org/pdf/1306.0630
http://arxiv.org/abs/1306.0630
https://link.springer.com/article/10.1007/s00493-014-3189-x
http://ui.adsabs.harvard.edu/abs/2013arXiv1306.0630G/abstract
https://www.computer.org/csdl/proceedings-article/ccc/2013/4997a185/12OmNwtn3z4
https://dblp.uni-trier.de/db/journals/corr/corr1306.html#GilmerSS13
https://arxiv.org/abs/1306.0630
http://ieeexplore.ieee.org/document/6597761/
https://rd.springer.com/article/10.1007/s00493-014-3189-x
https://dl.acm.org/doi/10.1007/s00493-014-3189-x
https://dblp.uni-trier.de/db/journals/combinatorica/combinatorica36.html#GilmerSS16

Applicability of feed-forward and recurrent neural networks to Boolean function complexity modeling

Autoři: Ajmal Beg Azam Beg P. W. Chandana Prasad

Zdroj: Expert Systems with Applications. 34:2436-2443

Témata: T Technology (General), 0202 electrical engineering, electronic engineering, information engineering, QA75.5-76.95 Electronic computers. Computer science, 02 engineering and technology

Popis souboru: text

Přístupová URL adresa: http://core.ac.uk/display/18231681
https://dblp.uni-trier.de/db/journals/eswa/eswa34.html#BegPB08
https://www.sciencedirect.com/science/article/pii/S0957417407001364
http://www.sciencedirect.com/science/article/pii/S0957417407001364

Harmonic analysis and Boolean function complexity

Autoři: BERNASCONI, ANNA

Zdroj: Calcolo. 35:149-186

Témata: Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type, Analysis of algorithms and problem complexity, Fourier transform, 0211 other engineering and technologies, Numerical methods for trigonometric approximation and interpolation, 0102 computer and information sciences, 02 engineering and technology, Boolean functions, 01 natural sciences, Boolean circuit complexity

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1234310
https://doi.org/10.1007/s100920050014
https://link.springer.com/article/10.1007/s100920050014
https://core.ac.uk/display/54877073
https://hdl.handle.net/11568/49129

Review of boolean function complexity: advances and frontiers by Stasys Jukna

Autoři: William Gasarch

Zdroj: ACM SIGACT News. 44:39-41

Témata: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Přístupová URL adresa: https://dblp.uni-trier.de/db/journals/sigact/sigact44.html#Gasarch13b

Boolean function complexity [Dokument elektroniczny] : advances and frontiers / Stasys Jukna.

Autoři: Jukna, Stasys (1953- ). Springer Science+Business Media. pbl

Přispěvatelé: Jukna, Stasys (1953- ). Springer Science+Business Media. pbl

Zdroj: Bibliogr. s. 591-610. Indeks.

Přístupová URL adresa: http://katalog.nukat.edu.pl/lib/item?id=chamo:2897821&theme=nukat

Boolean function complexity : advances and frontiers / Stasys Jukna.

Autoři: Jukna, Stasys (1953- ).

Zdroj: Bibliogr. s. 591-610. Indeks.

Témata: Złożoność obliczeniowa (informatyka), Funkcje Boole'a

Přístupová URL adresa: http://katalog.nukat.edu.pl/lib/item?id=chamo:2532222&theme=nukat

A Lower Bound on the Trace Norm of Boolean Matrices and Its Applications

Autoři: Cheung, Tsun-Ming Hatami, Hamed Hosseini, Kaave a další

Přispěvatelé: Cheung, Tsun-Ming Hatami, Hamed Hosseini, Kaave a další

Témata: Boolean function complexity, randomized communication complexity, ddc:004, parity decision trees

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2025.37

Boolean Function Complexity

Autoři: Mike Paterson

Přístupová URL adresa: https://ci.nii.ac.jp/ncid/BA18747724

Boolean Function Complexity: a Lattice-Theoretic Perspective

Autoři: W. Meurig Beynon

Zdroj: Boolean Function Complexity ISBN: 9780521408264

Přístupová URL adresa: http://ebooks.cambridge.org/chapter.jsf?bid=CBO9780511526633&cid=CBO9780511526633A009
http://dl.acm.org/citation.cfm?id=167704

Boolean function complexity / ed. M. S. Paterson.

Přispěvatelé: Paterson, Michael S.

Přístupová URL adresa: http://katalog.nukat.edu.pl/lib/item?id=chamo:2323276&theme=nukat

Composition limits and separating examples for some Boolean function complexity measures

Autoři: Gilmer, Justin Saks, Michael Srinivasan, Srikanth

Témata: Computer Science - Computational Complexity, text

URL: http://arxiv.org/abs/1306.0630

Measures of Boolean function complexity based on Harmonic Analysis

Autoři: BERNASCONI, ANNA B. CODENOTTI

Zdroj: Lecture Notes in Computer Science ISBN: 9783540578116

Témata: 4. Education, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Přístupová URL adresa: https://link.springer.com/chapter/10.1007/3-540-57811-0_7
https://dblp.uni-trier.de/db/conf/ciac/ciac1994.html#BernasconiC94
https://link.springer.com/content/pdf/10.1007/3-540-57811-0_7.pdf
https://core.ac.uk/display/54872202
https://rd.springer.com/chapter/10.1007/3-540-57811-0_7
https://hdl.handle.net/11568/28306

Assorted results in boolean function complexity, uniform sampling and clique partitions of graphs

Autoři: Wellens, Jake(Jake Lee)

Thesis Advisors: Henry Cohn., Massachusetts Institute of Technology. Department of Mathematics., Massachusetts Institute of Technology. Department of Mathematics

Témata: Mathematics.

Popis souboru: 112 pages; application/pdf

Dostupnost: https://hdl.handle.net/1721.1/126937

Boolean Function Complexity: Advances and Frontiers Stasys Jukna

Autoři: Yekhanin, Sergey

Zdroj: SIAM Review, 2015 Sep 01. 57(3), 479-480.

Relation: Boolean Function Complexity: Advances and Frontiers Stasys Jukna

Přístupová URL adresa: http://www.jstor.org/stable/24778749

Randomized query composition and product distributions

Autoři: Sanyal, Swagato Swagato Sanyal

Přispěvatelé: Sanyal, Swagato Swagato Sanyal

Témata: Computer Science - Computational Complexity, Boolean function complexity, Decision Tree, Computer Science - Data Structures and Algorithms, Randomized query complexity, Analysis of Boolean functions, ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2401.15352
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.56

Composition limits and separating examples for some boolean function complexity measures

Autoři: Gilmer, Justin Saks, Michael Srinivasan, Srikanth

Zdroj: Combinatorica ; volume 36, issue 3, page 265-311 ; ISSN 0209-9683 1439-6912

Dostupnost: https://doi.org/10.1007/s00493-014-3189-x
http://link.springer.com/content/pdf/10.1007/s00493-014-3189-x.pdf
http://link.springer.com/article/10.1007/s00493-014-3189-x/fulltext.html
http://link.springer.com/content/pdf/10.1007/s00493-014-3189-x

Spectral method of Boolean function complexity

Autoři: S.L. Hurst Jon C. Muzio D.M. Miller

Zdroj: Electronics Letters. 18:572-574

Témata: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Přístupová URL adresa: http://ui.adsabs.harvard.edu/abs/1982ElL....18..572H/abstract
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000004246524
https://www.infona.pl/resource/bwmeta1.element.ieee-art-000004246524

Discrete local central limit theorems and boolean function complexity measures

Autoři: Justin Gilmer

Přístupová URL adresa: https://rucore.libraries.rutgers.edu/rutgers-lib/46347/PDF/1/
https://rucore.libraries.rutgers.edu/rutgers-lib/46347/

Certificate Games

Autoři: Chakraborty, Sourav Gál, Anna Laplante, Sophie a další

Přispěvatelé: Chakraborty, Sourav Gál, Anna Laplante, Sophie a další

Témata: certificate complexity, zero-communication two-player games, boolean function complexity, block sensitivity, Theory of computation → Quantum query complexity, query complexity, [INFO] Computer Science [cs], ddc:004, sensitivity, Theory of computation → Computational complexity and cryptography, Theory of computation → Circuit complexity

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.32