1204 search results - page 76 / 241 » Termination of Polynomial Programs |
75
Voted
KBSE
1999
IEEE
15 years 4 months ago
1999
IEEE
CYNTHIA is a novel editor for the functional programming language ML in which each function definition is represented as the proof of a simple specification. Users of CYNTHIA edit...
115
click to vote
KBSE
1997
IEEE
15 years 4 months ago
1997
IEEE
Given a program S and a precondition Q, the strongest postcondition, denoted sp(S Q), is defined as the strongest condition that holds after the execution of S, given that S term...
102
Voted
ICCAD
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract— As VLSI technology enters the nanoscale regime, interconnect delay becomes the bottleneck of circuit performance. Compared to gate delays, wires are becoming increasing...
76
Voted
ICALP
2009
Springer
16 years 28 days ago
2009
Springer
We give a polynomial time algorithm that computes a decomposition of a finite group G given in the form of its multiplication table. That is, given G, the algorithm outputs two su...
ICALP
2009
Springer
15 years 7 months ago
2009
Springer
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We present a polynomial time algorithm that finds a satisfying assignment of Φ with high p...