Results 41 to 50 of about 1,098,765 (109)
Intrinsic universality and the computational power of self-assembly
, 2013 This short survey of recent work in tile self-assembly discusses the use of simulation to classify and separate the computational and expressive power of self-assembly models.
Woods, Damien
core +2 more sources
Inapproximability of Combinatorial Optimization Problems [PDF]
arXiv, 2004 We survey results on the hardness of approximating combinatorial optimization problems.
arxiv
, 2010 We prove that for all natural numbers k,n,d with k
Bürgisser, Peter +2 more
core +1 more source
Exploring k-Colorability [PDF]
arXiv, 2007 An introductory paper to the graph k-colorability problem.
arxiv
Focused Local Search for Random 3-Satisfiability
, 2005 A local search algorithm solving an NP-complete optimisation problem can be viewed as a stochastic process moving in an 'energy landscape' towards eventually finding an optimal solution.
Aarts E +25 more
core +1 more source
Relativized Propositional Calculus [PDF]
arXiv, 2012 Proof systems for the Relativized Propositional Calculus are defined and compared.
arxiv
The Communication Complexity of the Hamming Distance Problem
, 2005 We investigate the randomized and quantum communication complexity of the Hamming Distance problem, which is to determine if the Hamming distance between two n-bit strings is no less than a threshold d.
Ambainis +13 more
core +1 more source
Challenges in computational lower bounds [PDF]
arXiv, 2013 We draw two incomplete, biased maps of challenges in computational complexity lower bounds.
arxiv
LIKE Patterns and Complexity [PDF]
arXiv, 2019 We investigate the expressive power and complexity questions for the LIKE operator in SQL.
arxiv
New quantum algorithm for studying NP-complete problems
, 2003 Ordinary approach to quantum algorithm is based on quantum Turing machine or quantum circuits. It is known that this approach is not powerful enough to solve NP-complete problems.
Accardi +13 more
core +1 more source