Pages that link to "Item:Q163528"
From MaRDI portal
The following pages link to Electronic Notes in Theoretical Computer Science (Q163528):
Displaying 50 items.
- Range and set abstraction using SAT (Q2814098) (← links)
- Abstract fixpoint computations with numerical acceleration methods (Q2814099) (← links)
- View-augmented abstractions (Q2814101) (← links)
- Relational abstract domain of weighted hexagons (Q2814105) (← links)
- Static analysis by abstract interpretation: a mathematical programming approach (Q2814107) (← links)
- Quadtrees as an abstract domain (Q2814109) (← links)
- Extending abstract acceleration methods to data-flow programs with numerical inputs (Q2814110) (← links)
- A note on the inversion join for polyhedral analysis (Q2814111) (← links)
- Speeding up polyhedral analysis by identifying common constraints (Q2814112) (← links)
- Concrete memory models for shape analysis (Q2814114) (← links)
- Information processing in convex operational theories (Q2825337) (← links)
- Computational complexity in non-Turing models of computation: the what, the why and the how (Q2825338) (← links)
- Toy quantum categories (extended abstract) (Q2825340) (← links)
- Game semantics for quantum data (Q2825342) (← links)
- Measurements and confluence in quantum lambda calculi with explicit qubits (Q2825343) (← links)
- The thermodynamic arrow-of-time and quantum mechanics (Q2825344) (← links)
- How to randomly flip a quantum bit (Q2825345) (← links)
- Partial observation of quantum Turing machines and a weaker well-formedness condition (Q2825346) (← links)
- Finite dimensional Hilbert spaces are complete for dagger compact closed categories (extended abstract) (Q2825347) (← links)
- On quantum and probabilistic linear lambda-calculi (extended abstract) (Q2825348) (← links)
- Categorical formulation of finite-dimensional \(C^*\)-algebras (Q2825349) (← links)
- On orthomodular posets generated by transition systems (Q2825351) (← links)
- Classical knowledge for quantum security (Q2825352) (← links)
- An overview of QML with a concrete implementation in Haskell (Q2825353) (← links)
- Verification of quantum protocols with a probabilistic model-checker (Q2825357) (← links)
- Modelling parallel quantum computing using transactional memory (Q2825358) (← links)
- Quantum circuits: from a network to a one-way model (Q2825360) (← links)
- Correlated information: a logic for multi-partite quantum systems (Q2825361) (← links)
- Phase groups and the origin of non-locality for qubits (Q2825362) (← links)
- Classical representations of qubit channels (Q2825363) (← links)
- Topos quantum logic and mixed states (Q2825364) (← links)
- Quantum logic in dagger kernel categories (Q2825365) (← links)
- Feynman graphs, and nerve theorem for compact symmetric multicategories (extended abstract) (Q2825366) (← links)
- The invariant set hypothesis: a new geometric framework for the foundations of quantum theory and the role played by gravity (Q2825367) (← links)
- Relating toy models of quantum computation: comprehension, complementarity and dagger mix autonomous categories (Q2825368) (← links)
- Bell states and negative sentences in the distributed model of meaning (Q2825369) (← links)
- Programmable Hamiltonian for one-way patterns (Q2825371) (← links)
- Categorical properties of the complex numbers (Q2825372) (← links)
- Symmetry and composition in probabilistic theories (Q2825373) (← links)
- Universal quantum computation with abelian anyon models (Q2825374) (← links)
- Scalar System F for linear-algebraic \(\lambda\)-calculus: towards a quantum physical logic (Q2825375) (← links)
- Graphical calculus for quantum key distribution (extended abstract) (Q2825376) (← links)
- Confluence results for a quantum lambda calculus with measurements (Q2825377) (← links)
- An algebra of automata that includes both classical and quantum entities (Q2825378) (← links)
- Unsorted functional translations (Q2825403) (← links)
- Tableau method and NEXPTIME-completeness of DEL-sequents (Q2825404) (← links)
- Two-sorted point-interval temporal logics (Q2825405) (← links)
- The closed fragment of IL is PSPACE hard (Q2825406) (← links)
- Preferential reasoning for modal logics (Q2825407) (← links)
- Query answering with DBoxes is hard (Q2825409) (← links)
