Sciweavers

1679 search results - page 87 / 336
» Strong order equivalence
Sort
View
PPDP
2005
Springer
14 years 3 months ago
A new calculus of contexts
We study contexts (terms with holes) by proposing a ‘λcalculus with holes’. It is very expressive and can encode programming constructs apparently unrelated to contexts, incl...
Murdoch Gabbay
TLCA
2005
Springer
14 years 3 months ago
Naming Proofs in Classical Propositional Logic
Abstract. We present a theory of proof denotations in classical propologic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. ...
François Lamarche, Lutz Straßburger
SOFSEM
2004
Springer
14 years 3 months ago
Avoiding Forbidden Submatrices by Row Deletions
We initiate a systematic study of the Row Deletion(B) problem on matrices: For a fixed “forbidden submatrix” B, the question is, given an input matrix A (both A and B have ent...
Sebastian Wernicke, Jochen Alber, Jens Gramm, Jion...
COCO
2001
Springer
161views Algorithms» more  COCO 2001»
14 years 2 months ago
Communication Complexity Lower Bounds by Polynomials
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...
Harry Buhrman, Ronald de Wolf
LICS
1996
IEEE
14 years 2 months ago
Higher Dimensional Transition Systems
We introduce the notion of higher dimensional transition systems as a model of concurrency providing an elementary, set-theoretic formalisation of the idea of higher dimensional t...
Gian Luca Cattani, Vladimiro Sassone