Sciweavers

2233 search results - page 131 / 447
» On the Complexity of Theory Curbing
Sort
View
AML
2002
69views more  AML 2002»
15 years 6 months ago
Transfer principles in nonstandard intuitionistic arithmetic
Using a slight generalization, due to Palmgren, of sheaf semantics, we present a term-model construction that assigns a model to any first-order intuitionistic theory. A modificat...
J. Avigad, Jeremy Helzner
ANTSW
2010
Springer
15 years 4 months ago
Exploiting Loose Horizontal Coupling in Evolutionary Swarm Robotics
We describe a theory from Herbert Simon that links the structure of complex systems to increased speed of evolution, and argue the position that this theory can be beneficial to ev...
Jennifer Owen, Susan Stepney, Jonathan Timmis, Ala...
SIAMCOMP
2011
15 years 1 months ago
The Chow Parameters Problem
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...
Ryan O'Donnell, Rocco A. Servedio
MSR
2011
ACM
14 years 9 months ago
A simpler model of software readability
Software readability is a property that influences how easily a given piece of code can be read and understood. Since readability can affect maintainability, quality, etc., prog...
Daryl Posnett, Abram Hindle, Premkumar T. Devanbu
STOC
2012
ACM
196views Algorithms» more  STOC 2012»
13 years 8 months ago
Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
Paul Beame, Christopher Beck, Russell Impagliazzo