2446 search results - page 345 / 490 » Choiceless Polynomial Time |
125
click to vote
DAC
1995
ACM
15 years 7 months ago
1995
ACM
This paper describes a technique for calculating the switching activity of a set of registers shared by di erent data values. Based on the assumption that the joint pdf (probabili...
164
click to vote
ISSAC
1995
Springer
15 years 7 months ago
1995
Springer
Abstract. In this paper we derive an algorithm that computes, for a given algebraic hyperelliptic plane curve C of genus p, p > 1, defined by a polynomial y2 = (x−λ1) · · ...
167
click to vote
PEPM
1995
ACM
15 years 7 months ago
1995
ACM
This paper concerns a method for approximating the possible “shapes” that heap-allocated structures in a program can take on. We present a new approach to finding solutions t...
116
click to vote
TAPSOFT
1991
Springer
15 years 7 months ago
1991
Springer
Type inference can be phrased as constraint-solving over types. We consider an implicitly typed language equipped with recursive types, multiple inheritance, 1st order parametric ...
144
click to vote
AIPS
2007
15 years 6 months ago
2007
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial time algorithm that uses macros to generate pla...