Results 261 to 270 of about 3,355,376 (309)
Some of the next articles are maybe not open access.
Computational Complexity and Knowledge Complexity
SIAM Journal on Computing, 1998Summary: We study the computational complexity of languages which have interactive proofs of logarithmic knowledge complexity. We show that all such languages can be recognized in \({\mathcal {BPP}}^{\mathcal {NP}}\). Prior to this work, for languages with greater-than-zero knowledge complexity only trivial computational complexity bounds were known ...
Oded Goldreich 0001 +2 more
openaire +3 more sources
An overview of computational complexity [PDF]
Communications of the ACM, 1983 An historical overview of computational complexity is presented. Emphasis is on the fundamental issues of defining the intrinsic computational complexity of a problem and proving upper and lower bounds on the complexity of problems. Probabilistic and parallel computation are discussed.
Stephen Cook
exaly +6 more sources
Computational complexity and evolutionary computation
Proceedings of the 9th annual conference companion on Genetic and evolutionary computation, 2007Evolutionary algorithms and other nature-inspired search heuristics like ant colony optimization have been shown to be very successful when dealing with real-world applications or problems from combinatorial optimization. In recent years, analyses has shown that these general randomized search heuristics can be analyzed like "ordinary" randomized ...
Thomas Jansen 0001, Frank Neumann 0001
openaire +6 more sources
On the Computational Complexity of Conservative Computing
2003In a seminal paper published in 1982, Fredkin and Toffoli have introduced conservative logic, a mathematical model that allows one to describe computations which reflect some properties of microdynamical laws of Physics, such as reversibility and conservation of the internal energy of the physical system used to perform the computations. In particular,
MAURI, GIANCARLO +1 more
openaire +2 more sources
Computational Complexity of NURIKABE
Fundamenta Informaticae, 2011We show that the popular pencil puzzle NURIKABE is intractable from the computational complexity point of view, that is, it is NP-complete, even when the involved numbers are 1 and 2 only. To this end, we show how to simulate Boolean gates by the puzzle under consideration. Moreover, we also study some NURIKABE variants, which remain NP-complete, too.
Markus Holzer 0001 +3 more
openaire +2 more sources
Proceedings of the 1978 annual conference on - ACM 78, 1978
Construction of algorithms is a time honored mathematical activity. Euclid's algorithm for finding the greatest common divisor of two integers, as well as the many constructions by a ruler and compass are some of the fruits of the search for algorithms by the Greek mathematicians.
openaire +1 more source
Construction of algorithms is a time honored mathematical activity. Euclid's algorithm for finding the greatest common divisor of two integers, as well as the many constructions by a ruler and compass are some of the fruits of the search for algorithms by the Greek mathematicians.
openaire +1 more source