1686 search results - page 24 / 338 » Programs as polygraphs: computability and complexity |
KES
1998
Springer
15 years 1 months ago
1998
Springer
Attractor systems are useful in neurodynamics,mainly in the modelingof associative memory. Thispaper presentsa complexity theory for continuous phase space dynamical systems with ...
SAS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
VLSID
2007
IEEE
15 years 10 months ago
2007
IEEE
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
77
Voted
PADL
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Interactive programming is a method for implementing programming languages that supports an interactive, exploratory style of program development and debugging. The basic...
66
Voted
CORR
2002
Springer
14 years 9 months ago
2002
Springer
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...