#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? | Paper Citation Record

Observation 331a1bf0-5755-4874-9565-f1f9d7f925e0 · outbound

This paper cites Mix Barrington, and Huong L ˆeThanh.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Mix Barrington, and Huong L ˆeThanh

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:58:57.937635Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 5f427349-7eb6-40a7-a846-b489f0278f39 · outbound

This paper cites A very hard log-space counting class.Theor.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? A very hard log-space counting class.Theor

Reference 2

Resolution: malformed identifier; raw_fallback, observed 2026-08-07T05:58:57.805781Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation bf8797f0-4419-467c-8320-ca2db6c1016f · outbound

This paper cites Completeness, approximability and exponential time results for counting problems with easy decision version.Theoretical Computer Science, 915:55–73, 2022.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Completeness, approximability and exponential time results for counting problems with easy decision version.Theoretical Computer Science, 915:55–73, 2022

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:58:57.606099Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation da28f84f-5494-4786-af38-dd5e43aa8b8d · outbound

This paper cites #NFA admits an FPRAS: efficient enumeration, counting, and uniform generation for logspace classes.J.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? #NFA admits an FPRAS: efficient enumeration, counting, and uniform generation for logspace classes.J

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-07T05:58:39.079640Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d7c88139-516f-4bb9-a7b9-25c7e4c0e1c5 · outbound

This paper cites Graph isomorphism is in spp.Information and Computation, 204(5):835–852, 2006.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Graph isomorphism is in spp.Information and Computation, 204(5):835–852, 2006

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:58:57.479354Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation cc5a09bf-dcbd-4549-aafd-92d34ea9ed3d · outbound

This paper cites Guest column: A panorama of counting problems the decision version of which is in p3.ACM SIGACT News, 53(3):46–68, 2022.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Guest column: A panorama of counting problems the decision version of which is in p3.ACM SIGACT News, 53(3):46–68, 2022

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:58:57.347217Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation ba005760-958d-4252-bad1-18abf68bf564 · outbound

This paper cites On the power of counting the total number of computation paths of nptms.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? On the power of counting the total number of computation paths of nptms

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:58:57.168054Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 18ce6e19-c668-4d69-837d-76384fed4fbc · outbound

This paper cites Characterizations and approximability of hard counting classes below.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Characterizations and approximability of hard counting classes below

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:58:57.038116Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 1ade1b93-7ab4-46c5-b727-650011e9aa2d · outbound

This paper cites Counting classes: Thresholds, parity, mods, and fewness.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Counting classes: Thresholds, parity, mods, and fewness

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:58:56.847267Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 641425c3-4c95-4c38-8ca8-1d7856f2bd11 · outbound

This paper cites Spielman.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Spielman

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-07T05:58:39.780252Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ff3b5354-3413-4585-9120-7b220fd52062 · outbound

This paper cites Handbook of Satisfiability, Second Edition.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Handbook of Satisfiability, Second Edition

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:58:56.599241Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 4f6cc2f2-eee1-490d-8de5-10fbf5e147cc · outbound

This paper cites Bodlaender, Paul S.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Bodlaender, Paul S

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-07T05:58:40.006879Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 55a07285-d3b3-4df8-8dfc-ff5bcb4093e5 · outbound

This paper cites Bodlaender and Ton Kloks.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Bodlaender and Ton Kloks

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:58:56.378113Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 7a9fbd6b-57bb-4932-a21e-6fe4ffbcccaa · outbound

This paper cites Bodlaender, Arie M.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Bodlaender, Arie M

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:58:56.227082Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 902eb0e5-37c9-4c3a-8e54-f787898cd640 · outbound

This paper cites Block interpolation: A framework for tight exponential-time counting complexity.Inf.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Block interpolation: A framework for tight exponential-time counting complexity.Inf

Reference 15

Resolution: verified exact; doi, observed 2026-08-07T05:58:48.854938Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 4a61bc67-9a7c-494d-a272-7aade4faea27 · outbound

This paper cites Counting mod- els for 2SAT and 3SAT formulae.Theor.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Counting mod- els for 2SAT and 3SAT formulae.Theor

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-07T05:58:40.437396Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 66c9564f-85ac-4fde-94d6-ff528fcb7900 · outbound

This paper cites Exponential Time Complexity of the Permanent and the Tutte Polynomial.ACM Trans.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Exponential Time Complexity of the Permanent and the Tutte Polynomial.ACM Trans

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-07T05:58:40.535369Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 052c0c31-f1c9-4a4a-8835-971122702d80 · outbound

This paper cites Subtractive reductions and complete problems for counting complexity classes.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Subtractive reductions and complete problems for counting complexity classes

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:58:56.082521Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 09c4e352-7901-480e-8c90-c080f9bbc544 · outbound

This paper cites Dyer, Leslie Ann Goldberg, Catherine S.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Dyer, Leslie Ann Goldberg, Catherine S

Reference 19

Resolution: verified exact; doi, observed 2026-08-07T05:58:48.537033Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation e3a4db97-3ba0-4466-925f-df115e9fcd47 · outbound

This paper cites Fenner, Lance Fortnow, and Stuart A.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Fenner, Lance Fortnow, and Stuart A

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-07T05:58:40.859225Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a3f3939b-7c2f-457c-8764-f19a56e24674 · outbound

This paper cites The model counting competition 2020.ACM J.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? The model counting competition 2020.ACM J

Reference 21

Resolution: verified exact; doi, observed 2026-08-07T05:58:48.237317Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 7ccaa7e8-3536-4a97-a90a-fb887e000007 · outbound

This paper cites Counting List Homomorphisms from Graphs of Bounded Treewidth: Tight Complexity Bounds.ACM Trans.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Counting List Homomorphisms from Graphs of Bounded Treewidth: Tight Complexity Bounds.ACM Trans

Reference 22

Resolution: malformed identifier; raw_fallback, observed 2026-08-07T05:58:55.934500Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 4fdeb848-e27f-4f78-918a-63555bf71c97 · outbound

This paper cites PP is closed under truth-table reductions.Inf.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? PP is closed under truth-table reductions.Inf

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-07T05:58:41.365071Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0a4b2fd8-0b20-4d41-961c-b24971142073 · outbound

This paper cites Synthesis Lectures on Artificial Intelligence and Machine Learning.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Synthesis Lectures on Artificial Intelligence and Machine Learning

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-07T05:58:41.515682Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 76f4ff12-4b9e-45b4-803b-1f936be5de16 · outbound

This paper cites Almost optimal lower bounds for small depth circuits.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Almost optimal lower bounds for small depth circuits

Reference 25

Resolution: malformed identifier; no resolver link, observed 2026-08-07T05:58:41.683818Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e776f00a-4fec-40c3-91c1-d0fca5f4ebba · outbound

This paper cites Relations among mod-classes.Theoretical Computer Science, 74(3):325–328, 1990.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Relations among mod-classes.Theoretical Computer Science, 74(3):325–328, 1990

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:58:55.798823Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 27412ccc-4624-4095-8f1c-47e821c3de6b · outbound

This paper cites Mix Barrington.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Mix Barrington

Reference 27

Resolution: malformed identifier; raw_fallback, observed 2026-08-07T05:58:55.658141Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 5ad9b98c-10ac-4aff-89ab-d989516420b8 · outbound

This paper cites The complexity of the inertia and some closure properties of gapl.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? The complexity of the inertia and some closure properties of gapl

Reference 28

Resolution: verified exact; doi, observed 2026-08-07T05:58:47.912035Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 1b401f31-08b0-4125-8d52-29fc837c0c06 · outbound

This paper cites Nondeterministic space is closed under complemen- tation.SIAM J.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Nondeterministic space is closed under complemen- tation.SIAM J

Reference 29

Resolution: malformed identifier; raw_fallback, observed 2026-08-07T05:58:55.524207Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 1c279249-f8e1-4533-ab84-8ef2a6e298a0 · outbound

This paper cites On the complexity of k- SAT.Journal of Computer and System Sciences, 62(2):367–375, 2001.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? On the complexity of k- SAT.Journal of Computer and System Sciences, 62(2):367–375, 2001

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:58:55.392730Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 383d4887-aa71-47af-838c-0551235e5259 · outbound

This paper cites Some (in)translatability results for normal logic pro- grams and propositional theories.J.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Some (in)translatability results for normal logic pro- grams and propositional theories.J

Reference 31

Resolution: verified exact; doi, observed 2026-08-07T05:58:47.637698Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 7cc11030-a73f-45c4-bd9e-62db51eb02d5 · outbound

This paper cites Picturing counting reductions with the ZH-calculus.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Picturing counting reductions with the ZH-calculus

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-07T05:58:42.959138Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 63bbe88e-2beb-4b68-8d60-9194a4f5cc99 · outbound

This paper cites A faster fpras for# nfa.Proceedings of the ACM on Management of Data, 2(2):1–22, 2024.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? A faster fpras for# nfa.Proceedings of the ACM on Management of Data, 2(2):1–22, 2024

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:58:55.244165Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 5420c153-4e68-49ef-bb3c-2838607162a5 · outbound

This paper cites On closure properties of #P in the context of PF◦#P.J.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? On closure properties of #P in the context of PF◦#P.J

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-07T05:58:43.255141Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fc61abb6-3e63-4193-99b0-571c9781c0b1 · outbound

This paper cites Hemachandra.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Hemachandra

Reference 35

Resolution: verified exact; doi, observed 2026-08-07T05:58:47.400477Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 6a016b29-e4f4-40f8-b042-4544c6c4a0b9 · outbound

This paper cites The complexity of counting functions with easy decision version.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? The complexity of counting functions with easy decision version

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-07T05:58:43.498255Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8852c54e-e552-4fa0-a060-edf3792770ab · outbound

This paper cites Two remarks on the power of counting.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Two remarks on the power of counting

Reference 37

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:58:55.083698Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation d1f866cd-6647-43c7-ac10-df3079234f22 · outbound

This paper cites Algorithms for propositional model counting.J.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Algorithms for propositional model counting.J

Reference 38

Resolution: malformed identifier; raw_fallback, observed 2026-08-07T05:58:54.790060Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 78d2f667-e9a6-4ad3-ba9a-b84fc0f18f2d · outbound

This paper cites A faster algorithm for propo- sitional model counting parameterized by incidence treewidth.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? A faster algorithm for propo- sitional model counting parameterized by incidence treewidth

Reference 39

Resolution: malformed identifier; raw_fallback, observed 2026-08-07T05:58:54.587137Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation d15f5e14-efbd-4cf7-892b-0abbdd09e224 · outbound

This paper cites Computational transition at the uniqueness threshold.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Computational transition at the uniqueness threshold

Reference 40

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:58:54.415391Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 196a81bf-e564-4ff5-8110-46be7c3be6e0 · outbound

This paper cites On closure properties of GapP.Comput.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? On closure properties of GapP.Comput

Reference 41

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:58:54.247477Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation db3dd02f-5802-483f-be73-88afad5d06d3 · outbound

This paper cites PP is as hard as the polynomial-time hierarchy.SIAM J.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? PP is as hard as the polynomial-time hierarchy.SIAM J

Reference 42

Resolution: unresolved; no resolver link, observed 2026-08-07T05:58:44.358005Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5c07af07-e898-4fff-bcb7-8190c5a163e2 · outbound

This paper cites an unresolved cited work.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Unresolved cited work

Reference 43

Resolution: malformed identifier; raw_fallback, observed 2026-08-07T05:58:54.058358Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 7142b327-95e8-4f9c-b7fd-c97b5a96ea09 · outbound

This paper cites an unresolved cited work.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Unresolved cited work

Reference 44

Resolution: unresolved; no resolver link, observed 2026-08-07T05:58:44.612539Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8d64886f-70e0-4d54-8017-d00dbaf66cfd · outbound

This paper cites an unresolved cited work.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Unresolved cited work

Reference 45

Resolution: malformed identifier; raw_fallback, observed 2026-08-07T05:58:53.890382Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 8b636736-45de-4376-a319-872270e53279 · outbound

This paper cites Valiant and Vijay V.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Valiant and Vijay V

Reference 46

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:58:53.611759Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 975ccdfd-0570-46f3-8224-811ff019b10c · outbound

This paper cites The symmetric rogue modelM ′ ofMis a satisfying assignment ofψ 2.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? The symmetric rogue modelM ′ ofMis a satisfying assignment ofψ 2

Reference 47

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:58:53.365614Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation bccfe671-c821-4fe1-bfcf-0a4eac6301dd · outbound

This paper cites Definition 36(Symmetric Rogue Model for Monotony).

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Definition 36(Symmetric Rogue Model for Monotony)

Reference 48

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:58:53.100811Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 62c0ba63-8993-4528-a934-3b0ba0bc1144 · outbound

This paper cites an unresolved cited work.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Unresolved cited work

Reference 49

Resolution: unresolved; raw_fallback, observed 2026-08-07T05:58:52.805533Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 520aca3b-76ba-4fa3-8272-98ae2b9e839e · outbound

This paper cites Lemma 38.Letφbe aCNF,Tbe a fully labeled tree decomposition of it, andMbe a satisfying assignment ofψ ′ 1 that is rogue.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Lemma 38.Letφbe aCNF,Tbe a fully labeled tree decomposition of it, andMbe a satisfying assignment ofψ ′ 1 that is rogue

Reference 50

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:58:52.488101Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 31a10da0-463b-44c5-87c5-63b1c0dc791d · outbound

This paper cites In order to show that(I)M ′ =f(M)is also rogue att ′, lett ⋆ be the node ofTsuch thatMis rogue att ⋆ withM not being rogue at an ancestor oft ⋆.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? In order to show that(I)M ′ =f(M)is also rogue att ′, lett ⋆ be the node ofTsuch thatMis rogue att ⋆ withM not being rogue at an ancestor oft ⋆

Reference 51

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:58:52.164000Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation aa94e3e6-ab94-4113-865e-021714bdda2d · outbound

This paper cites gapP⊆[#2SAT−#2SAT] log.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? gapP⊆[#2SAT−#2SAT] log

Reference 52

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:58:51.904283Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation eb5413aa-9f9c-48d3-a59c-5ac70cc89d8a · outbound

This paper cites ·” to “+.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? ·” to “+

Reference 53

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:58:51.582815Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 3413dc1e-427c-4a01-9c44-a4067a3032ef · outbound

This paper cites [#0,1-2DNF−#0,1-2DNF] log ⊆[#2DNF− #2DNF] log.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? [#0,1-2DNF−#0,1-2DNF] log ⊆[#2DNF− #2DNF] log

Reference 54

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:58:51.304653Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation efb81016-9902-48fd-ad7a-9c48bd07a47a · outbound

This paper cites Now, it remains to construct formulasα, α ′ such that#(α)− #(α′) =c= (#(ψ 1) + #(ψ′ 2))−(#(ψ 2) + #(ψ′ 1)).

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Now, it remains to construct formulasα, α ′ such that#(α)− #(α′) =c= (#(ψ 1) + #(ψ′ 2))−(#(ψ 2) + #(ψ′ 1))

Reference 55

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:58:51.009694Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation deda8645-d4ec-4a36-ab28-0663598c01e6 · outbound

This paper cites an unresolved cited work.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Unresolved cited work

Reference 56

Resolution: unresolved; raw_fallback, observed 2026-08-07T05:58:50.699252Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation c49e881e-f173-4179-904c-066aaffec31d · outbound

This paper cites [#MON2SAT−#MON2SAT] log ⊆[#MON2DNF− #MON2DNF] log.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? [#MON2SAT−#MON2SAT] log ⊆[#MON2DNF− #MON2DNF] log

Reference 57

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:58:50.418046Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation c99e3e17-6dab-4032-994a-fab1064bbbdd · outbound

This paper cites an unresolved cited work.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? Unresolved cited work

Reference 58

Resolution: unresolved; raw_fallback, observed 2026-08-07T05:58:50.121603Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation afc9e1e7-5693-4516-84be-347572e7f089 · outbound

This paper cites degree3and bipartiteness.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? degree3and bipartiteness

Reference 59

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:58:49.853160Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 1d29fccd-b54b-4d01-afaf-81e850865382 · outbound

This paper cites gapP⊆[#IMPL2SAT] log AC0.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? gapP⊆[#IMPL2SAT] log AC0

Reference 60

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:58:49.576288Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation e0baac91-c4d0-467c-a00b-a6b0be0e7b0e · outbound

This paper cites [#IMPL2SAT] log AC0 = [#0,1-2DNF] log AC0.

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? [#IMPL2SAT] log AC0 = [#0,1-2DNF] log AC0

Reference 61

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:58:49.293707Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Coverage vector

Reference resolution

Outbound references

Pith citing papers