The early classifications of the computational complexity of planning under various restrictions in STRIPS (Bylander) and SAS+ (B¨ackstr¨om and Nebel) have influenced followin...
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
Anja Becker, Antoine Joux, Alexander May, Alexande...
Enterprise search is challenging for several reasons, notably the dynamic terminology and jargon that are specific to the enterprise domain. This challenge is partly addressed by...
Secure multiparty computation (MPC) allows a set of n players to compute any public function, given as an arithmetic circuit, on private inputs, so that privacy of the inputs as we...
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computation...
Title of dissertation: MODEL THEORY AND COMPLEXITY THEORY Walid Gomaa Doctor of Philosophy, 2007 Dissertation directed by: Professor William Gasarch Department of Computer Science...
Complexity theory typically studies the complexity of computing a function h(x) : {0, 1}m {0, 1}n of a given input x. A few works have suggested to study the complexity of genera...
In this primarily expository article, I describe geometric approaches to variants of P v. NP, present several results that illustrate the role of group actions in complexity theory...
This paper puts forward a new notion of a proof based on computational complexity and explores its implications for computation at large. Computationally sound proofs provide, in a...