On the public citation graph
PP Is Closed under Intersection
0 signed · 96 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 points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcss.1997.1552openalex-snapshot
A Lower Bound for Perceptrons and an Oracle Separation of the PPPHHierarchy
inferred← citeshttps://doi.org/10.1007/1-4020-8141-3_10openalex-snapshot
Degree Bounds on Polynomials and Relativization Theory
inferred← citeshttps://doi.org/10.1007/11523468_80openalex-snapshot
Lower Bounds for Circuits with Few Modular and Symmetric Gates
inferred← citeshttps://doi.org/10.1007/11750321_42openalex-snapshot
On PAC Learning Algorithms for Rich Boolean Function Classes
inferred← citeshttps://doi.org/10.1007/978-0-387-30440-3_428openalex-snapshot
Quantum Computational Complexity
inferred← citeshttps://doi.org/10.1007/978-1-4612-1872-2_11openalex-snapshot
Polynomials and Combinatorial Definitions of Languages
inferred← citeshttps://doi.org/10.1007/978-1-4614-1800-9_147openalex-snapshot
Quantum Computational Complexity
inferred← citeshttps://doi.org/10.1007/978-3-030-00338-8_3openalex-snapshot
A Tutorial on Query Answering and Reasoning over Probabilistic Knowledge Bases
inferred← citeshttps://doi.org/10.1007/978-3-319-23540-0_2openalex-snapshot
Probabilistic Query Answering in the Bayesian Description Logic $$\mathcal {BE{}L}$$
inferred← citeshttps://doi.org/10.1007/978-3-319-77404-6_62openalex-snapshot
Quadratic Simulations of Merlin–Arthur Games
inferred← citeshttps://doi.org/10.1007/978-3-540-27819-1_24openalex-snapshot
Learning Intersections of Halfspaces with a Margin
inferred← citeshttps://doi.org/10.1007/978-3-540-73545-8_44openalex-snapshot
Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates
inferred← citeshttps://doi.org/10.1007/978-3-642-15155-2_28openalex-snapshot
Counting Classes and the Fine Structure between NC 1 and L
inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_44openalex-snapshot
Learning and Lower Bounds for AC 0 with Threshold Gates
inferred← citeshttps://doi.org/10.1007/978-3-642-27737-5_428-3openalex-snapshot
Quantum Computational Complexity
inferred← citeshttps://doi.org/10.1007/978-3-662-46078-8_34openalex-snapshot
Lower Bounds for Linear Decision Trees with Bounded Weights
inferred← citeshttps://doi.org/10.1007/s00037-018-0175-5openalex-snapshot
Query-to-Communication Lifting for PNP
inferred← citeshttps://doi.org/10.1007/s00224-022-10105-9openalex-snapshot
Complexity Limitations on One-turn Quantum Refereed Games
inferred← citeshttps://doi.org/10.1007/s00224-022-10106-8openalex-snapshot
Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms
inferred← citeshttps://doi.org/10.1007/s00453-015-0104-9openalex-snapshot
Zero-Information Protocols and Unambiguity in Arthur–Merlin Communication
inferred← citeshttps://doi.org/10.1007/s00493-010-2173-3openalex-snapshot
New degree bounds for polynomial threshold functions
inferred← citeshttps://doi.org/10.1007/s00493-013-2759-7openalex-snapshot
Optimal bounds for sign-representing the intersection of two halfspaces by polynomials
inferred← citeshttps://doi.org/10.1007/s10817-016-9386-0openalex-snapshot
The Bayesian Ontology Language $$\mathcal {BEL}$$ BEL
inferred← citeshttps://doi.org/10.1007/s10994-007-5010-1openalex-snapshot
Unconditional lower bounds for learning intersections of halfspaces
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50011-3openalex-snapshot
Computational Complexity
inferred← citeshttps://doi.org/10.1016/j.artint.2021.103474openalex-snapshot
Open-world probabilistic databases: Semantics, algorithms, complexity
inferred← citeshttps://doi.org/10.1016/j.artint.2023.103884openalex-snapshot
On measuring inconsistency in definite and indefinite databases with denial constraints
inferred← citeshttps://doi.org/10.1016/j.artint.2024.104197openalex-snapshot
On measuring inconsistency in graph databases with regular path constraints
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104627openalex-snapshot
A structured view on weighted counting with relations to counting, quantum computation and applications
inferred← citeshttps://doi.org/10.1016/j.ic.2025.105372openalex-snapshot
Power of counting by nonuniform families of polynomial-size finite automata
inferred← citeshttps://doi.org/10.1016/j.ijar.2007.08.002openalex-snapshot
Probabilistic logic with independence
inferred← citeshttps://doi.org/10.1016/j.ijar.2016.10.008openalex-snapshot
On the complexity of propositional and relational credal networks
inferred← citeshttps://doi.org/10.1016/j.ijar.2017.03.014openalex-snapshot
The effect of combination functions on the complexity of relational Bayesian networks
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.12.011openalex-snapshot
Exponential lower bound for bounded depth circuits with few threshold gates
inferred← citeshttps://doi.org/10.1016/j.jcss.2003.11.002openalex-snapshot
Learning intersections and thresholds of halfspaces
inferred← citeshttps://doi.org/10.1016/j.jcss.2006.01.002openalex-snapshot
LWPP and WPP are not uniformly gap-definable
inferred← citeshttps://doi.org/10.1016/j.jcss.2006.05.001openalex-snapshot
Error-bounded probabilistic computations between MA and AM
inferred← citeshttps://doi.org/10.1016/j.jcss.2007.04.012openalex-snapshot
Learning intersections of halfspaces with a margin
inferred← citeshttps://doi.org/10.1016/j.jcss.2007.06.021openalex-snapshot
Extremal properties of polynomial threshold functions
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.04.004openalex-snapshot
Bounded depth circuits with weighted symmetric gates: Satisfiability, lower bounds and compression
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.05.018openalex-snapshot
On PAC learning algorithms for rich Boolean function classes
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.05.050openalex-snapshot
Counting classes and the fine structure between NC1 and L
inferred← citeshttps://doi.org/10.1016/s0004-3702(02)00271-0openalex-snapshot
Complexity results for structure-based causality
inferred← citeshttps://doi.org/10.1017/cbo9780511979309.019openalex-snapshot
Fun with the Anthropic Principle1
inferred← citeshttps://doi.org/10.1051/ita/1996300100011openalex-snapshot
Relationships among $PL$, $\#L$, and the determinant
inferred← citeshttps://doi.org/10.1088/1367-2630/aa5fdbopenalex-snapshot
Commuting quantum circuits and complexity of Ising partition functions
inferred← citeshttps://doi.org/10.1098/rspa.2005.1546openalex-snapshot
Quantum computing, postselection, and probabilistic polynomial-time
inferred← citeshttps://doi.org/10.1098/rspa.2011.0232openalex-snapshot
A linear-optical proof that the permanent is # P -hard
inferred← citeshttps://doi.org/10.1109/ccc.1997.612312openalex-snapshot
A lower bound for perceptrons and an oracle separation of the PP/sup PH/ hierarchy
inferred← citeshttps://doi.org/10.1109/ccc.1998.694621openalex-snapshot
Complexity issues in Markov decision processes
inferred← citeshttps://doi.org/10.1109/ccc.1999.766280openalex-snapshot
Circuit lower bounds collapse relativized complexity classes
inferred← citeshttps://doi.org/10.1109/ccc.2003.1214406openalex-snapshot
Extremal properties of polynomial threshold functions
inferred← citeshttps://doi.org/10.1109/ccc.2004.1313846openalex-snapshot
Polynomials that sign represent parity and descartes rule of signs
inferred← citeshttps://doi.org/10.1109/ccc.2007.18openalex-snapshot
On Computation and Communication with Small Bias
inferred← citeshttps://doi.org/10.1109/focs.2008.91openalex-snapshot
The Polynomial Method in Quantum and Classical Computing
inferred← citeshttps://doi.org/10.1109/focs.2009.18openalex-snapshot
The Intersection of Two Halfspaces Has High Threshold Degree
inferred← citeshttps://doi.org/10.1109/focs.2015.34openalex-snapshot
The Power of Asymmetry in Constant-Depth Circuits
inferred← citeshttps://doi.org/10.1109/focs.2018.00040openalex-snapshot
Classical Lower Bounds from Quantum Upper Bounds
inferred← citeshttps://doi.org/10.1109/isai-nlp48611.2019.9045540openalex-snapshot
Bandit Multiclass Linear Classification for the Group Linear Separable Case
inferred← citeshttps://doi.org/10.1109/lics65433.2025.00010openalex-snapshot
#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought?
inferred← citeshttps://doi.org/10.1109/sct.1992.215376openalex-snapshot
Perceptrons, PP, and the polynomial hierarchy
inferred← citeshttps://doi.org/10.1109/sct.1993.336538openalex-snapshot
The polynomial method in circuit complexity
inferred← citeshttps://doi.org/10.1109/sfcs.2002.1181894openalex-snapshot
Learning intersections and thresholds of halfspaces
inferred← citeshttps://doi.org/10.1134/s0001434610050263openalex-snapshot
A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length
inferred← citeshttps://doi.org/10.1137/100785260openalex-snapshot
The Intersection of Two Halfspaces Has High Threshold Degree
inferred← citeshttps://doi.org/10.1137/15m1015704openalex-snapshot
Breaking the Minsky--Papert Barrier for Constant-Depth Circuits
inferred← citeshttps://doi.org/10.1137/16m1064477openalex-snapshot
The Power of Asymmetry in Constant-Depth Circuits
inferred← citeshttps://doi.org/10.1137/19m1257792openalex-snapshot
Polynomial Threshold Functions, Hyperplane Arrangements, and Random Tensors
inferred← citeshttps://doi.org/10.1137/20m1312459openalex-snapshot
Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC$^0$
inferred← citeshttps://doi.org/10.1145/1052796.1052804openalex-snapshot
Guest Column: NP-complete problems and physical reality
inferred← citeshttps://doi.org/10.1145/1459010.1459017openalex-snapshot
A logical characterization of the counting hierarchy
inferred← citeshttps://doi.org/10.1145/2213977.2214044openalex-snapshot
Making polynomials robust to noise
inferred← citeshttps://doi.org/10.1145/2591796.2591871openalex-snapshot
Breaking the minsky-papert barrier for constant-depth circuits
inferred← citeshttps://doi.org/10.1145/2688073.2688074openalex-snapshot
Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication
inferred← citeshttps://doi.org/10.1145/3055399.3055425openalex-snapshot
Addition is exponentially harder than counting for shallow monotone circuits
inferred← citeshttps://doi.org/10.1145/3196832openalex-snapshot
The Weakness of CTC Qubits and the Power of Approximate Counting
inferred← citeshttps://doi.org/10.1145/3389399openalex-snapshot
Quadratic Simulations of Merlin–Arthur Games
inferred← citeshttps://doi.org/10.1145/3470863openalex-snapshot
Sign-rank Can Increase under Intersection
inferred← citeshttps://doi.org/10.1145/347476.347480openalex-snapshot
Complexity of finite-horizon Markov decision process problems
inferred← citeshttps://doi.org/10.1145/3519935.3520000openalex-snapshot
The approximate degree of DNF and CNF formulas
inferred← citeshttps://doi.org/10.1145/780542.780592openalex-snapshot
New degree bounds for polynomial threshold functions
inferred← citeshttps://doi.org/10.1561/0400000065openalex-snapshot
Faster Algorithms via Approximation Theory
inferred← citeshttps://doi.org/10.24963/ijcai.2017/132openalex-snapshot
Most Probable Explanations for Probabilistic Database Queries
inferred← citeshttps://doi.org/10.25368/2023.220openalex-snapshot
Most Probable Explanations for Probabilistic Database Queries
inferred← citeshttps://doi.org/10.4213/mzm8734openalex-snapshot
Небольшое уменьшение степени многочлена с заданной знаковой функцией может экспоненциально увеличить его вес и длину
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.