Sciweavers

6274 search results - page 481 / 1255
» From query complexity to computational complexity
Sort
View
SBP
2012
Springer
14 years 2 months ago
The Impact of Network Structure on the Perturbation Dynamics of a Multi-agent Economic Model
Complex adaptive systems (CAS) modeling has become a common tool to study the behavioral dynamics of agents in a broad range of disciplines from ecology to economics. Many modelers...
Marshall A. Kuypers, Walter E. Beyeler, Robert J. ...
DIMACS
1996
15 years 8 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
CHI
2009
ACM
16 years 7 months ago
Friend or foe?: examining CAS use in mathematics research
Computer Algebra Systems (CAS) provide sophisticated functionality to assist with mathematical problem solving. Despite their widespread adoption, however, little work in the HCI ...
Andrea Bunt, Michael Terry, Edward Lank
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
15 years 9 months ago
Trade-Off Lower Bounds for Stack Machines
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
Matei David, Periklis A. Papakonstantinou
APAL
2010
85views more  APAL 2010»
15 years 7 months ago
Elementary differences between the degrees of unsolvability and degrees of compressibility
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
George Barmpalias