Sciweavers

1242 search results - page 14 / 249
» A Computational Complexity Theory in Membrane Computing
Sort
View
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
13 years 10 months ago
Quantum complexity theory
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
Ethan Bernstein, Umesh V. Vazirani
AGI
2008
13 years 8 months ago
A computational approximation to the AIXI model
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...
Sergey Pankov
FPLAY
2008
13 years 8 months ago
Using conflict theory to model complex societal interactions
Conflict theory can be used to explain the interactions between societies during times of turmoil and change (i.e. revolutions, strikes or everyday debates). Games have been produ...
Ben Medler, Joe Fitzgerald, Brian Magerko
JDCTA
2010
228views more  JDCTA 2010»
13 years 1 months ago
Research and Progress of Cluster Algorithms based on Granular Computing
Granular Computing (GrC), a knowledge-oriented computing which covers the theory of fuzzy information granularity, rough set theory, the theory of quotient space and interval comp...
Shifei Ding, Li Xu, Hong Zhu, Liwen Zhang
STOC
1996
ACM
197views Algorithms» more  STOC 1996»
13 years 11 months ago
Computing Betti Numbers via Combinatorial Laplacians
We use the Laplacian and power method to compute Betti numbers of simplicial complexes. This has a number of advantages over other methods, both in theory and in practice. It requ...
Joel Friedman