Výsledky vyhľadávania - "Boolean function complexity"

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

Autori: Cheung, Tsun-Ming Hatami, Hamed Hosseini, Kaave a ďalší

Prispievatelia: Cheung, Tsun-Ming Hatami, Hamed Hosseini, Kaave a ďalší

Predmety: Boolean function complexity, randomized communication complexity, ddc:004, parity decision trees

Popis súboru: application/pdf

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

Randomized query composition and product distributions

Autori: Sanyal, Swagato Swagato Sanyal

Prispievatelia: Sanyal, Swagato Swagato Sanyal

Predmety: 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 súboru: application/pdf

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

Certificate Games

Autori: Chakraborty, Sourav Gál, Anna Laplante, Sophie a ďalší

Prispievatelia: Chakraborty, Sourav Gál, Anna Laplante, Sophie a ďalší

Predmety: 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 súboru: application/pdf

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

Sensitivity, block sensitivity, and ℓ-block sensitivity of boolean functions: Sensitivity, block sensitivity, and \(\ell\)-block sensitivity of Boolean functions

Autori: Claire Kenyon Samuel Kutin

Zdroj: Information and Computation. 189:43-53

Predmety: Computational Theory and Mathematics, Boolean function complexity, Analysis of algorithms and problem complexity, block sensitivity, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Boolean functions, sensitivity, 01 natural sciences, Theoretical Computer Science, Information Systems, Computer Science Applications

Popis súboru: application/xml

A lower bound on the mod 6 degree of the OR function: A lower bound on the MOD 6 degree of the OR function

Autori: Tardos, G Barrington, DAM

Zdroj: Proceedings Third Israel Symposium on the Theory of Computing and Systems. :52-56

Predmety: Boolean function complexity, Analysis of algorithms and problem complexity, Complexity classes (hierarchies, relations among complexity classes, etc.), modular counting, 0102 computer and information sciences, 0101 mathematics, 01 natural sciences, circuit complexity

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/1234785
https://doi.org/10.1007/pl00001597
https://ieeexplore.ieee.org/document/377046/
https://dblp.uni-trier.de/db/conf/istcs/istcs1995.html#TardosB95
https://link.springer.com/article/10.1007/PL00001597
https://dblp.uni-trier.de/db/journals/cc/cc7.html#TardosB98
http://scholarworks.umass.edu/cs_faculty_pubs/312/
https://link.springer.com/article/10.1007/PL00001597

Способ восстановления булевой функции нескольких переменных по ее производной

Zdroj: Вестник Донского государственного технического университета.

Predmety: БУЛЕВА ФУНКЦИЯ,ПРОИЗВОДНАЯ БУЛЕВОЙ ФУНКЦИИ ПО НАПРАВЛЕНИЮ,АЛГОРИТМ ПРОВЕРКИ ВОЗМОЖНОСТИ ВОССТАНОВЛЕНИЯ БУЛЕВОЙ ФУНКЦИИ,ОЦЕНКА СЛОЖНОСТИ,ПРОСТРАНСТВО БУЛЕВЫХ ФУНКЦИЙ,КОЛЬЦО МНОГОЧЛЕНОВ,КОНЕЧНЫЕ ПОЛЯ,КОЛЬЦЕВОЙ ИЗОМОРФИЗМ,ТЕОРИЯ КОДИРОВАНИЯ,ПОИСК ПРООБРАЗА,BOOLEAN FUNCTION,DIRECTIONAL DERIVATIVE OF BOOLEAN FUNCTION,ALGORITHM OF CHECKING RECOVERABILITY OF BOOLEAN FUNCTION,COMPLEXITY ESTIMATION,SPACE OF BOOLEAN FUNCTIONS,POLYNOMIAL RING,FINITE FIELDS,RING ISOMORPHISM,CODING THEORY,PREIMAGE SEARCHING

Popis súboru: text/html

Prístupová URL adresa: http://cyberleninka.ru/article/n/sposob-vosstanovleniya-bulevoy-funktsii-neskolkih-peremennyh-po-ee-proizvodnoy
http://cyberleninka.ru/article_covers/17000227.png

О СЛОЖНОСТИ СХЕМ В БАЗИСАХ, СОДЕРЖАЩИХ МОНОТОННЫЕ ЭЛЕМЕНТЫ С НУЛЕВЫМИ ВЕСАМИ

Autori: КОЧЕРГИН ВАДИМ ВАСИЛЬЕВИЧ МИХАЙЛОВИЧ АННА ВИТАЛЬЕВНА

Predmety: БУЛЕВЫ СХЕМЫ,СХЕМЫ ИЗ ФУНКЦИОНАЛЬНЫХ ЭЛЕМЕНТОВ,БАЗИСЫ С НУЛЕВЫМИ ВЕСАМИ,СЛОЖНОСТЬ БУЛЕВЫХ ФУНКЦИЙ,СХЕМНАЯ СЛОЖНОСТЬ,ИНВЕРСИОННАЯ СЛОЖНОСТЬ,ТЕОРЕМА МАРКОВА,BOOLEAN CIRCUITS,LOGIC CIRCUITS,BASES WITH ZERO WEIGHT ELEMENTS,BOOLEAN FUNCTION COMPLEXITY,CIRCUIT COMPLEXITY,INVERSION COMPLEXITY,MARKOV''S THEOREM

Popis súboru: text/html

Dostupnosť: http://cyberleninka.ru/article/n/o-slozhnosti-shem-v-bazisah-soderzhaschih-monotonnye-elementy-s-nulevymi-vesami
http://cyberleninka.ru/article_covers/16364377.png

Lower Bounds on Representing Boolean Functions as Polynomials in $Z_m $: Lower bounds on representing boolean functions as polynomials in \(Z_ m\)

Autori: Shi-Chun Tsai

Zdroj: SIAM Journal on Discrete Mathematics. 9:55-62

Predmety: computational complexity, Analysis of algorithms and problem complexity, Switching theory, application of Boolean algebra, Boolean functions, boolean function complexity, Complexity classes (hierarchies, relations among complexity classes, etc.), 0102 computer and information sciences, Models of computation (Turing machines, etc.), 0101 mathematics, 01 natural sciences, circuit complexity

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/869822
https://doi.org/10.1137/s0895480193255505
https://epubs.siam.org/doi/abs/10.1137/S0895480193255505?cookieSet=1
https://dblp.uni-trier.de/db/journals/siamdm/siamdm9.html#Tsai96
https://dl.acm.org/doi/10.1137/S0895480193255505

On the complexity of Boolean functions computed by lazy oracles: On the complexity of Boolean functions computed by lazy oracles.

Autori: Paul E. Dunne G.F. Nwana Paul H. Leng

Zdroj: IEEE Transactions on Computers. 44:495-502

Predmety: demand-driven simulation, Boolean function complexity, Analysis of algorithms and problem complexity, Switching theory, application of Boolean algebra, Boolean functions, circuit simulation, 0202 electrical engineering, electronic engineering, information engineering, symmetric Boolean functions, lazy evaluation, 02 engineering and technology, Simulation

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/1964058
https://doi.org/10.1109/12.376165
https://ieeexplore.ieee.org/document/376165/
http://ieeexplore.ieee.org/document/376165/
https://dblp.uni-trier.de/db/journals/tc/tc44.html#DunneLN95

Unprovability of lower bounds on circuit size in certain fragments of bounded arithmetic

Autori: Alexander A. Razborov

Zdroj: Izvestiya: Mathematics. 59:205-227

Predmety: First-order arithmetic and fragments, circuit size, Boolean function complexity, Analysis of algorithms and problem complexity, Switching theory, application of Boolean algebra, Boolean functions, SATISFIABILITY, bounded arithmetic, 0102 computer and information sciences, 0101 mathematics, 01 natural sciences, strong pseudorandom generators

Popis súboru: application/xml

Prístupová URL adresa: http://people.cs.uchicago.edu/~razborov/files/ind.pdf
https://zbmath.org/846580
https://doi.org/10.1070/im1995v059n01abeh000009
https://iopscience.iop.org/article/10.1070/IM1995v059n01ABEH000009
https://ui.adsabs.harvard.edu/abs/1995IzMat..59..205R/abstract
http://iopscience.iop.org/article/10.1070/IM1995v059n01ABEH000009/pdf
http://people.cs.uchicago.edu/~razborov/files/ind.pdf

The complexity of the parity function in unbounded fan-in, unbounded depth circuits

Autori: Ingo Wegener

Zdroj: Theoretical Computer Science. 85:155-170

Predmety: unbounded fan-in Boolean circuits, Analysis of algorithms and problem complexity, Switching theory, application of Boolean algebra, Boolean functions, Boolean function complexity theory, 0102 computer and information sciences, complexity measure, 0101 mathematics, 01 natural sciences, complexity of the parity function, Theoretical Computer Science, Computer Science(all)

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/33394
https://doi.org/10.1016/0304-3975(91)90052-4
https://dblp.uni-trier.de/db/journals/tcs/tcs85.html#Wegener91
https://www.sciencedirect.com/science/article/abs/pii/0304397591900524
https://www.sciencedirect.com/science/article/pii/0304397591900524
https://core.ac.uk/display/82172673

О сложности схем в базисах, содержащих монотонные элементы с нулевыми весами

Zdroj: Прикладная дискретная математика.

Predmety: БУЛЕВЫ СХЕМЫ,СХЕМЫ ИЗ ФУНКЦИОНАЛЬНЫХ ЭЛЕМЕНТОВ,БАЗИСЫ С НУЛЕВЫМИ ВЕСАМИ,СЛОЖНОСТЬ БУЛЕВЫХ ФУНКЦИЙ,СХЕМНАЯ СЛОЖНОСТЬ,ИНВЕРСИОННАЯ СЛОЖНОСТЬ,ТЕОРЕМА МАРКОВА,BOOLEAN CIRCUITS,LOGIC CIRCUITS,BASES WITH ZERO WEIGHT ELEMENTS,BOOLEAN FUNCTION COMPLEXITY,CIRCUIT COMPLEXITY,INVERSION COMPLEXITY,MARKOV'S THEOREM

Popis súboru: text/html

Prístupová URL adresa: http://cyberleninka.ru/article_covers/16364377.png
http://cyberleninka.ru/article/n/o-slozhnosti-shem-v-bazisah-soderzhaschih-monotonnye-elementy-s-nulevymi-vesami

Approximating linear restrictions of boolean functions

Autori: Yaoyun Shi The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Yaoyun Shi The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.eecs.umich.edu/~shiyy/mypapers/linear02-j.ps.

Predmety: Boolean function complexity, polynomial approximation, Boolean sensitivity, AND-OR tree, decision tree complexity, computational complexity

Popis súboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.114.2838

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.114.2838
http://www.eecs.umich.edu/~shiyy/mypapers/linear02-j.ps

Lower Bounds on Representing Boolean Functions as Polynomials in Z m

Autori: Shi-chun Tsai The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Shi-chun Tsai The Pennsylvania State University CiteSeerX Archives

Zdroj: ftp://ftp.cs.uchicago.edu/pub/publications/tech-reports/TR-92-28.ps

Predmety: Key words. boolean function complexity, circuit complexity, computational complexity

Popis súboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.1087

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.1087

Lower Bounds on Representing Boolean Functions as Polynomials in Z_m

Autori: Shi-chun Tsai The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Shi-chun Tsai The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.csie.ncnu.edu.tw/~tsai/papers/mod-m.ps.

Predmety: Key words. boolean function complexity, circuit complexity, computational complexity

Popis súboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.2909

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.2909
http://www.csie.ncnu.edu.tw/~tsai/papers/mod-m.ps

Replaceability and computational equivalence for monotone boolean functions

Autori: Meurig Beynon

Zdroj: Acta Informatica. 22:433-449

Predmety: replaceability, abstract simplicial complex, Analysis of algorithms and problem complexity, Switching theory, application of Boolean algebra, Boolean functions, Structure and representation theory of distributive lattices, 0202 electrical engineering, electronic engineering, information engineering, monotone boolean networks, 0102 computer and information sciences, 02 engineering and technology, monotone boolean function complexity, computational equivalence, 01 natural sciences, finite distributive lattices

Popis súboru: application/xml

Prístupová URL adresa: https://dblp.uni-trier.de/db/journals/acta/acta22.html#Beynon85
https://link.springer.com/article/10.1007%2FBF00288777

Boolean Function Complexity: Advances and Frontiers.

Autori: YEKHANIN, SERGEY¹

Zdroj: SIAM Review. 2015, Vol. 57 Issue 3, p479-480. 2p.

Predmety: BOOLEAN functions, NONFICTION

Reviews & Products: BOOLEAN Function Complexity: Advances & Frontiers (Book)

Osoby: JUKNA, Stasys

A depth 3 circuit lower bound for the parity function

Autori: 蔡錫鈞 Tsai, SC 管理學院:資訊管理學系 a ďalší

Prispievatelia: 蔡錫鈞 Tsai, SC 管理學院:資訊管理學系 a ďalší

Predmety: computational complexity, circuit complexity, boolean function complexity, lower bound, parity

Relation: JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 17 (5): 857-860 SEP 2001; http://ir.ncnu.edu.tw:8080/handle/310010000/14808

Dostupnosť: http://ir.ncnu.edu.tw:8080/handle/310010000/14808

A lower bound on the MOD 6 degree of the or function

Autori: Tardos, G Barrington, DAM

Zdroj: Computer Science Department Faculty Publication Series

Predmety: circuit complexity, modular counting, Boolean function complexity

Relation: https://scholarworks.umass.edu/cs_faculty_pubs/312

Dostupnosť: https://scholarworks.umass.edu/cs_faculty_pubs/312

A Depth 3 Circuit Lower Bound for the Parity Function *

Prispievatelia: The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.iis.sinica.edu.tw/page/jise/2001/200109_10.pdf.

Predmety: computational complexity, circuit complexity, boolean function complexity

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.96.4282; http://www.iis.sinica.edu.tw/page/jise/2001/200109_10.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.96.4282
http://www.iis.sinica.edu.tw/page/jise/2001/200109_10.pdf