1204 search results - page 81 / 241 » Termination of Polynomial Programs |
118
Voted
CADE
2010
Springer
15 years 1 months ago
2010
Springer
In order to support the verification of programs, verification tools such as ACL2 or Isabelle try to extract suitable induction axioms from the definitions of terminating, recursiv...
105
Voted
CRYPTO
1991
Springer
15 years 4 months ago
1991
Springer
Recent results in interactive proof systems [?][?] [?] seem to indicate that it is easier for a prover in a single prover interactive proof system to cheat the verifier than it i...
112
Voted
JCP
2006
15 years 18 days ago
2006
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
119
Voted
SODA
2001
ACM
15 years 2 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
121
click to vote
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
When Genetic Programming is used to evolve arithmetic functions it often operates by composing them from a fixed collection of elementary operators and applying them to parameters...