X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
computer science (13) 13
computer science, theory & methods (10) 10
energy complexity (9) 9
neural networks (8) 8
threshold circuits (8) 8
algorithm analysis and problem complexity (5) 5
boolean functions (5) 5
circuits (5) 5
discrete mathematics in computer science (5) 5
algorithms (4) 4
complexity (4) 4
computation (4) 4
gates (4) 4
mathematical analysis (4) 4
mathematical models (4) 4
size (4) 4
boole-funktion (3) 3
circuit complexity (3) 3
computational complexity (3) 3
lower bounds (3) 3
neurons (3) 3
parity function (3) 3
theoretical computer science (3) 3
theory of computation (3) 3
thresholds (3) 3
berechnungskomplexität (2) 2
c (2) 2
cactus (2) 2
computation by abstract devices (2) 2
computer graphics (2) 2
data structures (2) 2
data structures, cryptology and information theory (2) 2
dynamisches system (2) 2
entropy (2) 2
fan-in (2) 2
fixed parameter tractability (2) 2
gerichteter graph (2) 2
graph algorithm (2) 2
logic circuits (2) 2
logics and meanings of programs (2) 2
mathematical logic and formal languages (2) 2
mathematics of computing (2) 2
mathematics, applied (2) 2
mod function (2) 2
networks (2) 2
neural-networks (2) 2
polynomials (2) 2
symmetric boolean functions (2) 2
threshold circuit (2) 2
tree (2) 2
unate circuits (2) 2
zeitdiskretes system (2) 2
algebra (1) 1
algebra -- data processing (1) 1
algebra data processing (1) 1
algorism (1) 1
algorithm (1) 1
algorithmische geometrie (1) 1
algorithmus (1) 1
algoritmos computacionales (1) 1
approximation (1) 1
approximationsalgorithmus (1) 1
artificial intelligence (1) 1
automatic drafting (1) 1
biology computing (1) 1
boolean function (1) 1
brain - cytology (1) 1
combinatorial analysis (1) 1
communication complexity (1) 1
comparison function (1) 1
competitive diffusion (1) 1
complete bipartite graph (1) 1
complexity theory (1) 1
complexity, computational (1) 1
computation and language (1) 1
computer algorithms (1) 1
computer algorithms congresses (1) 1
computer algorithms-congresses (1) 1
computer communication networks (1) 1
computer science, artificial intelligence (1) 1
computer science, hardware & architecture (1) 1
computer science, information systems (1) 1
computer science, software engineering (1) 1
computer simulation (1) 1
computer software (1) 1
computer systems organization and communication networks (1) 1
congresses (1) 1
construction (1) 1
counting complexity (1) 1
data processing (1) 1
decision trees (1) 1
depth (1) 1
dynamical systems (1) 1
electrical engineering (1) 1
energy (1) 1
energy cornplexity (1) 1
energy measurement (1) 1
engineering & applied sciences (1) 1
engineering, electrical & electronic (1) 1
estructura de datos (1) 1
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Information and Computation, ISSN 0890-5401, 10/2017, Volume 256, pp. 226 - 236
A finite dynamical system is a system consisting of some finite number of objects that take upon a value from some domain as a state, in which after... 
MATHEMATICS, APPLIED | COMPUTER SCIENCE, THEORY & METHODS | REACHABILITY PROBLEMS | Computer science
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 03/2019, Volume 762, pp. 25 - 40
A Boolean Finite Synchronous Dynamical System (BFDS, for short) consists of a finite number of objects that each maintains a boolean state, where after... 
Garden of Eden | Predecessor | Computational complexity | Dynamical systems | NETWORK | COMPUTER SCIENCE, THEORY & METHODS | SINGLETON ATTRACTOR | Computer science
Journal Article
Journal of Graph Algorithms and Applications, ISSN 1526-1719, 2015, Volume 20, Issue 1, pp. 115 - 131
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 03/2011, Volume 412, Issue 8-10, pp. 773 - 782
A unate gate is a logical gate computing a unate Boolean function, which is monotone in each variable. Examples of unate gates are AND gates, OR gates, NOT... 
Threshold circuits | Energy complexity | Unate circuits | Parity function | Sizeenergy tradeoff | Symmetric Boolean functions
Journal Article
Algorithmica, ISSN 0178-4617, 10/2013, Volume 67, Issue 2, pp. 161 - 179
Journal Article
International Journal of Foundations of Computer Science, ISSN 0129-0541, 01/2013, Volume 24, Issue 1, pp. 15 - 29
We prove that the modulus function MODm of n variables can be computed by a threshold circuit C of energy e and size s = O(e(n/m)(1/(e-1))) for any integer e... 
Threshold circuits | Energy complexity | Neural networks | Circuit complexity | energy cornplexity | neural networks | COMPLEXITY | SIZE | NETWORKS | COMPUTER SCIENCE, THEORY & METHODS | COMPUTATION | threshold circuits | Lower bounds | Foundations | Thresholds | Computation | Circuits | Mathematical analysis | Mathematical models | Gates (circuits)
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 09/2013, Volume 505, pp. 74 - 80
In this paper, we consider a logic circuit (i.e., a combinatorial circuit consisting of gates, each of which computes a Boolean function) C computing a... 
Boolean functions | Fan-in | Symmetric functions | Threshold circuits | Energy complexity | MOD functions | Parity function | COMPLEXITY | SIZE | NETWORKS | COMPUTER SCIENCE, THEORY & METHODS
Journal Article
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743, 2015, Volume 8973, pp. 306 - 316
Conference Proceeding
Theoretical Computer Science, ISSN 0304-3975, 2008, Volume 407, Issue 1, pp. 474 - 487
A complexity measure for threshold circuits, called the energy complexity, has been proposed to measure an amount of energy consumed during computation in the... 
Threshold circuits | Energy complexity | Communication complexity | Neural networks | COMPUTER SCIENCE, THEORY & METHODS
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 10/2010, Volume 411, Issue 44-46, pp. 3938 - 3946
In this paper we show that there is a close relationship between the energy complexity and the depth of threshold circuits computing any Boolean function... 
Threshold circuits | Energy complexity | Neural networks | Depth | NEURAL-NETWORKS | COMPLEXITY | SIZE | COMPUTER SCIENCE, THEORY & METHODS | Boolean functions | Thresholds | Circuits | Computation | Mathematical analysis | C (programming language) | Mathematical models | Threshold gates | Complexity
Journal Article
Neural Computation, ISSN 1530-888X, 12/2006, Volume 18, Issue 12, pp. 2994 - 3008
...LETTER Communicated by Pekka Orponen On the Computational Power of Threshold Circuits with Sparse Activity Kei Uchizawa uchizawa@maruoka.ecei.tohoku.ac.jp... 
COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE | Brain - cytology | Computer Simulation | Humans | Neurons - physiology | Entropy | Nerve Net - physiology | Neural Pathways - physiology | Neural Networks (Computer)
Journal Article
Interdisciplinary information sciences, ISSN 1340-9050, 2014, Volume 20, Issue 1, pp. 27 - 50
A threshold circuit is a combinatorial circuit consisting of logic gates computing linear threshold functions. A threshold circuit is one of the most... 
circuit complexity | threshold circuits | logic circuits | neural networks
Journal Article
Interdisciplinary information sciences, ISSN 1340-9050, 01/2014, Volume 20, Issue 1, p. 27
  A threshold circuit is a combinatorial circuit consisting of logic gates computing linear threshold functions. A threshold circuit is one of the most... 
Journal Article
Journal of the Institute of Electronics, Information and Communication Engineers, ISSN 0913-5693, 09/2013, Volume 96, Issue 9, pp. 683 - 687
Journal Article
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, ISSN 0916-8508, 09/2018, Volume E101A, Issue 9, pp. 1431 - 1439
The energy of a threshold circuit C is defined to be the maximum number of gates outputting ones for an input assignment, where the maximum is taken over all... 
Energy complexity | Threshold circuit | Neural network | Circuit complexity | MOD function | circuit complexity | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | LOWER BOUNDS | SIZE | COMPUTER SCIENCE, INFORMATION SYSTEMS | threshold circuit | energy complexity | neural network | ENGINEERING, ELECTRICAL & ELECTRONIC | Energy | Gates (circuits)
Journal Article
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743, 2015, Volume 9076, pp. 87 - 98
Conference Proceeding
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743, 2015, Volume 8939, pp. 412 - 422
Conference Proceeding
Journal of information processing (Tokyo), ISSN 1882-6652, 2017, Volume 25, pp. 695 - 707
Hitori is a popular “pencil-and-paper” puzzle defined as follows. In n-hitori, we are given an n × n rectangular grid in which each square is labeled with a... 
pencil-and-paper puzzle | Hitori | unique solution | Unique solution | Pencil-and-paper puzzle | Integers
Journal Article
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743, 2015, Volume 9214, pp. 422 - 433
Conference Proceeding
Theoretical Computer Science, ISSN 0304-3975, 06/2015, Volume 586, pp. 81 - 94
Consider a puzzle consisting of n tokens on an n-vertex graph, where each token has a distinct starting vertex and a distinct target vertex it wants to reach,... 
Tree | Approximation | Sorting network | Complete bipartite graph | Graph algorithm | COMPUTER SCIENCE, THEORY & METHODS | Electrical engineering | Computer science | Algorithms | Trees | Computation | Placement | Graphs | Transformations | Polynomials | Graph theory
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.