Sciweavers

281 search results - page 15 / 57
» The Proof Complexity of Linear Algebra
Sort
View
151
Voted

Source Code
1763views
17 years 14 days ago
dlib C++ Library
A library for developing portable applications that deal with networking, threads (message passing, futures, etc...), graphical interfaces, complex data structures, linear algebra,...
Davis E. King
130
Voted
TCS
2008
15 years 3 months ago
Using bisimulation proof techniques for the analysis of distributed abstract machines
Analysis of Distributed Abstract Machines Damien Pous ENS Lyon, France. We illustrate the use of recently developed proof techniques for weak bisimulation sing a generic framework...
Damien Pous
111
Voted
ISSAC
2005
Springer
125views Mathematics» more  ISSAC 2005»
15 years 9 months ago
Generalized normal forms and polynomial system solving
This paper describes a new method for computing the normal form of a polynomial modulo a zero-dimensional ideal I. We give a detailed description of the algorithm, a proof of its ...
Bernard Mourrain
130
Voted
APLAS
2004
ACM
15 years 9 months ago
A Functional Language for Logarithmic Space
Abstract. More than being just a tool for expressing algorithms, a welldesigned programming language allows the user to express her ideas efficiently. The design choices however eï...
Peter Møller Neergaard
120
Voted
IJCAI
2007
15 years 5 months ago
Tractable Temporal Reasoning
Temporal reasoning is widely used within both Computer Science and A.I. However, the underlying complexity of temporal proof in discrete temporal logics has led to the use of simp...
Clare Dixon, Michael Fisher, Boris Konev