-
1Academic Journal
Source: Journal of the ACM. 71:1-48
Subject Terms: FOS: Computer and information sciences, TFNP, Networks and circuits as models of computation, circuit complexity, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, Approximation algorithms, Nash equilibrium, Computer Science - Computational Complexity, generalized circuit, Computer Science - Computer Science and Game Theory, 0202 electrical engineering, electronic engineering, information engineering, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), PPAD, Algorithmic game theory and complexity, approximation, Computer Science and Game Theory (cs.GT)
File Description: application/xml; text
-
2Academic Journal
Authors: Hiromasa, Ryo, Mizutani, Akihiro, Takeuchi, Yuki, Tani, Seiichiro
Contributors: Ryo Hiromasa and Akihiro Mizutani and Yuki Takeuchi and Seiichiro Tani
Source: Theory of Computing Systems. 69
Subject Terms: FOS: Computer and information sciences, Lattice problems, Quantum Physics, Networks and circuits as models of computation, circuit complexity, lattice problems, FOS: Physical sciences, Quantum algorithms and complexity in the theory of computing, Quantum computing, Computational Complexity (cs.CC), 01 natural sciences, quantum computing, Postselection, Computer Science - Computational Complexity, Quantum computation, 0103 physical sciences, postselection, ddc:004, Quantum Physics (quant-ph)
File Description: application/xml; application/pdf
Linked Full TextAccess URL: http://arxiv.org/abs/2206.05434
https://zbmath.org/7990401
https://doi.org/10.1007/s00224-024-10208-5
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2023.9 -
3Academic Journal
Authors: Lozhkin, S. A.
Source: Mathematical Notes. 115:748-754
Subject Terms: multiplexer, depth, Networks and circuits as models of computation, circuit complexity, Boolean functions, formula, individual complexity
Linked Full TextFile Description: application/xml
-
4Academic Journal
Authors: Lozhkin, Sergei A., Zizov, Vadim S.
Source: Discrete Mathematics and Applications. 34:103-115
Subject Terms: multiplexer, Switching theory, applications of Boolean algebras to circuits and networks, Networks and circuits as models of computation, circuit complexity, lookup function, 0101 mathematics, Boolean circuit, cellular circuit, 01 natural sciences, planar circuit, very large scale integration
File Description: application/xml
-
5Academic Journal
Authors: Shalev Ben-David, Eric Blais
Source: Journal of the ACM. 70:1-58
Subject Terms: FOS: Computer and information sciences, minimax, Quantum Physics, Networks and circuits as models of computation, circuit complexity, quantum computation, Randomized algorithms, FOS: Physical sciences, Communication complexity, information complexity, polynomial degree complexity, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, Computer Science - Computational Complexity, Quantum computation, randomized computation, 0202 electrical engineering, electronic engineering, information engineering, query complexity, communication complexity, Quantum Physics (quant-ph)
File Description: application/xml
Access URL: http://arxiv.org/abs/2002.10802
-
6Academic Journal
Authors: C.S. Bhargav, Prateek Dwivedi, Nitin Saxena
Source: Theoretical Computer Science. 1041:115214
Subject Terms: lower bounds, algebraic circuits, polynomials, Networks and circuits as models of computation, circuit complexity, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), algebraic branching programs
Linked Full TextFile Description: application/xml
-
7Academic Journal
Authors: Adriano Barile, Stefano Berardi, Luca Roversi
Source: Theoretical Computer Science. 1028:115031
Subject Terms: Reversible Boolean Circuits, Reversible Computing, n-Categories, Polygraphs, Rewriting, Computer Science - Logic in Computer Science, Strict omega-categories, computads, polygraphs, Networks and circuits as models of computation, circuit complexity, n-categories, Grammars and rewriting systems, Tricategories, weak \(n\)-categories, coherence, semi-strictification, reversible Boolean circuits, Mathematics - Category Theory, polygraphs, reversible computing, rewriting
File Description: application/xml; application/pdf
Linked Full TextAccess URL: http://arxiv.org/abs/2401.02091
https://www.sciencedirect.com/science/article/pii/S0304397524006480
https://doi.org/10.1016/j.tcs.2024.115031
https://hdl.handle.net/2318/2038010
https://www.sciencedirect.com/science/article/pii/S0304397524006480
https://hdl.handle.net/2318/1947732 -
8Academic Journal
Source: Journal of the ACM. 70:1-46
Subject Terms: FOS: Computer and information sciences, Data structures, algebraic circuits, multipoint evaluation, Networks and circuits as models of computation, circuit complexity, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, matrix rigidity, data structures, Computer Science - Computational Complexity, modular composition, polynomial evaluation, Vandermonde matrix, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)
File Description: application/xml
-
9Academic Journal
Authors: Lozhkin, S. A.
Source: Moscow University Mathematics Bulletin. 77:144-153
Subject Terms: Switching theory, applications of Boolean algebras to circuits and networks, Networks and circuits as models of computation, circuit complexity, high-accuracy asymptotic bounds, Boolean function, 0102 computer and information sciences, Boolean functions, 0101 mathematics, circuits of functional elements, complexity, 01 natural sciences
File Description: application/xml
-
10Academic Journal
Authors: Coecke, B, Horsman, D, Kissinger, A, Wang, Q
Source: Theoretical Computer Science. 897:1-22
Subject Terms: FOS: Computer and information sciences, Quantum Physics, Computer Science - Computation and Language, Networks and circuits as models of computation, circuit complexity, quantum picturalism, FOS: Physical sciences, 0102 computer and information sciences, mathematics education, 01 natural sciences, quantum computing, rewriting, Graph theory (including graph drawing) in computer science, Quantum computation, 0103 physical sciences, quantum hardware (NISQ), Quantum Physics (quant-ph), Computation and Language (cs.CL)
File Description: application/xml
Linked Full TextAccess URL: http://arxiv.org/abs/2102.10984
https://zbmath.org/7437210
https://doi.org/10.1016/j.tcs.2021.07.024
https://www.arxiv-vanity.com/papers/2102.10984/
https://dblp.uni-trier.de/db/journals/corr/corr2102.html#abs-2102-10984
https://www.sciencedirect.com/science/article/pii/S0304397521004308 -
11Academic Journal
Authors: S. A. Lozhkin, E. L. Dovgalyuk
Source: Moscow University Computational Mathematics and Cybernetics. 43:177-180
Subject Terms: 0209 industrial biotechnology, Switching theory, applications of Boolean algebras to circuits and networks, geometric implementation, Networks and circuits as models of computation, circuit complexity, unit cube, isomorphic embedding, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, complexity
File Description: application/xml
-
12Academic Journal
Authors: Igor S. Sergeev
Source: Discrete Mathematics and Applications. 29:241-254
Subject Terms: Switching theory, applications of Boolean algebras to circuits and networks, Boolean cube partitions, Networks and circuits as models of computation, circuit complexity, bounded-depth circuits, 0102 computer and information sciences, Boolean functions, 0101 mathematics, complexity, 01 natural sciences
File Description: application/xml
-
13Academic Journal
Authors: Oliveira, Igor C., Santhanam, Rahul, Tell, RoeiAff3, IDs0003702200220x_cor3
Source: computational complexity. 31(1)
-
14Academic Journal
Authors: Pranjal Dutta, Nitin Saxena, Amit Sinhababu
Source: Journal of the ACM. 69:1-39
Subject Terms: FOS: Computer and information sciences, Computational methods for problems pertaining to field theory, Computer Science - Computational Complexity, F.1.1, I.1.2, F.1.3, G.1.5, Networks and circuits as models of computation, circuit complexity, Analysis of algorithms and problem complexity, Polynomials in real and complex fields: location of zeros (algebraic theorems), Computational Complexity (cs.CC), Symbolic computation and algebraic computation
File Description: application/xml
-
15Academic Journal
Contributors: University of Zurich, Massachusetts Institute of Technology. Department of Brain and Cognitive Sciences, Massachusetts Institute of Technology. Department of Mechanical Engineering, Slotine, Jean-Jacques E
Source: Neural Computation. 30:1359-1393
Subject Terms: 2805 Cognitive Neuroscience, Neurons, 0301 basic medicine, 0303 health sciences, Networks and circuits as models of computation, circuit complexity, 4. Education, Models, Neurological, Neocortex, 03 medical and health sciences, Nonlinear Dynamics, 1201 Arts and Humanities (miscellaneous), Quantitative Biology - Neurons and Cognition, FOS: Biological sciences, 570 Life sciences, biology, Animals, Humans, Computer Simulation, Neurons and Cognition (q-bio.NC), Neural Networks, Computer, Nerve Net, Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.), Problem Solving, 10194 Institute of Neuroinformatics
File Description: application/xml; ZORA_168617.pdf - application/pdf; application/pdf
Access URL: https://dspace.mit.edu/bitstream/1721.1/120124/1/neco_a_01074.pdf
https://pubmed.ncbi.nlm.nih.gov/29566357
http://arxiv.org/abs/1801.04515
https://zbmath.org/7409213
https://doi.org/10.1162/neco_a_01074
https://www.ncbi.nlm.nih.gov/pubmed/29566357
http://doi.org/10.1162/neco_a_01074
https://ieeexplore.ieee.org/document/8353111/authors
http://europepmc.org/articles/PMC5930080
http://cognet.mit.edu/journal/10.1162/neco_a_01074
https://direct.mit.edu/neco/article/30/5/1359/8351/Solving-Constraint-Satisfaction-Problems-with -
16Academic Journal
Authors: Servedio, Rocco A., Tan, Li-Yang
Contributors: Rocco A. Servedio and Li-Yang Tan
Subject Terms: FOS: Computer and information sciences, switching lemmas, Networks and circuits as models of computation, circuit complexity, Randomized algorithms, 0102 computer and information sciences, unconditional derandomization, Computational Complexity (cs.CC), 01 natural sciences, Computer Science - Computational Complexity, pseudorandom generators, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), ddc:004, 0101 mathematics
File Description: application/xml; application/pdf
-
17Academic Journal
Authors: Xaver Gubás, Juraj Hromkovic, Juraj Waczulík
Source: Lecture Notes in Computer Science ISBN: 9783540552109
Subject Terms: Switching theory, applications of Boolean algebras to circuits and networks, Networks and circuits as models of computation, circuit complexity, 0202 electrical engineering, electronic engineering, information engineering, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Theoretical Computer Science, Computer Science(all)
File Description: application/xml
Linked Full TextAccess URL: https://zbmath.org/985361
https://doi.org/10.1016/0304-3975(94)00269-o
https://www.sciencedirect.com/science/article/pii/030439759400269O
https://link.springer.com/chapter/10.1007/3-540-55210-3_191
https://doi.org/10.1016/0304-3975(94)00269-O
https://rd.springer.com/chapter/10.1007/3-540-55210-3_191
https://dblp.uni-trier.de/db/journals/tcs/tcs143.html#GubasHW95
https://link.springer.com/content/pdf/10.1007%2F3-540-55210-3_191.pdf
https://link.springer.com/chapter/10.1007/3-540-55210-3_191
https://dblp.uni-trier.de/db/conf/stacs/stacs92.html#GubasHW92
https://link.springer.com/content/pdf/10.1007%2F3-540-55210-3_191.pdf -
18Academic Journal
Authors: Mikael Goldmann, Marek Karpinski
Source: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93. :551-560
Subject Terms: majority circuits, Switching theory, applications of Boolean algebras to circuits and networks, Networks and circuits as models of computation, circuit complexity, Analysis of algorithms and problem complexity, threshold circuits, 0202 electrical engineering, electronic engineering, information engineering, Distributed algorithms, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences
File Description: application/xml
Access URL: http://core.ac.uk/display/24298521
https://dl.acm.org/doi/10.1145/167088.167234
https://dblp.uni-trier.de/db/conf/stoc/stoc1993.html#GoldmannK93
https://epubs.siam.org/doi/pdf/10.1137/S0097539794274519 -
19Academic Journal
Authors: Jiawei Hong
Source: Communications on Pure and Applied Mathematics. 41:1039-1050
Subject Terms: connectionist models, 03 medical and health sciences, Switching theory, applications of Boolean algebras to circuits and networks, Boolean gates, 0302 clinical medicine, Networks and circuits as models of computation, circuit complexity, 0202 electrical engineering, electronic engineering, information engineering, neurons, parallel hardware models, 02 engineering and technology
File Description: application/xml
-
20Academic Journal
Authors: Edward G. Belaga
Source: Acta Informatica. 26:381-407
Subject Terms: syntax and semantics of Boolean circuits, Switching theory, applications of Boolean algebras to circuits and networks, Networks and circuits as models of computation, circuit complexity, Analysis of algorithms and problem complexity, 4. Education, mincing complexity, locally synchronous CS-complexity, m-dimensional cyclic convolution, straight-line Boolean computations, relative circuit-size complexity of a Boolean function, 7. Clean energy
File Description: application/xml
Linked Full TextAccess URL: https://zbmath.org/4055537
https://link.springer.com/article/10.1007/BF00276024
https://dblp.uni-trier.de/db/journals/acta/acta26.html#Belaga89