Sciweavers

5372 search results - page 334 / 1075
» complexity 2007
Sort
View
DAM
2007
83views more  DAM 2007»
15 years 2 months ago
The proof theoretic strength of the Steinitz exchange theorem
We show that the logical theory QLA proves the Cayley–Hamilton theorem from the Steinitz exchange theorem together with a strengthening of the linear independence principle. Sin...
Michael Soltys
ENTCS
2007
108views more  ENTCS 2007»
15 years 2 months ago
Simulating and Compiling Code for the Sequential Quantum Random Access Machine
We present the SQRAM architecture for quantum computing, which is based on Knill’s QRAM model. We detail a suitable instruction set, which implements a universal set of quantum ...
Rajagopal Nagarajan, Nikolaos Papanikolaou, David ...
ENTCS
2007
90views more  ENTCS 2007»
15 years 2 months ago
Undecidability of Multi-modal Hybrid Logics
This paper establishes undecidability of satisfiability for multi-modal logic equipped with the hybrid binder ↓ , with respect to frame classes over which the same language wit...
Martin Mundhenk, Thomas Schneider 0002
102
Voted
ENTCS
2007
80views more  ENTCS 2007»
15 years 2 months ago
Combining Product Lines and Model-Based Development
Using model-based development has shown to increase efficiency and effectiveness of software production. However, with software as an integral part of products with customized fu...
Bernhard Schätz
GC
2007
Springer
15 years 2 months ago
Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles
We propose a novel subdivision of the plane that consists of both convex polygons and pseudotriangles. This pseudo-convex decomposition is significantly sparser than either conve...
Oswin Aichholzer, Clemens Huemer, S. Kappes, Betti...