4328 search results - page 817 / 866 » A New Kind of Science |
153
click to vote
COCO
2009
Springer
16 years 21 days ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
134
click to vote
COCO
2009
Springer
16 years 21 days ago
2009
Springer
—In 1982, Kannan showed that ΣP 2 does not have nk -sized circuits for any k. Do smaller classes also admit such circuit lower bounds? Despite several improvements of Kannan’s...
204
click to vote
COCO
2009
Springer
16 years 21 days ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
164
click to vote
ECSQARU
2009
Springer
16 years 21 days ago
2009
Springer
Abstract. This paper presents a method which allows for merging beliefs expressed thanks to logic programming with stable model semantics. This method is based on the syntactic mer...
153
click to vote
CANDC
2009
ACM
16 years 19 days ago
2009
ACM
Whenever we feel those ‘higher’ and hard to define sensations like synchronicity, love, wholeness, and appreciation is this a pattern or illuminative system that is part of a ...