412 search results - page 15 / 83 » A New Proof of the F5 Algorithm |
COCO
2009
Springer
15 years 4 months ago
2009
Springer
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
ASIAN
2004
Springer
15 years 3 months ago
2004
Springer
We propose a simple theory of expressions which is intended to be used as a foundational syntactic structure for the Natural Framework (NF). We define expression formally and give...
KBSE
1999
IEEE
15 years 2 months ago
1999
IEEE
Deductive retrieval and deductive synthesis are two conceptually closely related software development methods which apply theorem proving techniques to support the construction of...
104
click to vote
STOC
2012
ACM
13 years 6 days ago
2012
ACM
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...
ACSC
2003
IEEE
15 years 3 months ago
2003
IEEE
Graphs where each node includes an amount of text are often used in applications. A typical example of such graphs is UML diagrams used in CASE tools. To make text information in ...