Sciweavers

5608 search results - page 202 / 1122
» On the Theory of Matchgate Computations
Sort
View
CORR
2007
Springer
113views Education» more  CORR 2007»
15 years 1 months ago
Geometry and the complexity of matrix multiplication
We survey results in algebraic complexity theory, focusing on matrix multiplication. Our goals are (i.) to show how open questions in algebraic complexity theory are naturally pose...
J. M. Landsberg
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
15 years 1 months ago
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
Stefan Felsner, Lorenz Wernisch
TPHOL
2007
IEEE
15 years 8 months ago
Formalising Generalised Substitutions
Abstract. We use the theorem prover Isabelle to formalise and machinecheck results of the theory of generalised substitutions given by Dunne and used in the B method. We describe t...
Jeremy E. Dawson
TC
2010
15 years 8 days ago
Formal Reliability Analysis Using Theorem Proving
—Reliability analysis has become a tool of fundamental importance to virtually all electrical and computer engineers because of the extensive usage of hardware systems in safety ...
Osman Hasan, Sofiène Tahar, Naeem Abbasi
115
Voted
TCS
2010
15 years 8 days ago
Alternating states for dual nondeterminism in imperative programming
The refinement calculus of Back, Morgan, Morris, and others is based on monotone predicate transformers (weakest preconditions) where conjunctions stand for demonic choices betwee...
Wim H. Hesselink