Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
parity computation
Description:
The computational task of determining whether a set or sequence contains an odd or even number of active elements.
Primary topic:
Complexity and Algorithms in Graphs (23%)
Related topics:
Complexity and Algorithms in Graphs (23%),
Quantum Computing Algorithms and Architecture (12%),
Neural Networks and Applications (10%),
Evolutionary Algorithms and Applications (8%)
OpenAlex ID:
keywords/parity-computation
Adding Learning to the Cellular Development of Neural Networks: Evolution and the Baldwin Effect
1993
·
Frédéric Gruau
, Darrell Whitley
·
Evolutionary Computation
·
227
Simulation of Parallel Random Access Machines by Circuits
1984
·
Larry Stockmeyer
, Uzi Vishkin
·
SIAM Journal on Computing
·
213
Optimal bounds for decision problems on the CRCW PRAM
1989
·
Paul Beame
, Johan Hastad
·
Journal of the ACM
·
154
PDF
Computing with networks of nonlinear mechanical oscillators
2017
·
Jean C. Coulombe
, Mark C. A. York
, et al.
·
PLoS ONE
·
152
PDF
Finding parity in a simple broadcast network
1988
·
R.G. Gallager
·
IEEE Transactions on Information Theory
·
130
Evolving Neural Networks With Collaborative Species
2006
·
Mitchell A. Potter
, Kenneth De Jong
·
94
Optimal bounds for decision problems on the CRCW PRAM
1987
·
P. Beame
, J. Hastad
·
ACM Symposium on Theory of Computing (STOC)
·
83
A non-linear time lower bound for Boolean branching programs
2003
·
M. Ajtai
·
Annual Symposium on Foundations of Computer Science
·
81
The perceptron strikes back
2002
·
R. Beigel
, N. Reingold
, et al.
·
Structure in Complexity Theory Annual Conference
·
78
Microfabricated Neuroaccelerometer: Integrating Sensing and Reservoir Computing in MEMS
2020
·
Bruno Barazani
, Guillaume Dion
, et al.
·
Journal of Microelectromechanical Systems
·
74
PDF
Toward a general-purpose analog VLSI neural network with on-chip learning
1997
·
A.J. Montalvo
, R.S. Gyurcsik
, et al.
·
IEEE Transactions on Neural Networks
·
74
Quantum lower bounds for fanout
2006
·
M. Fang
, S. Fenner
, et al.
·
Quantum Information and Computation
·
72
PDF
Super-linear gate and super-quadratic wire lower bounds for depth-two and depth-three threshold circuits
2016
·
Daniel M. Kane
, Ryan Williams
·
ACM Symposium on Theory of Computing (STOC)
·
69
PDF
Development Brings Scalability to Hardware Evolution
2006
·
T.G.W. Gordon
, P.J. Bentley
·
NASA/DoD Conference on Evolvable Hardware
·
61
Top-down lower bounds for depth-three circuits
1995
·
J. H�stad
, S. Jukna
, et al.
·
Computational Complexity
·
60
Evolving Recursive Functions for the Even-Parity Problem Using Genetic Programming
1996
·
The MIT Press eBooks
·
58
On Exact Quantum Query Complexity
2013
·
Ashley Montanaro
, Richard Jozsa
, et al.
·
Algorithmica
·
52
PDF
Solving the N-bit parity problem using neural networks
1999
·
Myron E Hohil
, Derong Liu
, et al.
·
Neural Networks
·
48
An analog VLSI neural network with on-chip perturbation learning
1997
·
A.J. Montalvo
, R.S. Gyurcsik
, et al.
·
IEEE Journal of Solid-State Circuits
·
41
A Mixed-Mode Analog Neural Network Using Current-Steering Synapses
2004
·
Johannes Schemmel
, Steffen Hohmann
, et al.
·
Analog Integrated Circuits and Signal Processing
·
36
A Solution for the N-bit Parity Problem Using a Single Translated Multiplicative Neuron
2003
·
Eduardo Masato Iyoda
, Hajime Nobuhara
, et al.
·
Neural Processing Letters
·
35
DEFT-Cache: A Cost-Effective and Highly Reliable SSD Cache for RAID Storage
2017
·
Jiguang Wan
, Wei Wu
, et al.
·
IEEE International Parallel and Distributed Processing Symposium (IPDPS)
·
32
A tight lower bound for parity in noisy communication networks
2008
·
Chinmoy Dutta
, Yashodhan Kanoria
, et al.
·
Symposium on Discrete Algorithms
·
31
On the solution of the parity problem by a single hidden layer feedforward neural network
1997
·
Rudy Setiono
·
Neurocomputing
·
31
Experimental demonstration of a quantum circuit using linear optics gates
2005
·
T. B. Pittman
, B. C. Jacobs
, et al.
·
Physical Review A
·
30
PDF
Show more works
View as search
Works count:
190
Citation count:
2,887
Year
Topic
Type