Sciweavers

5608 search results - page 6 / 1122
» On the Theory of Matchgate Computations
Sort
View
201
Voted
APAL
2011
14 years 6 months ago
The Suslin operator in applicative theories: Its proof-theoretic analysis via ordinal theories
The Suslin operator E1 is a type-2 functional testing for the wellfoundedness of binary relations on the natural numbers. In the context of applicative theories, its proof-theoret...
Gerhard Jäger, Dieter Probst
ENTCS
2011
131views more  ENTCS 2011»
14 years 6 months ago
Computational Complexity in Non-Turing Models of Computation: The What, the Why and the How
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â...
Ed Blakey
SIGECOM
2011
ACM
229views ECommerce» more  SIGECOM 2011»
14 years 2 months ago
A revealed preference approach to computational complexity in economics
Recent results in complexity theory suggest that various economic theories require agents to solve computationally intractable problems. However, such results assume the agents ar...
Federico Echenique, Daniel Golovin, Adam Wierman
PC
2000
105views Management» more  PC 2000»
14 years 11 months ago
New advances in chemistry and materials science with CPMD and parallel computing
A short overview is presented of the density functional theory and molecular dynamics (DFT
Wanda Andreoni, Alessandro Curioni