Search Results - "boolean function complexity"
-
1
Authors: et al.
Contributors: et al.
Subject Terms: Boolean function complexity, randomized communication complexity, ddc:004, parity decision trees
File Description: application/pdf
-
2
Authors:
Contributors:
Subject Terms: Computer Science - Computational Complexity, Boolean function complexity, Decision Tree, Computer Science - Data Structures and Algorithms, Randomized query complexity, Analysis of Boolean functions, ddc:004
File Description: application/pdf
-
3
Authors: et al.
Contributors: et al.
Subject Terms: 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
File Description: application/pdf
-
4
Authors:
Source: Information and Computation. 189:43-53
Subject Terms: 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
File Description: application/xml
-
5
Authors:
Source: Proceedings Third Israel Symposium on the Theory of Computing and Systems. :52-56
Subject Terms: 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
File Description: application/xml
Access URL: 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 -
6
Source: Вестник Донского государственного технического университета.
File Description: text/html
-
7
Authors:
File Description: text/html
-
8
Authors: Shi-Chun Tsai
Source: SIAM Journal on Discrete Mathematics. 9:55-62
Subject Terms: 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
File Description: application/xml
-
9
Authors:
Source: IEEE Transactions on Computers. 44:495-502
Subject Terms: 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
File Description: application/xml
-
10
Authors: Alexander A. Razborov
Source: Izvestiya: Mathematics. 59:205-227
Subject Terms: 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
File Description: application/xml
Access URL: 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 -
11
Authors: Ingo Wegener
Source: Theoretical Computer Science. 85:155-170
Subject Terms: 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)
File Description: application/xml
Access URL: 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 -
12
Source: Прикладная дискретная математика.
File Description: text/html
-
13
Authors:
Contributors:
Subject Terms: Boolean function complexity, polynomial approximation, Boolean sensitivity, AND-OR tree, decision tree complexity, computational complexity
File Description: application/postscript
-
14
Authors:
Contributors:
Source: ftp://ftp.cs.uchicago.edu/pub/publications/tech-reports/TR-92-28.ps
File Description: application/postscript
-
15
Authors:
Contributors:
File Description: application/postscript
-
16
Authors: Meurig Beynon
Source: Acta Informatica. 22:433-449
Subject Terms: 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
File Description: application/xml
-
17
Authors: YEKHANIN, SERGEY1
Source: SIAM Review. 2015, Vol. 57 Issue 3, p479-480. 2p.
Subject Terms: BOOLEAN functions, NONFICTION
Reviews & Products: BOOLEAN Function Complexity: Advances & Frontiers (Book)
People: JUKNA, Stasys
-
18
Authors: et al.
Contributors: et al.
Subject Terms: 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
Availability: http://ir.ncnu.edu.tw:8080/handle/310010000/14808
-
19
Authors:
Source: Computer Science Department Faculty Publication Series
Subject Terms: circuit complexity, modular counting, Boolean function complexity
Availability: https://scholarworks.umass.edu/cs_faculty_pubs/312
-
20
Contributors: The Pennsylvania State University CiteSeerX Archives
Subject Terms: computational complexity, circuit complexity, boolean function complexity
File Description: 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
Nájsť tento článok vo Web of Science 
Full Text Finder 
