The relative complexity of approximate counting problems
Two natural classes of counting problems that are interreducible under approximation-
preserving reductions are:(i) those that admit a particular kind of efficient approximation …
preserving reductions are:(i) those that admit a particular kind of efficient approximation …
Evolving recurrent neural networks are super-Turing
J Cabessa, HT Siegelmann - The 2011 International joint …, 2011 - ieeexplore.ieee.org
The computational power of recurrent neural networks is intimately related to the nature of
their synaptic weights. In particular, neural networks with static rational weights are known to …
their synaptic weights. In particular, neural networks with static rational weights are known to …
On the relative complexity of approximate counting problems
Two natural classes of counting problems that are interreducible under approximation-
preserving reductions are:(i) those that admit a particular kind of efficient approximation …
preserving reductions are:(i) those that admit a particular kind of efficient approximation …
Cryptography Using Steganography: New Algorithms and Applications
J Blackledge - 2011 - arrow.tudublin.ie
Developing methods for ensuring the secure exchange of information is one of the oldest
occupations in history. With the revolution in Information Technology, the need for securing …
occupations in history. With the revolution in Information Technology, the need for securing …
Ensuring sustainable and resilient air traffic management systems for South Africa with complexity and whole-of-society theory approaches
Abstract WEILAND, LV; LAW, C. and SUNJKA, BP. Ensuring sustainable and resilient air
traffic management systems for South Africa with complexity and whole-of-society theory …
traffic management systems for South Africa with complexity and whole-of-society theory …
Computation in permutation groups: counting and randomly sampling orbits
LA Goldberg - LONDON MATHEMATICAL SOCIETY LECTURE …, 2001 - books.google.com
Let be a finite set and let G be a permutation group acting on N. The permutation group G
partitions into orbits. This survey focuses on three related computational problems, each of …
partitions into orbits. This survey focuses on three related computational problems, each of …
Optimal LSP capacity and flow assignment using traffic engineering in MPLS networks
W Lu, M Mandal - IEEE Global Telecommunications …, 2004 - ieeexplore.ieee.org
Quality of service (QoS) and traffic engineering (TE) capabilities are two important criteria in
today's networks for supporting real-time applications. Multiprotocol label switching (MPLS) …
today's networks for supporting real-time applications. Multiprotocol label switching (MPLS) …
Deterministic chaos in digital cryptography
NV Ptitsyn, JM Blackledge, VM Chernenkiy - Fractal Geometry, 2002 - Elsevier
This paper studies the relationship between deterministic chaos and cryptographic systems.
The theoretical background upon which this relationship is based, includes discussions on …
The theoretical background upon which this relationship is based, includes discussions on …
An exactly solvable random satisfiability problem
S Caracciolo, A Sportiello - Journal of Physics A: Mathematical …, 2002 - iopscience.iop.org
We introduce a new model for the generation of random satisfiability problems. It is an
extension of the hyper-SAT model of Ricci-Tersenghi, Weigt and Zecchina, which is a variant …
extension of the hyper-SAT model of Ricci-Tersenghi, Weigt and Zecchina, which is a variant …
New combinatorial complete one-way functions
A Kojevnikov, SI Nikolenko - arXiv preprint arXiv:0802.2863, 2008 - arxiv.org
In 2003, Leonid A. Levin presented the idea of a combinatorial complete one-way function
and a sketch of the proof that Tiling represents such a function. In this paper, we present two …
and a sketch of the proof that Tiling represents such a function. In this paper, we present two …