Pages that link to "Item:Q3177775"
From MaRDI portal
The following pages link to Computational Complexity of Quantum Satisfiability (Q3177775):
Displaying 10 items.
- Definable relations in finite-dimensional subspace lattices with involution (Q1991600) (← links)
- On the complexity of equational decision problems for finite height complemented and orthocomplemented modular lattices (Q2073367) (← links)
- Definable relations in finite dimensional subspace lattices with involution. II. Quantifier-free and homogeneous descriptions (Q2311328) (← links)
- Quantum logic is undecidable (Q2663337) (← links)
- Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations (Q2693688) (← links)
- (Q2707520) (← links)
- STACS 2004 (Q5309685) (← links)
- A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY (Q5858921) (← links)
- Classical vs quantum satisfiability in linear constraint systems modulo an integer (Q5870684) (← links)
- Theory and Applications of Models of Computation (Q5898863) (← links)