On the public citation graph
5. Computational complexity
0 signed · 100 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/bf00162114openalex-snapshot
Dimensions of election procedures: Analyses and comparisons
inferredcites →https://doi.org/10.1016/0022-0531(74)90073-8openalex-snapshot
An axiomatization of Borda's rule
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0165-4896(80)90007-4openalex-snapshot
Special domains and nonmanipulability
inferredcites →https://doi.org/10.1016/0304-4068(88)90022-5openalex-snapshot
Social choice and computational complexity
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1017/s0007123400003987openalex-snapshot
Computational Criteria for Voting Systems
inferredcites →https://doi.org/10.2307/1907651openalex-snapshot
A Set of Independent Necessary and Sufficient Conditions for Simple Majority Decision
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/0470018860.s00008openalex-snapshot
Computability and Computational Complexity
inferred← citeshttps://doi.org/10.1002/9780470050118.ecse097openalex-snapshot
Data Structures and Algorithms
inferred← citeshttps://doi.org/10.1002/rsa.20637openalex-snapshot
A combinatorial characterization of smooth LTCs and applications
inferred← citeshttps://doi.org/10.1007/11537311_42openalex-snapshot
The Complexity of Semilinear Problems in Succinct Representation
inferred← citeshttps://doi.org/10.1007/11549345_33openalex-snapshot
Goals in the Propositional Horn ⊃ Language Are Monotone Boolean Circuits
inferred← citeshttps://doi.org/10.1007/11560319_18openalex-snapshot
On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata
inferred← citeshttps://doi.org/10.1007/11785293_32openalex-snapshot
Minimum Membership Set Covering and the Consecutive Ones Property
inferred← citeshttps://doi.org/10.1007/11821069_59openalex-snapshot
Querying and Embedding Compressed Texts
inferred← citeshttps://doi.org/10.1007/3-540-44723-7_5openalex-snapshot
Issues in the Design of Negotiation Protocols for Logic-Based Agent Communication Languages
inferred← citeshttps://doi.org/10.1007/978-1-4757-3145-3_18openalex-snapshot
On the Efficient Approximability of “HARD” Problems: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-030-38565-1_5openalex-snapshot
A Symmetry-Based Explanation of the Main Idea Behind Chubanov’s Linear Programming Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-11584-9_2openalex-snapshot
A Boolean Game Based Modeling of Socio-Technical Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-20028-6_7openalex-snapshot
Unconventional Computing: Do We Dream Too Much?
inferred← citeshttps://doi.org/10.1007/978-3-319-24024-4_6openalex-snapshot
Weighted Boolean Formula Games
inferred← citeshttps://doi.org/10.1007/978-3-319-54981-1_6openalex-snapshot
Counting and Encoding Sets
inferred← citeshttps://doi.org/10.1007/978-3-319-73150-6_11openalex-snapshot
Quantum Ideas in Economics Beyond Quantum Econometrics
inferred← citeshttps://doi.org/10.1007/978-3-319-94418-0_27openalex-snapshot
Computing with SAT Oracles: Past, Present and Future
inferred← citeshttps://doi.org/10.1007/978-3-540-24741-8_28openalex-snapshot
XPath with Conditional Axis Relations
inferred← citeshttps://doi.org/10.1007/978-3-540-78137-0_12openalex-snapshot
On the Complexity of Computing Generators of Closed Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_10openalex-snapshot
Mean-Payoff Games and Propositional Proofs
inferred← citeshttps://doi.org/10.1007/978-3-642-16505-4_1openalex-snapshot
Resource Provisioning in SLA-Based Cluster Computing
inferred← citeshttps://doi.org/10.1007/978-3-642-22670-0_33openalex-snapshot
Randomness and Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-22685-4_5openalex-snapshot
Tight Bounds on Local Search to Approximate the Maximum Satisfiability Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-25661-5_27openalex-snapshot
A Polynomial-Time Algorithm for the Planar Quantified Integer Programming Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-44927-7_4openalex-snapshot
Reaching Your Goals without Spilling the Beans: Boolean Secrecy Games
inferred← citeshttps://doi.org/10.1007/978-94-009-2109-2_1openalex-snapshot
Multiperson Decision Making: A Selective Review
inferred← citeshttps://doi.org/10.1007/978-94-017-0487-8_17openalex-snapshot
What Can We Do “In Principle”?
inferred← citeshttps://doi.org/10.1007/bf01083171openalex-snapshot
On the difficulty of making social choices
inferred← citeshttps://doi.org/10.1007/bf01219774openalex-snapshot
The Lyapunov exponent and joint spectral radius of pairs of matrices are hard?when not impossible?to compute and to approximate
inferred← citeshttps://doi.org/10.1007/bf01585870openalex-snapshot
Approximability of flow shop scheduling
inferred← citeshttps://doi.org/10.1007/s00224-008-9160-8openalex-snapshot
Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?
inferred← citeshttps://doi.org/10.1007/s00236-007-0060-1openalex-snapshot
The complexity of satisfying constraints on databases of transactions
inferred← citeshttps://doi.org/10.1007/s00355-013-0735-1openalex-snapshot
The computational complexity of rationalizing Pareto optimal choice behavior
inferred← citeshttps://doi.org/10.1007/s00453-009-9384-2openalex-snapshot
Hybridizing Evolutionary Algorithms with Variable-Depth Search to Overcome Local Optima
inferred← citeshttps://doi.org/10.1007/s10107-002-0321-2openalex-snapshot
The merchant subtour problem
inferred← citeshttps://doi.org/10.1007/s10107-015-0958-2openalex-snapshot
A comment on “computational complexity of stochastic programming problems”
inferred← citeshttps://doi.org/10.1007/s10458-014-9271-3openalex-snapshot
$$\hbox {NB}^{3}$$ NB 3 : a multilateral negotiation algorithm for large, non-linear agreement spaces with limited time
inferred← citeshttps://doi.org/10.1007/s10618-019-00643-1openalex-snapshot
Extending inverse frequent itemsets mining to generate realistic datasets: complexity, accuracy and emerging applications
inferred← citeshttps://doi.org/10.1016/j.artint.2021.103470openalex-snapshot
Acceptance in incomplete argumentation frameworks
inferred← citeshttps://doi.org/10.1016/j.eswa.2011.09.122openalex-snapshot
On the formulation of competitive negotiations in Web applications: The Latin-American market case
inferred← citeshttps://doi.org/10.1016/j.ijar.2011.06.002openalex-snapshot
Estimating sample mean under interval uncertainty and constraint on sample variance
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00416-4openalex-snapshot
Hypothesis finding based on upward refinement of residue hypotheses
inferred← citeshttps://doi.org/10.1016/s0370-1573(02)00266-1openalex-snapshot
Fundamentals of quantum information theory
inferred← citeshttps://doi.org/10.1017/bsl.2015.25openalex-snapshot
THE CONSTRAINT SATISFACTION PROBLEM AND UNIVERSAL ALGEBRA
inferred← citeshttps://doi.org/10.1017/cbo9781107050884.007openalex-snapshot
Computability and Complexity
inferred← citeshttps://doi.org/10.1017/s1755020309990086openalex-snapshot
LOGICS FOR THE RELATIONAL SYLLOGISTIC
inferred← citeshttps://doi.org/10.1080/10556780500140177openalex-snapshot
Interpolating greedy and reluctant algorithms
inferred← citeshttps://doi.org/10.1080/13658816.2021.1893737openalex-snapshot
Vehicular crowd-sensing: a parametric routing algorithm to increase spatio-temporal road network coverage
inferred← citeshttps://doi.org/10.1080/18756891.2012.733216openalex-snapshot
Safety and Availability Checking for User Authorization Queries in RBAC
inferred← citeshttps://doi.org/10.1088/1367-2630/16/4/045006openalex-snapshot
Max 2-SAT with up to 108 qubits
inferred← citeshttps://doi.org/10.1093/philmat/nkz021openalex-snapshot
Computational Complexity Theory and the Philosophy of Mathematics†
inferred← citeshttps://doi.org/10.1109/90.650141openalex-snapshot
Scheduling nonuniform traffic in a packet-switching system with small propagation delay
inferred← citeshttps://doi.org/10.1109/ccc.2004.1313808openalex-snapshot
Solvable group isomorphism is (almost) in NP ∩ coNP
inferred← citeshttps://doi.org/10.1109/cdc.1998.761812openalex-snapshot
The COCO/sup DEF/ approach to COCOLOG logic control
inferred← citeshttps://doi.org/10.1109/focs.2004.28openalex-snapshot
Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game
inferred← citeshttps://doi.org/10.1109/infcom.1994.337559openalex-snapshot
Scheduling nonuniform traffic in a packet switching system with small propagation delay
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1302904openalex-snapshot
Parallel maximum weight bipartite matching algorithms for scheduling in input-queued switches
inferred← citeshttps://doi.org/10.1109/isda.2007.114openalex-snapshot
Evolutionary Algorithm for Large Scale Problems
inferred← citeshttps://doi.org/10.1109/ismvl.2009.47openalex-snapshot
Counting Problems and Clones of Functions
inferred← citeshttps://doi.org/10.1109/les.2010.2049983openalex-snapshot
Towards Fully Automatic Synthesis of Embedded Software
inferred← citeshttps://doi.org/10.1109/norbert.2014.6893885openalex-snapshot
Towards efficient algorithms for approximating a fuzzy relation by fuzzy rules: Case when “and”-and “or”-operation are distributive
inferred← citeshttps://doi.org/10.1109/pes.2003.1267390openalex-snapshot
Routing transmission lines via Steiner trees
inferred← citeshttps://doi.org/10.1109/sfcs.1981.51openalex-snapshot
Towards separating nondeterministic time from deterministic time
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492460openalex-snapshot
Counting bottlenecks to show monotone P≠NP
inferred← citeshttps://doi.org/10.1109/soca.2015.21openalex-snapshot
Building Models of Computation of Service-Oriented Software via Monitoring Performance Indicators (Short Paper)
inferred← citeshttps://doi.org/10.1109/tc.2013.47openalex-snapshot
Minimum Cost Blocking Problem in Multi-Path Wireless Routing Protocols
inferred← citeshttps://doi.org/10.1109/tdsc.2007.70225openalex-snapshot
Towards Formal Verification of Role-Based Access Control Policies
inferred← citeshttps://doi.org/10.1109/tmc.2010.142openalex-snapshot
Approximation Algorithms for a Link Scheduling Problem in Wireless Relay Networks with QoS Guarantee
inferred← citeshttps://doi.org/10.1109/tmc.2012.223openalex-snapshot
Frequency Domain Packet Scheduling with Stability Analysis for 3GPP LTE Uplink
inferred← citeshttps://doi.org/10.1142/s0218196710005741openalex-snapshot
THE ${\mathcal R}$- AND ${\mathcal L}$-ORDERS OF THE THOMPSON–HIGMAN MONOID Mk, 1 AND THEIR COMPLEXITY
inferred← citeshttps://doi.org/10.1145/1061318.1061323openalex-snapshot
Data exchange: getting to the core
inferred← citeshttps://doi.org/10.1145/1142351.1142357openalex-snapshot
The complexity of data exchange
inferred← citeshttps://doi.org/10.1145/254180.254190openalex-snapshot
A survey of approximately optimal solutions to some covering and packing problems
inferred← citeshttps://doi.org/10.1145/2632362.2632375openalex-snapshot
An improvement of the piggyback algorithm for parallel model checking
inferred← citeshttps://doi.org/10.1145/3500930openalex-snapshot
Incremental Graph Computations: Doable and Undoable
inferred← citeshttps://doi.org/10.1145/3563820openalex-snapshot
QCSP Monsters and the Demise of the Chen Conjecture
inferred← citeshttps://doi.org/10.1145/382780.382783openalex-snapshot
The complexity of acyclic conjunctive queries
inferred← citeshttps://doi.org/10.1201/b16871-7openalex-snapshot
Database Server Models for WMS and WFS Geographic Web Services
inferred← citeshttps://doi.org/10.1515/jiip.2010.007openalex-snapshot
A multi-step procedure for enriching limited two-dimensional acoustic far-field pattern measurements
inferred← citeshttps://doi.org/10.2200/s00355ed1v01y201107aim016openalex-snapshot
Computational Aspects of Cooperative Game Theory
inferred← citeshttps://doi.org/10.23919/ecc.2018.8550136openalex-snapshot
Embedded Mixed-Integer Quadratic optimization Using the OSQP Solver
inferred← citeshttps://doi.org/10.24072/pci.mcb.100183openalex-snapshot
Reprogramming of locally-monotone Boolean networks with BoNesis
inferred← citeshttps://doi.org/10.31871/wjrr.13.3.8openalex-snapshot
Review of the Solutions of the Clay Millennium Problem about P ≠ NP =EXPTIME
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.