On the public citation graph

Relativization of questions about log space computability

https://doi.org/10.1007/bf01683260
0 signed · 179 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4684-2001-2openalex-snapshot
Complexity of Computer Computations
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-662-21545-6openalex-snapshot
Automata, Languages and Programming
inferredcites →https://doi.org/10.1007/bf00289513openalex-snapshot
On non-determinancy in simple computing devices
inferredcites →https://doi.org/10.1016/0304-3975(75)90016-xopenalex-snapshot
A comparison of polynomial time reducibilities
inferredcites →https://doi.org/10.1016/s0022-0000(67)80013-8openalex-snapshot
Nonerasing stack automata
inferredcites →https://doi.org/10.1016/s0022-0000(70)80006-xopenalex-snapshot
Relationships between nondeterministic and deterministic tape complexities
inferredcites →https://doi.org/10.1016/s0022-0000(75)80014-6openalex-snapshot
On tape-bounded complexity classes and multihead finite automata
inferredcites →https://doi.org/10.1016/s0022-0000(75)80050-xopenalex-snapshot
Space-bounded reducibility among combinatorial problems
inferredcites →https://doi.org/10.1109/focs.1965.11openalex-snapshot
Hierarchies of memory limited computations
inferredcites →https://doi.org/10.1137/0204037openalex-snapshot
Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
inferredcites →https://doi.org/10.1145/321623.321625openalex-snapshot
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
inferredcites →https://doi.org/10.1145/321864.321877openalex-snapshot
On the Structure of Polynomial Time Reducibility
inferredcites →https://doi.org/10.1145/322033.322037openalex-snapshot
Log Space Recognition and Translation of Parenthesis Languages
inferredcites →https://doi.org/10.1145/800119.803883openalex-snapshot
Complete problems for deterministic polynomial time
inferredcites →https://doi.org/10.1145/800125.804032openalex-snapshot
An observation on time-storage trade off
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.1145/990518.990519openalex-snapshot
The circuit value problem is log space complete for P
inferredcites →https://doi.org/10.13182/nse70-a19706openalex-snapshot
Formal Languages and their Relation to Automata

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781118032916.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/9781118595091.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1002/malq.19860321702openalex-snapshot
Oracle‐Constructions to Prove All Possible Relationships Between Relativizations of P, NP, EL, NEL, EP and NEP
inferred← citeshttps://doi.org/10.1002/malq.19980440108openalex-snapshot
Capturing Relativized Complexity Classes without Order
inferred← citeshttps://doi.org/10.1006/inco.1995.1029openalex-snapshot
Node Replacement Graph Languages Squeezed with Chains, Trees, and Forests
inferred← citeshttps://doi.org/10.1006/jcss.1998.1589openalex-snapshot
Deterministic and Randomized Bounded Truth-Table Reductions of P, NL, and L to Sparse Sets
inferred← citeshttps://doi.org/10.1007/11590156_19openalex-snapshot
The Directed Planar Reachability Problem
inferred← citeshttps://doi.org/10.1007/3-540-08353-7_172openalex-snapshot
Time and tape bounded auxiliary pushdown automata
inferred← citeshttps://doi.org/10.1007/3-540-16078-7_85openalex-snapshot
Logspace hierarchies, polynomial time and the complexity of fairness problems concerning ω-machines
inferred← citeshttps://doi.org/10.1007/3-540-16486-3_111openalex-snapshot
Parallel computation and the NC hierarchy relativized
inferred← citeshttps://doi.org/10.1007/3-540-16486-3_90openalex-snapshot
Relativized alternation
inferred← citeshttps://doi.org/10.1007/3-540-16761-7_70openalex-snapshot
Decompositions of nondeterministic reductions
inferred← citeshttps://doi.org/10.1007/3-540-16761-7_93openalex-snapshot
More complicated questions about maxima and minima, and some closures of NP
inferred← citeshttps://doi.org/10.1007/3-540-18088-5_46openalex-snapshot
The logarithmic alternation hierarchy collapses: $$A\Sigma _2^\mathcal{L} = A\Pi _2^\mathcal{L}$$
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_122openalex-snapshot
New developments in structural complexity theory
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_150openalex-snapshot
On restricting the access to an NP-oracle
inferred← citeshttps://doi.org/10.1007/3-540-28520-2_3openalex-snapshot
Foundations of Complexity Theory
inferred← citeshttps://doi.org/10.1007/3-540-28520-2_5openalex-snapshot
Hierarchies Based on NP
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-44612-5_37openalex-snapshot
Alternating and Empty Alternating Auxiliary Stack Automata
inferred← citeshttps://doi.org/10.1007/3-540-52921-7_54openalex-snapshot
Oracles versus proof techniques that do not relativize
inferred← citeshttps://doi.org/10.1007/3-540-54458-5_61openalex-snapshot
Unambiguity and fewness for logarithmic space
inferred← citeshttps://doi.org/10.1007/3-540-54458-5_76openalex-snapshot
On the complexity of graph reconstruction
inferred← citeshttps://doi.org/10.1007/3-540-55808-x_33openalex-snapshot
The emptiness problem for intersections of regular languages
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_134openalex-snapshot
Quasilinear time complexity theory
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_151openalex-snapshot
NCk(NP)=AC k−1(NP)
inferred← citeshttps://doi.org/10.1007/3-540-58338-6_96openalex-snapshot
Empty alternation
inferred← citeshttps://doi.org/10.1007/3-540-60178-3_98openalex-snapshot
Logics capturing relativized complexity classes uniformly
inferred← citeshttps://doi.org/10.1007/3-540-62844-4_32openalex-snapshot
On the complexity of iterated insertions
inferred← citeshttps://doi.org/10.1007/978-3-030-14812-6_41openalex-snapshot
Supportive Oracles for Parameterized Polynomial-Time Sub-Linear-Space Computations in Relation to L, NL, and P
inferred← citeshttps://doi.org/10.1007/978-3-030-20981-0_2openalex-snapshot
Complexity-Theoretic Aspects of Expanding Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-39886-8_12openalex-snapshot
Computational Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-73208-2_29openalex-snapshot
Complexity Theory for Splicing Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_29openalex-snapshot
Relativizing Small Complexity Classes and Their Theories
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_41openalex-snapshot
Space-Efficient Informational Redundancy
inferred← citeshttps://doi.org/10.1007/978-3-642-37075-5_21openalex-snapshot
Pure Pointer Programs and Tree Isomorphism
inferred← citeshttps://doi.org/10.1007/978-3-642-38536-0_24openalex-snapshot
Universality of Regular Realizability Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_40openalex-snapshot
Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions
inferred← citeshttps://doi.org/10.1007/978-3-662-44465-8_27openalex-snapshot
Autoreducibility and Mitoticity of Logspace-Complete Sets for NP and Other Classes
inferred← citeshttps://doi.org/10.1007/978-3-662-44465-8_37openalex-snapshot
Small Complexity Classes for Computable Analysis
inferred← citeshttps://doi.org/10.1007/978-94-017-0522-6_10openalex-snapshot
Computable Quantifiers and Logics over Finite Structures
inferred← citeshttps://doi.org/10.1007/bf01191473openalex-snapshot
Adaptive logspace reducibility and parallel time
inferred← citeshttps://doi.org/10.1007/bf01206639openalex-snapshot
Space-efficient recognition of sparse self-reducible languages
inferred← citeshttps://doi.org/10.1007/bf01271369openalex-snapshot
The relative power of logspace and polynomial time reductions
inferred← citeshttps://doi.org/10.1007/bf01374526openalex-snapshot
Structure and importance of logspace-MOD class
inferred← citeshttps://doi.org/10.1007/bf01578841openalex-snapshot
Generalized theorems on relationships among reducibility notions to certain complexity classes
inferred← citeshttps://doi.org/10.1007/bf01578845openalex-snapshot
On the complexity of graph reconstruction
inferred← citeshttps://doi.org/10.1007/bf01692056openalex-snapshot
RelativizedNC
inferred← citeshttps://doi.org/10.1007/bf01744301openalex-snapshot
On relativizing auxiliary pushdown machines
inferred← citeshttps://doi.org/10.1007/bf01744431openalex-snapshot
Parity, circuits, and the polynomial-time hierarchy
inferred← citeshttps://doi.org/10.1007/bf01744581openalex-snapshot
A note on relativized log space
inferred← citeshttps://doi.org/10.1007/bf02090397openalex-snapshot
Completeness for nondeterministic complexity classes
inferred← citeshttps://doi.org/10.1007/bf02835830openalex-snapshot
A time-space hierarchy between polynomial time and polynomial space
inferred← citeshttps://doi.org/10.1007/bfb0015925openalex-snapshot
Complexity theory and formal languages
inferred← citeshttps://doi.org/10.1007/bfb0016278openalex-snapshot
Two characterizations of the logarithmic alternation hierarchy
inferred← citeshttps://doi.org/10.1007/bfb0020812openalex-snapshot
Structure and importance of logspace-MOD-classes
inferred← citeshttps://doi.org/10.1007/bfb0020816openalex-snapshot
Bounded reductions
inferred← citeshttps://doi.org/10.1007/bfb0020817openalex-snapshot
Functional oracle queries as a measure of parallel time
inferred← citeshttps://doi.org/10.1007/bfb0029618openalex-snapshot
Generalized kolmogorov complexity in relativized separations
inferred← citeshttps://doi.org/10.1007/bfb0030320openalex-snapshot
Nondeterministic logspace reductions
inferred← citeshttps://doi.org/10.1007/bfb0035835openalex-snapshot
Collapsing oracle hierarchies, census functions and logarithmically many queries
inferred← citeshttps://doi.org/10.1007/bfb0036168openalex-snapshot
The complexity class θp2: Recent results and applications in AI and modal logic
inferred← citeshttps://doi.org/10.1007/bfb0036938openalex-snapshot
Complexity classes of alternating machines with oracles
inferred← citeshttps://doi.org/10.1007/bfb0039591openalex-snapshot
Towards a theory of relativizations: Positive relativizations
inferred← citeshttps://doi.org/10.1007/bfb0049333openalex-snapshot
Oracles and quantifiers
inferred← citeshttps://doi.org/10.1007/bfb0052085openalex-snapshot
Closure under complementation of logspace complexity classes - A survey -
inferred← citeshttps://doi.org/10.1007/s00037-015-0113-8openalex-snapshot
Relativizing small complexity classes and their theories
inferred← citeshttps://doi.org/10.1007/s00224-008-9127-9openalex-snapshot
On the Autoreducibility of Functions
inferred← citeshttps://doi.org/10.1007/s00224-009-9172-zopenalex-snapshot
Planar and Grid Graph Reachability Problems
inferred← citeshttps://doi.org/10.1007/s11047-020-09814-2openalex-snapshot
Complexity-theoretic aspects of expanding cellular automata
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90087-1openalex-snapshot
Separation with the Ruzzo, Simon, and Tompa relativization implies Dspace(log n) ≠ Nspace(log n)
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90057-oopenalex-snapshot
An NL hierarchy
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00059-xopenalex-snapshot
Census techniques collapse space classes
inferred← citeshttps://doi.org/10.1016/0022-0000(81)90017-9openalex-snapshot
Some results on relativized deterministic and nondeterministic time hierarchies
inferred← citeshttps://doi.org/10.1016/0022-0000(84)90017-5openalex-snapshot
Consistency in nondeterministic storage
inferred← citeshttps://doi.org/10.1016/0022-0000(84)90066-7openalex-snapshot
Space-bounded hierarchies and probabilistic computations
inferred← citeshttps://doi.org/10.1016/0022-0000(88)90031-1openalex-snapshot
A measure of relativized space which is faithful with respect to depth
inferred← citeshttps://doi.org/10.1016/0022-0000(88)90034-7openalex-snapshot
Relativized alternation and space-bounded computation
inferred← citeshttps://doi.org/10.1016/0304-3975(78)90003-8openalex-snapshot
Log space machines with multiple oracle tapes
inferred← citeshttps://doi.org/10.1016/0304-3975(78)90048-8openalex-snapshot
On languages specified by relative acceptance
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90075-5openalex-snapshot
On eliminating nondeterminism from turing machines which use less than logarithm worktape space
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90049-1openalex-snapshot
More complicated questions about maxima and minima, and some closures of NP
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90025-4openalex-snapshot
Decompositions of nondeterministic reductions
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90168-hopenalex-snapshot
Positive relativizations for log space computability
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90191-jopenalex-snapshot
New developments in structural complexity theory
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90151-5openalex-snapshot
A survey of space complexity
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)00080-3openalex-snapshot
Computing functions with parallel queries to NP
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00031-qopenalex-snapshot
On quasilinear-time complexity theory
inferred← citeshttps://doi.org/10.1016/0890-5401(89)90012-6openalex-snapshot
The logarithmic alternation hierarchy collapses: AΣ2L = AΠ2L
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90075-dopenalex-snapshot
On truth-table reducibility to SAT
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90040-mopenalex-snapshot
Diagonalization, uniformity, and fixed-point theorems
inferred← citeshttps://doi.org/10.1016/j.cam.2004.03.003openalex-snapshot
The arbitrary order implicit multistep schemes of exponential fitting and their applications
inferred← citeshttps://doi.org/10.1016/j.ic.2017.04.011openalex-snapshot
Autoreducibility and mitoticity of logspace-complete sets for NP and other classes
inferred← citeshttps://doi.org/10.1016/j.jcss.2004.03.003openalex-snapshot
On the reducibility of sets inside NP to sets with low information content
inferred← citeshttps://doi.org/10.1016/j.jcss.2010.03.005openalex-snapshot
Space-efficient informational redundancy
inferred← citeshttps://doi.org/10.1016/j.jcss.2010.06.004openalex-snapshot
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.06.010openalex-snapshot
Complexity theory for splicing systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.03.023openalex-snapshot
Emptiness problems for integer circuits
inferred← citeshttps://doi.org/10.1016/s0019-9958(83)80058-8openalex-snapshot
Relativizations comparing NP and exponential time
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00147-5openalex-snapshot
On the complexity of data disjunctions
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00326-2openalex-snapshot
Alternating and empty alternating auxiliary stack automata
inferred← citeshttps://doi.org/10.1051/ita/1996300100011openalex-snapshot
Relationships among $PL$, $\#L$, and the determinant
inferred← citeshttps://doi.org/10.1093/jigpal/jzu027openalex-snapshot
Logics for complexity classes
inferred← citeshttps://doi.org/10.1109/ccc.1996.507666openalex-snapshot
Collapsing oracle-tape hierarchies
inferred← citeshttps://doi.org/10.1109/lics.1995.523245openalex-snapshot
Relativized logspace and generalized quantifiers over finite structures
inferred← citeshttps://doi.org/10.1109/sct.1988.5282openalex-snapshot
On truth-table reducibility to SAT and the difference hierarchy over NP
inferred← citeshttps://doi.org/10.1109/sct.1988.5286openalex-snapshot
Bounded query computations
inferred← citeshttps://doi.org/10.1109/sct.1990.113961openalex-snapshot
Width-bounded reducibility and binary search over complexity classes
inferred← citeshttps://doi.org/10.1109/sct.1990.113964openalex-snapshot
A very hard log space counting class
inferred← citeshttps://doi.org/10.1109/sct.1990.113967openalex-snapshot
Bounded arithmetic and computational complexity
inferred← citeshttps://doi.org/10.1109/sct.1991.160267openalex-snapshot
Adaptive logspace and depth-bounded reducibilities
inferred← citeshttps://doi.org/10.1109/sct.1992.215396openalex-snapshot
How hard are sparse sets?
inferred← citeshttps://doi.org/10.1109/sct.1993.336519openalex-snapshot
Computing functions with parallel queries to NP
inferred← citeshttps://doi.org/10.1109/sct.1993.336523openalex-snapshot
Complexity and structure in formal language theory
inferred← citeshttps://doi.org/10.1109/sct.1994.315797openalex-snapshot
Relationships among PL, #L, and the determinant
inferred← citeshttps://doi.org/10.1109/sfcs.1981.35openalex-snapshot
Parity, circuits, and the polynomial-time hierarchy
inferred← citeshttps://doi.org/10.1109/sfcs.1981.39openalex-snapshot
Relativizing time and space
inferred← citeshttps://doi.org/10.1109/sfcs.2002.1181992openalex-snapshot
Power from random strings
inferred← citeshttps://doi.org/10.1134/s0032946013030058openalex-snapshot
On expressive power of regular realizability problems
inferred← citeshttps://doi.org/10.1137/0207010openalex-snapshot
On Structure Preserving Reductions
inferred← citeshttps://doi.org/10.1137/0210008openalex-snapshot
Relative to a Random Oracle A , ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
inferred← citeshttps://doi.org/10.1137/0211048openalex-snapshot
Relativizing Time, Space, and Time-Space
inferred← citeshttps://doi.org/10.1137/0213030openalex-snapshot
Quantitative Relativizations of Complexity Classes
inferred← citeshttps://doi.org/10.1137/0216052openalex-snapshot
Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning $\omega $-Machines
inferred← citeshttps://doi.org/10.1137/0219058openalex-snapshot
Bounded Query Classes
inferred← citeshttps://doi.org/10.1137/050628994openalex-snapshot
Power from Random Strings
inferred← citeshttps://doi.org/10.1137/17m1145707openalex-snapshot
Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace
inferred← citeshttps://doi.org/10.1137/s0097539795295924openalex-snapshot
The PL Hierarchy Collapses
inferred← citeshttps://doi.org/10.1142/9789812794499_0031openalex-snapshot
Some Observations about Relativization of Space Bounded Computations
inferred← citeshttps://doi.org/10.1145/193820.193839openalex-snapshot
The quasilinear isomorphism challenge
inferred← citeshttps://doi.org/10.1145/237814.237834openalex-snapshot
The PL hierarchy collapses
inferred← citeshttps://doi.org/10.1145/2463664.2463669openalex-snapshot
The fine classification of conjunctive queries and parameterized logarithmic space complexity
inferred← citeshttps://doi.org/10.1145/2751316openalex-snapshot
The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space
inferred← citeshttps://doi.org/10.1145/3055399.3055414openalex-snapshot
Targeted pseudorandom generators, simulation advice generators, and derandomizing logspace
inferred← citeshttps://doi.org/10.1145/3132720openalex-snapshot
Canonizing Graphs of Bounded Tree Width in Logspace
inferred← citeshttps://doi.org/10.1145/322033.322037openalex-snapshot
Log Space Recognition and Translation of Parenthesis Languages
inferred← citeshttps://doi.org/10.1145/322290.322306openalex-snapshot
Relativized Questions Involving Probabilistic Algorithms
inferred← citeshttps://doi.org/10.1145/3349616openalex-snapshot
New Insights on the (Non-)Hardness of Circuit Minimization and Related Problems
inferred← citeshttps://doi.org/10.1145/3495009openalex-snapshot
The Complexity and Expressive Power of Limit Datalog
inferred← citeshttps://doi.org/10.1145/3519935.3520052openalex-snapshot
Computational complexity of the ground state energy density problem
inferred← citeshttps://doi.org/10.1145/382780.382783openalex-snapshot
The complexity of acyclic conjunctive queries
inferred← citeshttps://doi.org/10.1145/504192.504194openalex-snapshot
SIGACT News complexity theory column 32
inferred← citeshttps://doi.org/10.1145/507457.507465openalex-snapshot
SIGACT news complexity theory column 35
inferred← citeshttps://doi.org/10.1145/65780.65782openalex-snapshot
Figures of merit
inferred← citeshttps://doi.org/10.1145/800070.802194openalex-snapshot
Space-bounded hierarchies and probabilistic computations
inferred← citeshttps://doi.org/10.1145/800105.803408openalex-snapshot
Polynomial reducibilities and upward diagonalizations
inferred← citeshttps://doi.org/10.1145/800133.804363openalex-snapshot
Relativized questions involving probabilistic algorithms
inferred← citeshttps://doi.org/10.1145/990524.990530openalex-snapshot
On non-erasing oracle tapes in space bounded reducibility
inferred← citeshttps://doi.org/10.1305/ndjfl/1093635419openalex-snapshot
Complexity for type-$2$ relations.
inferred← citeshttps://doi.org/10.1609/aaai.v34i03.5676openalex-snapshot
Complexity and Expressive Power of Disjunction and Negation in Limit Datalog
inferred← citeshttps://doi.org/10.18154/rwth-2016-06688openalex-snapshot
Canonizing Graphs of Bounded Tree Width in Logspace
inferred← citeshttps://doi.org/10.2307/2275546openalex-snapshot
Relativized logspace and generalized quantifiers over finite ordered structures
inferred← citeshttps://doi.org/10.3233/fi-1996-253408openalex-snapshot
COMPLEXITY AND STRUCTURE IN FORMAL LANGUAGE THEORY
inferred← citeshttps://doi.org/10.3233/fi-2012-621openalex-snapshot
Unambiguous Functions in Logarithmic Space
inferred← citeshttps://doi.org/10.48550/arxiv.1204.5508openalex-snapshot
Relativizing Small Complexity Classes and their Theories
inferred← citeshttps://doi.org/10.48550/arxiv.1211.0606openalex-snapshot
On complexity of regular realizability problems
inferred← citeshttps://doi.org/10.51179/jipsbp.v2i1.374openalex-snapshot
Komunitas fitoplankton di Sungai Krueng Mane Aceh Utara
inferred← citeshttps://doi.org/10.70675/412a4333z5867z452fz9404z271549351d1dopenalex-snapshot
The limits of Nečiporuk's method and the power of programs over monoids taken from small varieties of finite monoids
inferred← citeshttps://doi.org/10.7282/00000006openalex-snapshot
Arithmetic circuit classes over Z m
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.