Results 41 to 50 of about 279,119 (104)
Quantum Interactive Proofs with Competing Provers
, 2004 This paper studies quantum refereed games, which are quantum interactive proof systems with two competing provers: one that tries to convince the verifier to accept and the other that tries to convince the verifier to reject. We prove that every language
A. Kitaev +14 more
core +2 more sources
Computational complexity reduction techniques for quadrature Kalman filters
IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2015 Nonlinear filtering is a major problem in statistical signal processing applications and numerous techniques have been proposed in the literature. Since the seminal work that led to the Kalman filter to the more advanced particle filters, the goal has ...
P. Closas +2 more
semanticscholar +1 more source
Solving the subset-sum problem with a light-based device
, 2007 We propose a special computational device which uses light rays for solving the subset-sum problem. The device has a graph-like representation and the light is traversing it by following the routes given by the connections between nodes.
A Vergis +20 more
core +2 more sources
Scaling and Universality of the Complexity of Analog Computation
, 2005 We apply a probabilistic approach to study the computational complexity of analog computers which solve linear programming problems. We analyze numerically various ensembles of linear programming problems and obtain, for each of these ensembles, the ...
Blum L. +7 more
core +2 more sources
Unbounded-Error Classical and Quantum Communication Complexity
, 2007 Since the seminal work of Paturi and Simon \cite[FOCS'84 & JCSS'86]{PS86}, the unbounded-error classical communication complexity of a Boolean function has been studied based on the arrangement of points and hyperplanes. Recently, \cite[ICALP'07]{INRY07}
A. Ambainis +11 more
core +3 more sources
NP-complete Problems and Physical Reality
, 2005 Can NP-complete problems be solved efficiently in the physical universe? I survey proposals including soap bubbles, protein folding, quantum computing, quantum advice, quantum adiabatic algorithms, quantum-mechanical nonlinearities, hidden variables ...
Aaronson, Scott
core +3 more sources
Quantifying Shannon's Work Function for Cryptanalytic Attacks
, 2010 Attacks on cryptographic systems are limited by the available computational resources. A theoretical understanding of these resource limitations is needed to evaluate the security of cryptographic primitives and procedures.
van Son, R. J. J. H.
core +1 more source
An Algorithmic Approach to Information and Meaning [PDF]
, 2011 I will survey some matters of relevance to a philosophical discussion of information, taking into account developments in algorithmic information theory (AIT).
Zenil, Hector
core +4 more sources
Frontal cellular automata for modelling microstructure evolution: Computational complexity analysis
Computational materials science, 2023 D. Svyetlichnyy
semanticscholar +1 more source
Trading inference effort versus size in CNF Knowledge Compilation [PDF]
, 2013 Knowledge Compilation (KC) studies compilation of boolean functions f into some formalism F, which allows to answer all queries of a certain kind in polynomial time.
Gwynne, Matthew, Kullmann, Oliver
core