The following pages link to Computational Complexity (Q5320667):
Displaying 50 items.
- Immunity and pseudorandomness of context-free languages (Q653340) (← links)
- Convergence of random series and the rate of convergence of the strong law of large numbers in game-theoretic probability (Q655314) (← links)
- Consecutive ones property and PQ-trees for multisets: hardness of counting their orderings (Q690497) (← links)
- Collapsing and separating completeness notions under average-case and worst-case hypotheses (Q693053) (← links)
- The complexity of the list homomorphism problem for graphs (Q693060) (← links)
- The complexity of explicit constructions (Q693069) (← links)
- Avoiding simplicity is complex (Q693072) (← links)
- Instruction sequence processing operators (Q715042) (← links)
- Complexity classes of equivalence problems revisited (Q716333) (← links)
- Exact localisations of feedback sets (Q722200) (← links)
- On complete one-way functions (Q734307) (← links)
- Counting houses of Pareto optimal matchings in the house allocation problem (Q738845) (← links)
- \textsc{ReachFewL} = \textsc{ReachUL} (Q744612) (← links)
- Tradeoff lower lounds for stack machines (Q744614) (← links)
- A formalization of multi-tape Turing machines (Q744986) (← links)
- Absoluteness of subword inequality is undecidable (Q764348) (← links)
- Extension complexity of formal languages (Q778518) (← links)
- Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks (Q780266) (← links)
- The ghost in the radiation: robust encodings of the black hole interior (Q783839) (← links)
- Complexity of abstract argumentation under a claim-centric view (Q785236) (← links)
- Tropical varieties for exponential sums (Q785323) (← links)
- An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem (Q785628) (← links)
- Post-quench evolution of complexity and entanglement in a topological system (Q820388) (← links)
- Generic properties of a computational task predict human effort and performance (Q825138) (← links)
- Computational complexity of the landscape. I. (Q877685) (← links)
- Computational implications of reducing data to sufficient statistics (Q887274) (← links)
- Proof systems for planning under 0-approximation semantics (Q893736) (← links)
- Lower bounds on the sizes of integer programs without additional variables (Q896270) (← links)
- Theory of interaction (Q896903) (← links)
- PSPACE-completeness of majority automata networks (Q897867) (← links)
- The complexity of power indexes with graph restricted coalitions (Q898757) (← links)
- On the complexity of second-best abductive explanations (Q899129) (← links)
- Pseudorandom generators against advised context-free languages (Q899305) (← links)
- Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems (Q907199) (← links)
- Smallest formulas for the parity of \(2^k\) variables are essentially unique (Q974758) (← links)
- On the complexity of formulas in semantic programming (Q1615728) (← links)
- Circuit complexity in interacting QFTs and RG flows (Q1627371) (← links)
- The isoperimetric spectrum of finitely presented groups (Q1630589) (← links)
- On the limits of gate elimination (Q1635510) (← links)
- Computational complexity of the landscape. II: Cosmological considerations (Q1635657) (← links)
- Comparator circuits over finite bounded posets (Q1640992) (← links)
- Computational complexity of distance edge labeling (Q1647838) (← links)
- Analysis of FPTASes for the multi-objective shortest path problem (Q1652052) (← links)
- Reducing the size of combinatorial optimization problems using the operator vaccine by fuzzy selector with adaptive heuristics (Q1666410) (← links)
- Evolution of complexity following a quantum quench in free field theory (Q1671826) (← links)
- Towards a characterization of constant-factor approximable finite-valued CSPs (Q1671996) (← links)
- Sabidussi versus Hedetniemi for three variations of the chromatic number (Q1677539) (← links)
- Quantum one-way permutation over the finite field of two elements (Q1679363) (← links)
- On the complexity of input/output logic (Q1688711) (← links)
- Keeping logic in the trivium of computer science: a teaching perspective (Q1696593) (← links)