Faster Exponential-Time Approximate Counting via Bounded Self-Reductions | Paper Citation Record

Observation f4a7fbfd-041a-4f37-8b89-044c10b04821 · outbound

This paper cites Quantum event learning and gentle random measurements.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions Quantum event learning and gentle random measurements

Reference 1

Resolution: verified exact; doi, observed 2026-07-08T07:44:42.554684Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation a3de1864-ba84-4c70-80f2-c09cddebf938 · outbound

This paper cites Finding and counting given length cycles.Algo- rithmica, 17(3):209–223, 1997.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions Finding and counting given length cycles.Algo- rithmica, 17(3):209–223, 1997

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.845827Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation d1df16ed-c908-4c72-9aa0-4713f60a9a45 · outbound

This paper cites Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.849260Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 1ca128b9-c17a-4bdd-82a1-dd7724dcded8 · outbound

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

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions Completeness, approximability and exponential time results for counting prob- lems with easy decision version.Theoretical Computer Science, 915:55–73, 2022

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.826433Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation c9cb9e97-f157-48e4-87b8-f7b4887f5d89 · outbound

This paper cites Self-reducible with easy decision version counting problems admit additive error approximation. Connections to counting complexity, exponential time complexity, and circuit lower bounds.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions Self-reducible with easy decision version counting problems admit additive error approximation. Connections to counting complexity, exponential time complexity, and circuit lower bounds

Reference 5

Resolution: verified exact; local_arxiv, observed 2026-07-08T07:44:42.591867Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 646fc64e-0c31-4df7-869e-a2e2bc368631 · outbound

This paper cites Com- pleteness results for counting problems with easy decision.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions Com- pleteness results for counting problems with easy decision

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.852422Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 64098247-a559-43d0-9b1a-7d62e7976853 · outbound

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

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions On the power of counting the total number of computation paths of NPTMs

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.769481Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 5756535b-c79c-4a1b-bb1a-dae8e2e07784 · outbound

This paper cites Generating all the minimal separators of a graph.International Journal of Foundations of Computer Science, 11(03):397–403, 2000.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions Generating all the minimal separators of a graph.International Journal of Foundations of Computer Science, 11(03):397–403, 2000

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.820642Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 4d1abf9f-6737-4941-a4f7-0440e4e1e397 · outbound

This paper cites Quantum Amplitude Amplification and Estimation.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions Quantum Amplitude Amplification and Estimation

Reference 9

Resolution: verified exact; local_arxiv, observed 2026-07-08T07:44:42.585664Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation c4bbeb0f-3e81-4a6b-9f89-41584d9580c5 · outbound

This paper cites Finding all cliques of an undirected graph (algorithm 457).Commun.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions Finding all cliques of an undirected graph (algorithm 457).Commun

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.855279Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation d3a75eb1-8c59-4ede-a78d-4ec248ebde8a · outbound

This paper cites The expressibility of functions on the boolean domain, with applications to counting CSPs.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions The expressibility of functions on the boolean domain, with applications to counting CSPs

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.833998Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 4632a287-4b3f-44de-a8a9-04894f246208 · outbound

This paper cites Solving and sampling with many solutions: Satisfiability and other hard problems.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions Solving and sampling with many solutions: Satisfiability and other hard problems

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.810952Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 7e50019d-7c48-4182-b738-948ab2f66be3 · outbound

This paper cites Output-sensitive approx- imate counting via a measure-bounded hyperedge oracle, or: How asymmetry helps estimate- clique counts faster.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions Output-sensitive approx- imate counting via a measure-bounded hyperedge oracle, or: How asymmetry helps estimate- clique counts faster

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.789546Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 8f2712d5-70b9-4929-be74-23b47307aefc · outbound

This paper cites Counting models for 2SAT and 3SAT formulae.Theoretical Computer Science, 332(1-3):265–291, 2005.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions Counting models for 2SAT and 3SAT formulae.Theoretical Computer Science, 332(1-3):265–291, 2005

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.776876Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation aa954921-32f4-4600-961f-6449be5c1ebe · outbound

This paper cites Fine-grained reductions from approximate counting to deci- sion.ACM Transactions on Computation Theory (TOCT), 13(2):1–24, 2021.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions Fine-grained reductions from approximate counting to deci- sion.ACM Transactions on Computation Theory (TOCT), 13(2):1–24, 2021

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.786836Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation ad9302b2-9a37-42e9-a698-b6cc22d7eff7 · outbound

This paper cites A random polynomial-time algorithm for ap- proximating the volume of convex bodies.Journal of the ACM (JACM), 38(1):1–17, 1991.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions A random polynomial-time algorithm for ap- proximating the volume of convex bodies.Journal of the ACM (JACM), 38(1):1–17, 1991

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.792492Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation f459a252-e226-407f-aa59-676bb11da5c1 · outbound

This paper cites The relative complexity of approximate counting problems.Algorithmica, 38:471–500, 2004.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions The relative complexity of approximate counting problems.Algorithmica, 38:471–500, 2004

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.725155Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 478ad4c9-a4f2-48f5-972b-ba37d1a34832 · outbound

This paper cites Counting perfect matchings in graphs of degree 3.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions Counting perfect matchings in graphs of degree 3

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.805674Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 835729d0-933f-4d6d-8014-33bf4aea3222 · outbound

This paper cites Approximately countingH-colorings is #BIS-hard.SIAM Journal on Computing, 45(3):680–711, 2016.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions Approximately countingH-colorings is #BIS-hard.SIAM Journal on Computing, 45(3):680–711, 2016

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.766934Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation d7c8a8c4-6fd1-4807-ae9d-3723963973a8 · outbound

This paper cites an unresolved cited work.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions Unresolved cited work

Reference 20

Resolution: verified exact; doi, observed 2026-07-08T07:44:42.570647Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation f3791467-299f-4739-b638-530c884f4584 · outbound

This paper cites On the Number of Minimal Separators in Graphs.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions On the Number of Minimal Separators in Graphs

Reference 21

Resolution: verified exact; local_arxiv, observed 2026-07-08T07:44:42.608014Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 637f39a0-4a1f-4357-a610-91513fd7375d · outbound

This paper cites A new probabilistic algorithm for approximate model counting.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions A new probabilistic algorithm for approximate model counting

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.714896Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation c1952d86-097a-48df-9b6e-5854976302ed · outbound

This paper cites Approximating the partition function of the ferro- magnetic Potts model.Journal of the ACM (JACM), 59(5):1–31, 2012.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions Approximating the partition function of the ferro- magnetic Potts model.Journal of the ACM (JACM), 59(5):1–31, 2012

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.817655Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 7f32f392-7d61-4895-8d88-7566c4434c2a · outbound

This paper cites Approximately counting locally-optimal structures.Journal of Computer and System Sciences, 82(6):1144–1160, 2016.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions Approximately counting locally-optimal structures.Journal of Computer and System Sciences, 82(6):1144–1160, 2016

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.722081Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 1a220158-8d54-4804-8a8f-5e9bdeebbfef · outbound

This paper cites Faster exponential-time algorithms for approximately counting independent sets.Theoretical Computer Science, 892:48–84, 2021.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions Faster exponential-time algorithms for approximately counting independent sets.Theoretical Computer Science, 892:48–84, 2021

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.731041Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation b6d4c149-41ed-44a7-b7d8-8185bb9087b1 · outbound

This paper cites The number of maximal independent sets in triangle-free graphs.SIAM Journal on Discrete Mathematics, 6(2):284–288, 1993.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions The number of maximal independent sets in triangle-free graphs.SIAM Journal on Discrete Mathematics, 6(2):284–288, 1993

Reference 26

Resolution: verified exact; doi, observed 2026-07-08T07:44:42.558404Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 903f2de5-92be-49b9-ad8a-6ca72716f4e9 · outbound

This paper cites Fast approximation algorithms for the knapsack and sum of subset problems.Journal of the ACM (JACM), 22(4):463–468, 1975.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions Fast approximation algorithms for the knapsack and sum of subset problems.Journal of the ACM (JACM), 22(4):463–468, 1975

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.808300Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 1dda8b13-e90f-49ca-831c-cdf1862d1428 · outbound

This paper cites Polynomial-time approximation algorithms for the Ising model.SIAM Journal on computing, 22(5):1087–1116, 1993.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions Polynomial-time approximation algorithms for the Ising model.SIAM Journal on computing, 22(5):1087–1116, 1993

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.772193Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 9884ef42-71c4-4aa1-8c24-918c51e59d73 · outbound

This paper cites A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.Journal of the ACM (JACM), 51(4): 671–697, 2004.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.Journal of the ACM (JACM), 51(4): 671–697, 2004

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.830673Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 529e21d8-c842-4d17-b0ab-9db79ad78459 · outbound

This paper cites Random generation of combinatorial structures from a uniform distribution.Theoretical computer science, 43:169–188, 1986.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions Random generation of combinatorial structures from a uniform distribution.Theoretical computer science, 43:169–188, 1986

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.761201Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 01545b7f-624e-411a-88e5-9d305e365984 · outbound

This paper cites Monte-Carlo algorithms for enumeration and reliability problems.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions Monte-Carlo algorithms for enumeration and reliability problems

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.798491Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation e6d43962-8d10-4605-8621-129db3dfa6ff · outbound

This paper cites Monte-Carlo approximation algorithms for enumeration problems.Journal of algorithms, 10(3):429–448, 1989.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions Monte-Carlo approximation algorithms for enumeration problems.Journal of algorithms, 10(3):429–448, 1989

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.727904Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 3253192e-1ebb-4f44-812f-d0edabe32517 · outbound

This paper cites Listing Small Minimal $s,t$-separators in FPT-Delay.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions Listing Small Minimal $s,t$-separators in FPT-Delay

Reference 33

Resolution: verified exact; local_arxiv, observed 2026-07-08T07:44:42.602954Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation e62c02e5-e51e-4c4d-95ed-d669252bfc51 · outbound

This paper cites A fully polynomial approximation scheme for the total tardiness problem.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions A fully polynomial approximation scheme for the total tardiness problem

Reference 34

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.734345Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 3359e5e6-62f2-4014-9465-6c71b8ba760f · outbound

This paper cites Random walks in a convex body and an improved volume algorithm.Random structures & algorithms, 4(4):359–412, 1993.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions Random walks in a convex body and an improved volume algorithm.Random structures & algorithms, 4(4):359–412, 1993

Reference 35

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.774539Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 023a085a-b295-474d-a1f2-7187ffbe4865 · outbound

This paper cites New algorithms for enumerating all maximal cliques.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions New algorithms for enumerating all maximal cliques

Reference 36

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.841287Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 10691752-535c-4c5b-969f-893674a14335 · outbound

This paper cites Mitzenmacher and E.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions Mitzenmacher and E

Reference 37

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.823428Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation c39dda9c-47ea-4bab-935e-d0bd517a4ad4 · outbound

This paper cites URLhttps://books.google.com/books?id=E9UlDwAAQBAJ.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions URLhttps://books.google.com/books?id=E9UlDwAAQBAJ

Reference 38

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.748554Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 31017632-0bd5-46ca-a78c-02013ef44b9a · outbound

This paper cites On cliques in graphs.Israel journal of Mathematics, 3:23–28, 1965.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions On cliques in graphs.Israel journal of Mathematics, 3:23–28, 1965

Reference 39

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.783994Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 2aefa20b-b6a1-4fb8-8de3-aeccd1157b83 · outbound

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

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions The complexity of counting functions with easy decision version

Reference 40

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.781438Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation c85a8362-e02e-47f4-bfaf-59f5ceac65bc · outbound

This paper cites New algorithms for #2-SAT and #3-SAT.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions New algorithms for #2-SAT and #3-SAT

Reference 41

Resolution: verified exact; doi, observed 2026-07-08T07:44:42.565530Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 48d355ef-47f4-4a03-8ba8-f32e124e4a9c · outbound

This paper cites Exploiting independent subformulas: A faster approximation scheme for #k-SAT.Information Processing Letters, 113(9):337–344, 2013.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions Exploiting independent subformulas: A faster approximation scheme for #k-SAT.Information Processing Letters, 113(9):337–344, 2013

Reference 42

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.743741Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 896bc532-d611-4133-abcf-d203df5e8a73 · outbound

This paper cites Approximate counting, uniform generation and rapidly mixing Markov chains.Information and Computation, 82(1):93–133, 1989.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions Approximate counting, uniform generation and rapidly mixing Markov chains.Information and Computation, 82(1):93–133, 1989

Reference 43

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.813810Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 8daa2ccd-1667-46ac-95b4-957c939ea66e · outbound

This paper cites Spatial mixing and the connective constant: Optimal bounds.Probability Theory and Related Fields, 168(1): 153–197, 2017.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions Spatial mixing and the connective constant: Optimal bounds.Probability Theory and Related Fields, 168(1): 153–197, 2017

Reference 44

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.737589Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation b51c9cf4-9189-46aa-8928-d0926c034984 · outbound

This paper cites Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph.Discrete Applied Mathematics, 158(15):1660–1667, 2010.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph.Discrete Applied Mathematics, 158(15):1660–1667, 2010

Reference 45

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.795096Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 0ab793b2-96c9-45d7-b01a-ebb32fd18730 · outbound

This paper cites An Approximation Algorithm for #k-SAT.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions An Approximation Algorithm for #k-SAT

Reference 46

Resolution: verified exact; local_arxiv, observed 2026-07-08T07:44:42.597486Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 357daa51-962c-4e88-8bd0-283a7d20a77d · outbound

This paper cites A new algorithm for generating all the maximal independent sets.SIAM Journal on Computing, 6(3):505–517, 1977.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions A new algorithm for generating all the maximal independent sets.SIAM Journal on Computing, 6(3):505–517, 1977

Reference 47

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.717246Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation c079c63b-440b-42bf-9991-6204ac2f5405 · outbound

This paper cites The complexity of enumeration and reliability problems.siam Journal on Computing, 8(3):410–421.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions The complexity of enumeration and reliability problems.siam Journal on Computing, 8(3):410–421

Reference 48

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.802297Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 47fc3d7c-f15d-4684-8b18-33e0d27c8c26 · outbound

This paper cites Finding, minimizing, and counting weighted sub- graphs.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions Finding, minimizing, and counting weighted sub- graphs

Reference 49

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.719717Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 91f2c234-eea8-4925-aeae-3689124910b5 · outbound

This paper cites A tighter bound for counting max-weight solutions to 2SAT instances.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions A tighter bound for counting max-weight solutions to 2SAT instances

Reference 50

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.763773Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 2dce032e-9954-4e78-84a7-30fb3bd0efc2 · outbound

This paper cites carry weights in the instance.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions carry weights in the instance

Reference 51

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.779009Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 2edee536-b2b8-4f4a-9999-fee2dec7e0c7 · outbound

This paper cites an unresolved cited work.

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions Unresolved cited work

Reference 52

Resolution: unresolved; raw_fallback, observed 2026-07-08T07:44:42.837844Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 770e2457-458a-46d7-8b83-be0295a0a518 · outbound

This paper cites Under these worst-case assumptions, in branchiwe have n3(H)−n 3(Hi)≥4 + 2k i, n2(H)−n 2(Hi)≥E−(3 +k i).

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions Under these worst-case assumptions, in branchiwe have n3(H)−n 3(Hi)≥4 + 2k i, n2(H)−n 2(Hi)≥E−(3 +k i)

Reference 53

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T07:44:42.740798Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Coverage vector

Reference resolution

Outbound references

Pith citing papers