On the public citation graph
Computational Complexity of Quantum Satisfiability
0 signed · 107 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jcom.1996.0019openalex-snapshot
Hilbert's Nullstellensatz Is in the Polynomial Hierarchy
inferredcites →https://doi.org/10.1006/jcom.1999.0502openalex-snapshot
The Real Dimension Problem Is NPR-Complete
inferredcites →https://doi.org/10.1007/3-540-45022-x_70openalex-snapshot
Lower Bounds Are Not Easier over the Reals: Inside PH
inferredcites →https://doi.org/10.1007/978-0-387-35651-8openalex-snapshot
Ideals, Varieties, and Algorithms
inferredcites →https://doi.org/10.1007/978-1-4612-0441-1openalex-snapshot
Effective Methods in Algebraic Geometry
inferredcites →https://doi.org/10.1007/978-1-4612-0441-1_11openalex-snapshot
Algorithmes – disons rapides – pour la décomposition d’une variété algébrique en composantes irréductibles et équidimensionnelles
inferredcites →https://doi.org/10.1007/978-1-4613-0097-7openalex-snapshot
Algebras of Linear Transformations
inferredcites →https://doi.org/10.1007/978-3-642-11805-0_32openalex-snapshot
Complexity of Some Geometric and Topological Problems
inferredcites →https://doi.org/10.1007/978-3-642-59207-2openalex-snapshot
The Classical Decision Problem
inferredcites →https://doi.org/10.1007/978-3-642-60539-0_20openalex-snapshot
The Space Complexity of Elimination Theory: Upper Bounds
inferredcites →https://doi.org/10.1007/978-3-662-04179-6openalex-snapshot
Completeness and Reduction in Algebraic Complexity Theory
inferredcites →https://doi.org/10.1007/978-3-662-05355-3openalex-snapshot
Algorithms in Real Algebraic Geometry
inferredcites →https://doi.org/10.1007/978-3-662-10451-4openalex-snapshot
Theory of Operator Algebras II
inferredcites →https://doi.org/10.1007/978-3-7091-9459-1_11openalex-snapshot
Recent Progress on the Complexity of the Decision Problem for the Reals
inferredcites →https://doi.org/10.1007/978-3-7091-9459-1_3openalex-snapshot
A Decision Method for Elementary Algebra and Geometry
inferredcites →https://doi.org/10.1007/978-94-017-1201-9openalex-snapshot
Current research in operational quantum logic : algebras, categories, languages
inferredcites →https://doi.org/10.1007/bf02435704openalex-snapshot
Finitely generated free modular ortholattices. I
inferredcites →https://doi.org/10.1007/bf02568029openalex-snapshot
Über einen Algorithmus zur Bestimmung der Raumgruppen
inferredcites →https://doi.org/10.1007/bf02573979openalex-snapshot
Combinatorial models for the finite-dimensional Grassmannians
inferredcites →https://doi.org/10.1007/bf03025291openalex-snapshot
Mathematical problems for the next century
inferredcites →https://doi.org/10.1007/bfb0023823openalex-snapshot
On the complexity of some problems for the Blum, Shub & Smale model
inferredcites →https://doi.org/10.1007/s00012-009-0003-5openalex-snapshot
Complemented modular lattices with involution and orthogonal geometry
inferredcites →https://doi.org/10.1007/s00012-010-0064-5openalex-snapshot
Generators for complemented modular lattices and the von Neumann–Jónsson coordinatization theorems
inferredcites →https://doi.org/10.1007/s10208-002-0078-2openalex-snapshot
The Computational Complexity of the Chow Form
inferredcites →https://doi.org/10.1007/s10208-007-9006-9openalex-snapshot
Exotic Quantifiers, Complexity Classes, and Complete Problems
inferredcites →https://doi.org/10.1007/s10208-010-9062-4openalex-snapshot
Polynomial Hierarchy, Betti Numbers, and a Real Analogue of Toda’s Theorem
inferredcites →https://doi.org/10.1007/s10208-012-9123-yopenalex-snapshot
Castelnuovo–Mumford Regularity and Computing the de Rham Cohomology of Smooth Projective Varieties
inferredcites →https://doi.org/10.1007/s10773-008-9853-4openalex-snapshot
A Link between Quantum Logic and Categorical Quantum Mechanics
inferredcites →https://doi.org/10.1016/0001-8708(82)90048-2openalex-snapshot
The complexity of the word problems for commutative semigroups and polynomial ideals
inferredcites →https://doi.org/10.1016/0029-5582(64)90052-5openalex-snapshot
Mathematical foundations of quantum mechanics
inferredcites →https://doi.org/10.1016/0041-5553(65)90115-1openalex-snapshot
Mathematical foundations of quantum mechanics
inferredcites →https://doi.org/10.1016/0304-3975(79)90044-6openalex-snapshot
The Complexity of Computing the Permanent
inferredcites →https://doi.org/10.1016/0304-3975(94)00067-0openalex-snapshot
P≠NP over the nonstandard reals implies P≠NP over R
inferredcites →https://doi.org/10.1016/b978-044452870-4/50038-8openalex-snapshot
Quantum logic and quantum computation
inferredcites →https://doi.org/10.1016/c2009-0-16935-0openalex-snapshot
Handbook of Quantum Logic and Quantum Structures
inferredcites →https://doi.org/10.1016/j.ic.2005.07.005openalex-snapshot
Implicit complexity over an arbitrary structure: Quantifier alternations
inferredcites →https://doi.org/10.1016/j.jco.2005.11.001openalex-snapshot
Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets
inferredcites →https://doi.org/10.1016/j.jco.2007.02.005openalex-snapshot
A note on parallel and alternating time
inferredcites →https://doi.org/10.1016/j.jsc.2008.02.009openalex-snapshot
On the complexity of counting components of algebraic varieties
inferredcites →https://doi.org/10.1016/j.tcs.2005.04.001openalex-snapshot
A theory of computation based on quantum logic (I)
inferredcites →https://doi.org/10.1016/s0049-237x(09)70292-7openalex-snapshot
I: A General Method in Proofs of Undecidability
inferredcites →https://doi.org/10.1016/s0304-3975(99)00183-8openalex-snapshot
Cook's versus Valiant's hypothesis
inferredcites →https://doi.org/10.1016/s0747-7171(10)80003-3openalex-snapshot
On the computational complexity and geometry of the first-order theory of the reals. Part I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
inferredcites →https://doi.org/10.1016/s0747-7171(88)80006-3openalex-snapshot
Complexity of deciding Tarski algebra
inferredcites →https://doi.org/10.1016/s1570-2464(07)80006-1openalex-snapshot
3 Complexity of modal logic
inferredcites →https://doi.org/10.1017/cbo9781107340725openalex-snapshot
The Logic of Quantum Mechanics
inferredcites →https://doi.org/10.1023/a:1003678913718openalex-snapshot
Quantum Logic as a Basis for Computations
inferredcites →https://doi.org/10.1063/1.3051542openalex-snapshot
The Mathematical Foundations of Quantum Mechanics
inferredcites →https://doi.org/10.1090/conm/223/03144openalex-snapshot
The universality theorems for oriented matroids and polytopes
inferredcites →https://doi.org/10.1090/s0002-9947-1960-0120175-0openalex-snapshot
Representations of Complemented Modular Lattices
inferredcites →https://doi.org/10.1090/s0002-9947-1984-0743743-8openalex-snapshot
On the Arithmetic of Projective Coordinate Systems
inferredcites →https://doi.org/10.1090/s0273-0979-1989-15750-9openalex-snapshot
On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
inferredcites →https://doi.org/10.1093/comjnl/36.5.400openalex-snapshot
On the Complexity of Quantifier Elimination: the Structural Approach
inferredcites →https://doi.org/10.1093/oso/9780198537816.003.0008openalex-snapshot
Computable functions and semicomputable sets on many-sorted algebras
inferredcites →https://doi.org/10.1109/grc.2005.1547240openalex-snapshot
A theory of computation based on quantum logic (I)
inferredcites →https://doi.org/10.1109/lics.2011.8openalex-snapshot
Computational Complexity of Quantum Satisfiability
inferredcites →https://doi.org/10.1109/phycmp.1992.615511openalex-snapshot
Complexity Of Neural Network Learning In The Real Number Model
inferredcites →https://doi.org/10.1137/0206054openalex-snapshot
On Relating Time and Space to Size and Depth
inferredcites →https://doi.org/10.1137/070697926openalex-snapshot
On the Complexity of Numerical Analysis
inferredcites →https://doi.org/10.1137/s0097539794270340openalex-snapshot
On the Power of Real Turing Machines over Binary Inputs
inferredcites →https://doi.org/10.1142/9789812564894_0013openalex-snapshot
ENUMERABLE SETS ARE DIOPHANTINE
inferredcites →https://doi.org/10.1142/9789813270886_0005openalex-snapshot
Finite Dimensional Vector Spaces
inferredcites →https://doi.org/10.1145/1592451.1592453openalex-snapshot
A rendezvous of logic, complexity, and algebra
inferredcites →https://doi.org/10.1145/225058.225151openalex-snapshot
Descriptive complexity theory over the real numbers
inferredcites →https://doi.org/10.1145/2371656.2371662openalex-snapshot
Fixed-point definability and polynomial time on graphs with excluded minors
inferredcites →https://doi.org/10.1145/276698.276864openalex-snapshot
Are lower bounds easier over the reals?
inferredcites →https://doi.org/10.1145/345542.345633openalex-snapshot
Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions
inferredcites →https://doi.org/10.1145/62212.62257openalex-snapshot
Some algebraic and geometric computations in PSPACE
inferredcites →https://doi.org/10.1145/800133.804350openalex-snapshot
The complexity of satisfiability problems
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.1201/9781420035315openalex-snapshot
Handbook of Discrete and Computational Geometry, Second Edition
inferredcites →https://doi.org/10.1215/s0012-7094-48-01581-6openalex-snapshot
Dualities of finite projective planes
inferredcites →https://doi.org/10.1353/ajm.0.0057openalex-snapshot
Characterizing integers among rational numbers with a universal-existential formula
inferredcites →https://doi.org/10.1515/9781400889921openalex-snapshot
Mathematical Foundations of Quantum Mechanics
inferredcites →https://doi.org/10.2178/jsl/1120224716openalex-snapshot
Quantum logic as motivated by quantum computing
inferredcites →https://doi.org/10.2178/jsl/1278682219openalex-snapshot
On the equational theory of projection lattices of finite von neumann factors
inferredcites →https://doi.org/10.2307/2007638openalex-snapshot
Encyclopedia of Mathematics and its Applications.
inferredcites →https://doi.org/10.24033/bsmf.2138openalex-snapshot
Sur la complexité du principe de Tarski-Seidenberg
inferredcites →https://doi.org/10.26421/qic7.4-1openalex-snapshot
Quantum computaton from a quantum logical perspective
inferredcites →https://doi.org/10.36045/bbms/1105730626openalex-snapshot
A survey on real structural complexity theory
inferredcites →https://doi.org/10.4153/cjm-1989-044-8openalex-snapshot
On the Word Problem for Orthocomplemented Modular Lattices
inferredcites →https://doi.org/10.4204/eptcs.128.16openalex-snapshot
Satisfiability of cross product terms is complete for real nondeterministic polytime Blum-Shub-Smale machines
inferredcites →https://doi.org/10.5860/choice.35-6275copenalex-snapshot
Complexity and real computation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-032-10503-5_5openalex-snapshot
The Existential Theory of the Reals as a Complexity Class: A Compendium
inferred← citeshttps://doi.org/10.1007/s00012-014-0278-zopenalex-snapshot
On geometric representations of modular ortholattices
inferred← citeshttps://doi.org/10.1007/s00012-018-0553-5openalex-snapshot
Definable relations in finite-dimensional subspace lattices with involution
inferred← citeshttps://doi.org/10.1007/s00012-019-0603-7openalex-snapshot
Definable relations in finite dimensional subspace lattices with involution. Part II: Quantifier-free and homogeneous descriptions
inferred← citeshttps://doi.org/10.1007/s00012-021-00760-3openalex-snapshot
On the complexity of equational decision problems for finite height complemented and orthocomplemented modular lattices
inferred← citeshttps://doi.org/10.1007/s00153-020-00749-0openalex-snapshot
Quantum logic is undecidable
inferred← citeshttps://doi.org/10.1016/j.jco.2022.101727openalex-snapshot
Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations
inferred← citeshttps://doi.org/10.1142/s0218196716500697openalex-snapshot
On the consistency problem for modular lattices and related structures
inferred← citeshttps://doi.org/10.4204/eptcs.128.16openalex-snapshot
Satisfiability of cross product terms is complete for real nondeterministic polytime Blum-Shub-Smale machines
inferred← citeshttps://doi.org/10.48550/arxiv.1607.03315openalex-snapshot
On the consistency problem for modular lattices and related structures
inferred← citeshttps://doi.org/10.48550/arxiv.1811.07846openalex-snapshot
On the complexity of equational decision problems for finite height(ortho)complemented modular lattices
inferred← citeshttps://doi.org/10.48550/arxiv.1908.02639openalex-snapshot
A Note on the "Third Life of Quantum Logic"
inferred← citeshttps://doi.org/10.48550/arxiv.2109.13850openalex-snapshot
Quantum Undergraduate Education and Scientific Training
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.