On the public citation graph
On counting and approximation
0 signed · 60 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.1007/3-540-16486-3_112openalex-snapshot
Probabilistic quantifiers, adversaries, and complexity classes : An overview
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/bfb0039599openalex-snapshot
Graph isomorphism is in the low hierarchy
inferredcites →https://doi.org/10.1016/0020-0190(76)90097-1openalex-snapshot
Relative complexity of checking and evaluating
inferredcites →https://doi.org/10.1016/0020-0190(87)90232-8openalex-snapshot
Does co-NP have short interactive proofs?
inferredcites →https://doi.org/10.1016/0304-3975(76)90061-xopenalex-snapshot
The polynomial-time hierarchy
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(86)90141-6openalex-snapshot
Some observations on the connection between counting and recursion
inferredcites →https://doi.org/10.1016/0304-3975(86)90174-xopenalex-snapshot
Random generation of combinatorial structures from a uniform distribution
inferredcites →https://doi.org/10.1137/0208032openalex-snapshot
The Complexity of Enumeration and Reliability Problems
inferredcites →https://doi.org/10.1145/12130.12137openalex-snapshot
Private coins versus public coins in interactive proof systems
inferredcites →https://doi.org/10.1145/12130.12138openalex-snapshot
The complexity of optimization problems
inferredcites →https://doi.org/10.1145/22145.22192openalex-snapshot
Trading group theory for randomness
inferredcites →https://doi.org/10.1145/800061.808762openalex-snapshot
A complexity theoretic approach to randomness
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1999.2810openalex-snapshot
Tally NP Sets and Easy Census Functions
inferred← citeshttps://doi.org/10.1006/jcss.1998.1588openalex-snapshot
NondeterministicNC1Computation
inferred← citeshttps://doi.org/10.1007/11527695_3openalex-snapshot
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries
inferred← citeshttps://doi.org/10.1007/11821069_64openalex-snapshot
The Complexity of Counting Functions with Easy Decision Version
inferred← citeshttps://doi.org/10.1007/3-540-28520-2_8openalex-snapshot
Other Public-Key Cryptosystems and Protocols
inferred← citeshttps://doi.org/10.1007/3-540-38076-0_29openalex-snapshot
Acceptor-Definable Counting Classes
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_28openalex-snapshot
Subtractive Reductions and Complete Problems for Counting Complexity Classes
inferred← citeshttps://doi.org/10.1007/3-540-45833-6_25openalex-snapshot
Quantum Optimization Problems
inferred← citeshttps://doi.org/10.1007/3-540-48321-7_44openalex-snapshot
The operators minCh and maxCh on the polynomial hierarchy
inferred← citeshttps://doi.org/10.1007/3-540-55179-4_33openalex-snapshot
Complexity results for POMSET languages
inferred← citeshttps://doi.org/10.1007/3-540-56503-5_5openalex-snapshot
Locating P/poly optimally in the extended low hierarchy
inferred← citeshttps://doi.org/10.1007/978-3-032-31348-5_22openalex-snapshot
Counting Random Oracles for the Polynomial-Time Hierarchy and Quantum Complexity Classes
inferred← citeshttps://doi.org/10.1007/978-3-319-57586-5_6openalex-snapshot
Completeness Results for Counting Problems with Easy Decision
inferred← citeshttps://doi.org/10.1007/978-3-540-69733-6_16openalex-snapshot
Complexity of Counting the Optimal Solutions
inferred← citeshttps://doi.org/10.1007/bfb0023451openalex-snapshot
THE OPERATORS MIN AND MAX ON THE POLYNOMIAL HIERARCHY
inferred← citeshttps://doi.org/10.1007/bfb0028595openalex-snapshot
Uniformly defining complexity classes of functions
inferred← citeshttps://doi.org/10.1007/bfb0055790openalex-snapshot
On counting ac 0 circuits with negative constants
inferred← citeshttps://doi.org/10.1007/bfb0055798openalex-snapshot
Tally NP sets and easy census functions
inferred← citeshttps://doi.org/10.1007/s00224-008-9127-9openalex-snapshot
On the Autoreducibility of Functions
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00068-9openalex-snapshot
A note on SpanP functions
inferred← citeshttps://doi.org/10.1016/0022-0000(93)90006-iopenalex-snapshot
A complexity theory for feasible closure properties
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90369-qopenalex-snapshot
Polynomial-time 1-Turing reductions from #PH to #P
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90252-oopenalex-snapshot
A very hard log-space counting class
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00016-6openalex-snapshot
Locating P/poly optimally in the extended low hierarchy
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00080-3openalex-snapshot
Computing functions with parallel queries to NP
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50007-2openalex-snapshot
A Catalog of Complexity Classes
inferred← citeshttps://doi.org/10.1016/j.cosrev.2008.02.001openalex-snapshot
The consequences of eliminating NP solutions
inferred← citeshttps://doi.org/10.1016/j.ic.2010.11.013openalex-snapshot
Descriptional and computational complexity of finite automata—A survey
inferred← citeshttps://doi.org/10.1016/j.jcss.2005.10.002openalex-snapshot
Dimension, entropy rates, and compression
inferred← citeshttps://doi.org/10.1016/j.jcss.2013.01.012openalex-snapshot
Tractable counting of the answers to conjunctive queries
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00142-8openalex-snapshot
A note on unambiguous function classes
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80024-8openalex-snapshot
Gap-definable counting classes
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80082-0openalex-snapshot
Simple characterizations of P(#P) and complete problems
inferred← citeshttps://doi.org/10.1112/s1461157000000243openalex-snapshot
Counting Unlabelled Subtrees of a Tree is #P-complete
inferred← citeshttps://doi.org/10.1137/0220053openalex-snapshot
PP is as Hard as the Polynomial-Time Hierarchy
inferred← citeshttps://doi.org/10.1137/0406035openalex-snapshot
Complexity Results for POMSET Languages
inferred← citeshttps://doi.org/10.1137/s0097539791200351openalex-snapshot
Complexity-Restricted Advice Functions
inferred← citeshttps://doi.org/10.1142/s0129054103002047openalex-snapshot
ANALYSIS OF QUANTUM FUNCTIONS
inferred← citeshttps://doi.org/10.1142/s0218196711006066openalex-snapshot
THE THOMPSON–HIGMAN MONOIDS M k,i : THE ${\mathcal J}$-ORDER, THE ${\mathcal D}$-RELATION, AND THEIR COMPLEXITY
inferred← citeshttps://doi.org/10.1515/9783110889178.115openalex-snapshot
The complexity of counting problems
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.