https://scifaro.com/en/abs/reducing-sat-to-2-sat-0704.01082007-05-23 https://scifaro.com/zh/abs/reducing-sat-to-2-sat-0704.01082007-05-23 https://scifaro.com/en/abs/geometric-complexity-theory-v-on-deciding-nonvanishing-of-a-generalized-littlewood-richardson-coefficient-0704.02132012-09-28 https://scifaro.com/zh/abs/geometric-complexity-theory-v-on-deciding-nonvanishing-of-a-generalized-littlewood-richardson-coefficient-0704.02132012-09-28 https://scifaro.com/en/abs/geometric-complexity-theory-vi-the-flip-via-saturated-and-positive-integer-programming-in-representation-theory-and-algebraic-geometry-0704.02292009-01-22 https://scifaro.com/zh/abs/geometric-complexity-theory-vi-the-flip-via-saturated-and-positive-integer-programming-in-representation-theory-and-algebraic-geometry-0704.02292009-01-22 https://scifaro.com/en/abs/differential-recursion-and-differentially-algebraic-functions-0704.03012009-04-19 https://scifaro.com/zh/abs/differential-recursion-and-differentially-algebraic-functions-0704.03012009-04-19 https://scifaro.com/en/abs/the-complexity-of-hcp-in-digraps-with-degree-bound-two-0704.03092011-11-09 https://scifaro.com/zh/abs/the-complexity-of-hcp-in-digraps-with-degree-bound-two-0704.03092011-11-09 https://scifaro.com/en/abs/inapproximability-of-maximum-weighted-edge-biclique-and-its-applications-0704.04682009-03-23 https://scifaro.com/zh/abs/inapproximability-of-maximum-weighted-edge-biclique-and-its-applications-0704.04682009-03-23 https://scifaro.com/en/abs/on-the-kolmogorov-chaitin-complexity-for-short-sequences-0704.10432010-12-20 https://scifaro.com/zh/abs/on-the-kolmogorov-chaitin-complexity-for-short-sequences-0704.10432010-12-20 https://scifaro.com/en/abs/locally-decodable-codes-from-nice-subsets-of-finite-fields-and-prime-factors-of-mersenne-numbers-0704.16942007-05-23 https://scifaro.com/zh/abs/locally-decodable-codes-from-nice-subsets-of-finite-fields-and-prime-factors-of-mersenne-numbers-0704.16942007-05-23 https://scifaro.com/en/abs/bounded-pushdown-dimension-vs-lempel-ziv-information-density-0704.23862007-07-13 https://scifaro.com/zh/abs/bounded-pushdown-dimension-vs-lempel-ziv-information-density-0704.23862007-07-13 https://scifaro.com/en/abs/the-complexity-of-simple-stochastic-games-0704.27792007-05-23 https://scifaro.com/zh/abs/the-complexity-of-simple-stochastic-games-0704.27792007-05-23 https://scifaro.com/en/abs/the-complexity-of-weighted-boolean-csp-0704.36832009-02-23 https://scifaro.com/zh/abs/the-complexity-of-weighted-boolean-csp-0704.36832009-02-23 https://scifaro.com/en/abs/satisfiability-parsimoniously-reduces-to-the-tantrix-tm-rotation-puzzle-problem-0705.09152008-06-09 https://scifaro.com/zh/abs/satisfiability-parsimoniously-reduces-to-the-tantrix-tm-rotation-puzzle-problem-0705.09152008-06-09 https://scifaro.com/en/abs/does-p-np-0705.14422013-05-07 https://scifaro.com/en/abs/on-tractability-and-congruence-distributivity-0705.22292015-07-01 https://scifaro.com/zh/abs/on-tractability-and-congruence-distributivity-0705.22292015-07-01 https://scifaro.com/en/abs/vpspace-and-a-transfer-theorem-over-the-complex-field-0706.14772007-06-12 https://scifaro.com/zh/abs/vpspace-and-a-transfer-theorem-over-the-complex-field-0706.14772007-06-12 https://scifaro.com/en/abs/critique-of-feinstein-s-proof-that-p-is-not-equal-to-np-0706.20352007-06-15 https://scifaro.com/zh/abs/critique-of-feinstein-s-proof-that-p-is-not-equal-to-np-0706.20352007-06-15 https://scifaro.com/en/abs/on-canonical-forms-of-complete-problems-via-first-order-projections-0706.34122007-06-26 https://scifaro.com/zh/abs/on-canonical-forms-of-complete-problems-via-first-order-projections-0706.34122007-06-26 https://scifaro.com/en/abs/np-by-means-of-lifts-and-shadows-0706.34592007-06-27 https://scifaro.com/zh/abs/np-by-means-of-lifts-and-shadows-0706.34592007-06-27 https://scifaro.com/en/abs/assisted-problem-solving-and-decompositions-of-finite-automata-0707.04302007-07-04 https://scifaro.com/zh/abs/assisted-problem-solving-and-decompositions-of-finite-automata-0707.04302007-07-04 https://scifaro.com/en/abs/expressing-an-np-complete-problem-as-the-solvability-of-a-polynomial-equation-0707.11762011-11-10 https://scifaro.com/zh/abs/expressing-an-np-complete-problem-as-the-solvability-of-a-polynomial-equation-0707.11762011-11-10 https://scifaro.com/en/abs/report-on-generic-case-complexity-0707.13642007-07-11 https://scifaro.com/zh/abs/report-on-generic-case-complexity-0707.13642007-07-11 https://scifaro.com/en/abs/complexity-of-propositional-proofs-under-a-promise-0707.42552010-04-19 https://scifaro.com/zh/abs/complexity-of-propositional-proofs-under-a-promise-0707.42552010-04-19 https://scifaro.com/en/abs/small-weakly-universal-turing-machines-0707.44892007-08-01 https://scifaro.com/zh/abs/small-weakly-universal-turing-machines-0707.44892007-08-01 https://scifaro.com/en/abs/on-the-complexity-of-the-interlace-polynomial-0707.45652008-04-16 https://scifaro.com/zh/abs/on-the-complexity-of-the-interlace-polynomial-0707.45652008-04-16 https://scifaro.com/en/abs/resolution-over-linear-equations-and-multilinear-proofs-0708.15292010-04-19 https://scifaro.com/zh/abs/resolution-over-linear-equations-and-multilinear-proofs-0708.15292010-04-19 https://scifaro.com/en/abs/attribute-estimation-and-testing-quasi-symmetry-0708.21052007-08-17 https://scifaro.com/zh/abs/attribute-estimation-and-testing-quasi-symmetry-0708.21052007-08-17 https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-computing-the-permanent-in-gf-3-q-0708.35682007-08-28 https://scifaro.com/en/abs/graph-isomorphism-is-pspace-complete-0708.40752007-08-31 https://scifaro.com/zh/abs/graph-isomorphism-is-pspace-complete-0708.40752007-08-31 https://scifaro.com/en/abs/relationship-between-clustering-and-algorithmic-phase-transitions-in-the-random-k-xorsat-model-and-its-np-complete-extensions-0709.03672009-11-13 https://scifaro.com/zh/abs/relationship-between-clustering-and-algorithmic-phase-transitions-in-the-random-k-xorsat-model-and-its-np-complete-extensions-0709.03672009-11-13 https://scifaro.com/en/abs/on-the-complexity-of-protein-local-structure-alignment-under-the-discrete-fr-echet-distance-0709.06772007-09-06 https://scifaro.com/zh/abs/on-the-complexity-of-protein-local-structure-alignment-under-the-discrete-fr-echet-distance-0709.06772007-09-06 https://scifaro.com/en/abs/geometric-complexity-theory-introduction-0709.07462014-08-02 https://scifaro.com/zh/abs/geometric-complexity-theory-introduction-0709.07462014-08-02 https://scifaro.com/en/abs/on-p-vs-np-geometric-complexity-theory-and-the-flip-i-a-high-level-view-0709.07482007-09-07 https://scifaro.com/zh/abs/on-p-vs-np-geometric-complexity-theory-and-the-flip-i-a-high-level-view-0709.07482007-09-07 https://scifaro.com/en/abs/geometric-complexity-theory-vii-nonstandard-quantum-group-for-the-plethysm-problem-0709.07492008-09-01 https://scifaro.com/zh/abs/geometric-complexity-theory-vii-nonstandard-quantum-group-for-the-plethysm-problem-0709.07492008-09-01 https://scifaro.com/en/abs/geometric-complexity-theory-viii-on-canonical-bases-for-the-nonstandard-quantum-groups-0709.07512008-09-01 https://scifaro.com/zh/abs/geometric-complexity-theory-viii-on-canonical-bases-for-the-nonstandard-quantum-groups-0709.07512008-09-01 https://scifaro.com/en/abs/liquid-state-machines-in-adbiatic-quantum-computers-for-general-computation-0709.08832011-07-11 https://scifaro.com/en/abs/on-the-proof-complexity-of-deep-inference-0709.12012009-04-19 https://scifaro.com/zh/abs/on-the-proof-complexity-of-deep-inference-0709.12012009-04-19 https://scifaro.com/en/abs/the-p-versus-np-brief-0709.12072009-05-01 https://scifaro.com/zh/abs/the-p-versus-np-brief-0709.12072009-05-01 https://scifaro.com/en/abs/deciding-unambiguity-and-sequentiality-starting-from-a-finitely-ambiguous-max-plus-automaton-0709.41172007-09-27 https://scifaro.com/zh/abs/deciding-unambiguity-and-sequentiality-starting-from-a-finitely-ambiguous-max-plus-automaton-0709.41172007-09-27 https://scifaro.com/en/abs/the-complexity-of-nonrepetitive-edge-coloring-of-graphs-0709.44972007-12-07 https://scifaro.com/zh/abs/the-complexity-of-nonrepetitive-edge-coloring-of-graphs-0709.44972007-12-07 https://scifaro.com/en/abs/interpolation-in-valiant-s-theory-0710.03602007-10-02 https://scifaro.com/zh/abs/interpolation-in-valiant-s-theory-0710.03602007-10-02 https://scifaro.com/en/abs/on-the-satisfiability-threshold-and-clustering-of-solutions-of-random-3-sat-formulas-0710.08052008-09-01 https://scifaro.com/zh/abs/on-the-satisfiability-threshold-and-clustering-of-solutions-of-random-3-sat-formulas-0710.08052008-09-01 https://scifaro.com/en/abs/approximation-algorithms-and-hardness-for-domination-with-propagation-0710.21392007-10-12 https://scifaro.com/zh/abs/approximation-algorithms-and-hardness-for-domination-with-propagation-0710.21392007-10-12 https://scifaro.com/en/abs/probabilistic-communication-complexity-over-the-reals-0710.27322007-10-16 https://scifaro.com/zh/abs/probabilistic-communication-complexity-over-the-reals-0710.27322007-10-16 https://scifaro.com/en/abs/p-matrix-recognition-is-co-np-complete-0710.35192007-10-19 https://scifaro.com/en/abs/random-subcubes-as-a-toy-model-for-constraint-satisfaction-problems-0710.38042008-05-23 https://scifaro.com/zh/abs/random-subcubes-as-a-toy-model-for-constraint-satisfaction-problems-0710.38042008-05-23 https://scifaro.com/en/abs/on-a-new-type-of-information-processing-for-efficient-management-of-complex-systems-0710.39612007-10-23 https://scifaro.com/zh/abs/on-a-new-type-of-information-processing-for-efficient-management-of-complex-systems-0710.39612007-10-23 https://scifaro.com/en/abs/an-approximation-trichotomy-for-boolean-csp-0710.42722009-07-23 https://scifaro.com/zh/abs/an-approximation-trichotomy-for-boolean-csp-0710.42722009-07-23 https://scifaro.com/en/abs/a-numerical-algorithm-for-zero-counting-i-complexity-and-accuracy-0710.45082010-07-12 https://scifaro.com/en/abs/energy-bounds-for-fault-tolerant-nanoscale-designs-0710.46802011-11-09 https://scifaro.com/en/abs/phase-transitions-and-computational-difficulty-in-random-constraint-satisfaction-problems-0711.01102008-02-04 https://scifaro.com/zh/abs/phase-transitions-and-computational-difficulty-in-random-constraint-satisfaction-problems-0711.01102008-02-04 https://scifaro.com/en/abs/considerations-on-p-vs-np-0711.11772007-11-09 https://scifaro.com/zh/abs/considerations-on-p-vs-np-0711.11772007-11-09 https://scifaro.com/en/abs/an-analysis-of-a-random-algorithm-for-estimating-all-the-matchings-0711.17232007-11-15 https://scifaro.com/zh/abs/an-analysis-of-a-random-algorithm-for-estimating-all-the-matchings-0711.17232007-11-15 https://scifaro.com/en/abs/the-three-color-and-two-color-tantrix-tm-rotation-puzzle-problems-are-np-complete-via-parsimonious-reductions-0711.18272008-06-09 https://scifaro.com/zh/abs/the-three-color-and-two-color-tantrix-tm-rotation-puzzle-problems-are-np-complete-via-parsimonious-reductions-0711.18272008-06-09 https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-graph-isomorphism-0711.20102022-10-18 https://scifaro.com/zh/abs/a-polynomial-time-algorithm-for-graph-isomorphism-0711.20102022-10-18 https://scifaro.com/en/abs/recognizing-members-of-the-tournament-equilibrium-set-is-np-hard-0711.29612015-02-06 https://scifaro.com/en/abs/detecting-palindromes-patterns-and-borders-in-regular-languages-0711.31832009-04-14 https://scifaro.com/en/abs/representation-and-measure-of-structural-information-0711.45082008-06-12 https://scifaro.com/en/abs/on-the-accepting-power-of-2-tape-b-uchi-automata-0712.01652007-12-04 https://scifaro.com/en/abs/a-spectral-approach-to-analyzing-belief-propagation-for-3-coloring-0712.01712017-11-17 https://scifaro.com/en/abs/reconstruction-of-markov-random-fields-from-samples-some-easy-observations-and-algorithms-0712.14022010-03-09 https://scifaro.com/en/abs/hard-constraint-satisfaction-problems-have-hard-gaps-at-location-1-0712.15322007-12-11 https://scifaro.com/en/abs/phase-transition-and-computational-complexity-in-a-stochastic-prime-number-generator-0712.31372009-11-13 https://scifaro.com/en/abs/on-exponential-time-lower-bound-of-knapsack-under-backtracking-0712.33482007-12-25 https://scifaro.com/en/abs/disjointness-is-hard-in-the-multi-party-number-on-the-forehead-model-0712.42792009-06-09 https://scifaro.com/en/abs/on-the-graph-isomorphism-problem-0801.03982008-01-10 https://scifaro.com/en/abs/analysis-and-counterexamples-regarding-yatsenko-s-polynomial-time-algorithm-for-solving-the-traveling-salesman-problem-0801.04742008-01-04 https://scifaro.com/en/abs/new-results-on-noncommutative-and-commutative-polynomial-identity-testing-0801.05142008-01-04 https://scifaro.com/en/abs/alternating-hierarchies-for-time-space-tradeoffs-0801.13072008-01-09 https://scifaro.com/en/abs/two-graph-isomorphism-polytopes-0801.14102009-08-22 https://scifaro.com/en/abs/a-family-of-counter-examples-to-an-approach-to-graph-isomorphism-0801.17662008-01-14 https://scifaro.com/en/abs/an-omega-power-of-a-context-free-language-which-is-borel-above-delta-0-omega-0801.17832008-09-10 https://scifaro.com/en/abs/multiparty-communication-complexity-of-disjointness-0801.36242008-02-21 https://scifaro.com/en/abs/merkle-s-key-agreement-protocol-is-optimal-an-o-n-2-attack-on-any-key-agreement-from-random-oracles-0801.36692019-04-02 https://scifaro.com/en/abs/lower-bounds-on-signatures-from-symmetric-primitives-0801.36802019-04-02 https://scifaro.com/en/abs/characterization-of-the-vertices-and-extreme-directions-of-the-negative-cycles-polyhedron-and-hardness-of-generating-vertices-of-0-1-polyhedra-0801.37902008-04-28 https://scifaro.com/en/abs/dichotomy-results-for-fixed-point-existence-problems-for-boolean-dynamical-systems-0801.38022008-12-01 https://scifaro.com/en/abs/on-the-scaling-window-of-model-rb-0801.38712008-01-28 https://scifaro.com/en/abs/on-the-continuity-set-of-an-omega-rational-function-0801.39122008-01-28 https://scifaro.com/en/abs/the-complexity-of-power-index-comparison-0801.45852008-01-31 https://scifaro.com/en/abs/breaking-one-round-key-agreement-protocols-in-the-random-oracle-model-0801.47142009-03-24 https://scifaro.com/en/abs/non-deterministic-communication-complexity-of-regular-languages-0801.47772008-02-01 https://scifaro.com/en/abs/on-the-double-coset-membership-problem-for-permutation-groups-0801.49112008-02-01 https://scifaro.com/en/abs/zero-knowledge-proofs-of-the-conjugacy-for-permutation-groups-0801.49172008-02-01 https://scifaro.com/en/abs/solving-the-maximum-agreement-subtree-and-the-maximum-compatible-tree-problems-on-many-bounded-degree-trees-0802.00242008-07-10 https://scifaro.com/en/abs/on-the-complexity-of-finding-gapped-motifs-0802.03142010-09-02 https://scifaro.com/en/abs/approximability-distance-in-the-space-of-h-colourability-problems-0802.04232008-02-05 https://scifaro.com/en/abs/3-way-composition-of-weighted-finite-state-transducers-0802.14652008-02-22 https://scifaro.com/en/abs/longest-paths-in-planar-dags-in-unambiguous-logspace-0802.16992008-02-13 https://scifaro.com/en/abs/sat-has-no-wizards-0802.17902008-02-14 https://scifaro.com/en/abs/a-review-of-the-statistical-mechanics-approach-to-random-optimization-problems-0802.18292009-01-08 https://scifaro.com/en/abs/on-the-complexity-of-elementary-modal-logics-0802.18842008-02-14 https://scifaro.com/en/abs/kolmogorov-complexity-theory-over-the-reals-0802.20272008-03-28 https://scifaro.com/en/abs/approximation-resistant-predicates-from-pairwise-independence-0802.23002008-02-19 https://scifaro.com/en/abs/fixed-point-and-aperiodic-tilings-0802.24322010-01-27 https://scifaro.com/en/abs/on-the-approximability-of-the-maximum-agreement-subtree-and-maximum-compatible-tree-problems-0802.27362010-09-02 https://scifaro.com/en/abs/equilibria-fixed-points-and-complexity-classes-0802.28312008-02-21 https://scifaro.com/en/abs/limit-complexities-revisited-0802.28332008-02-21 https://scifaro.com/en/abs/sublinear-communication-protocols-for-multi-party-pointer-jumping-and-a-related-lower-bound-0802.28432008-02-21 https://scifaro.com/en/abs/lower-bounds-for-adaptive-linearity-tests-0802.28572008-02-21 https://scifaro.com/en/abs/a-theory-for-valiant-s-matchcircuits-extended-abstract-0802.28602008-02-21 https://scifaro.com/en/abs/new-combinatorial-complete-one-way-functions-0802.28632008-02-21 https://scifaro.com/en/abs/efficient-algorithms-for-membership-in-boolean-hierarchies-of-regular-languages-0802.28682008-02-21 https://scifaro.com/en/abs/succinctness-of-the-complement-and-intersection-of-regular-expressions-0802.28692008-02-21 https://scifaro.com/en/abs/general-algorithms-for-testing-the-ambiguity-of-finite-automata-0802.32542008-02-25 https://scifaro.com/en/abs/generic-case-complexity-and-one-way-functions-0802.37342008-02-27 https://scifaro.com/en/abs/separating-nof-communication-complexity-classes-rp-and-np-0802.38602008-02-27 https://scifaro.com/en/abs/an-algorithmic-complexity-interpretation-of-lin-s-third-law-of-information-theory-0802.40892015-05-13 https://scifaro.com/en/abs/curves-that-must-be-retraced-0802.43122009-05-19 https://scifaro.com/en/abs/a-compact-topology-for-sand-automata-0803.00552008-12-18 https://scifaro.com/en/abs/towards-an-optimal-separation-of-space-and-length-in-resolution-0803.06612009-09-29 https://scifaro.com/en/abs/robust-stochastic-chemical-reaction-networks-and-bounded-tau-leaping-0803.10302009-01-28 https://scifaro.com/en/abs/self-assembly-of-discrete-self-similar-fractals-0803.16722008-04-26 https://scifaro.com/en/abs/product-theorems-via-semidefinite-programming-0803.42062008-05-01 https://scifaro.com/en/abs/common-permutation-problem-0803.42612008-04-01 https://scifaro.com/en/abs/a-dual-polynomial-for-or-0803.45162008-04-01 https://scifaro.com/en/abs/on-the-approximability-of-minmax-regret-network-optimization-problems-0804.03962008-10-24 https://scifaro.com/en/abs/derandomizing-the-isolation-lemma-and-lower-bounds-for-circuit-size-0804.09572008-04-24 https://scifaro.com/en/abs/p-is-a-proper-subset-of-np-0804.10792008-09-07 https://scifaro.com/en/abs/adversary-lower-bounds-for-nonadaptive-quantum-algorithms-0804.14402008-12-18 https://scifaro.com/en/abs/a-complexity-dichotomy-for-partition-functions-with-mixed-signs-0804.19322009-05-05 https://scifaro.com/en/abs/schemes-for-deterministic-polynomial-factoring-0804.19742008-04-15 https://scifaro.com/en/abs/universal-quantum-circuits-0804.24292008-04-16 https://scifaro.com/en/abs/a-critique-of-a-polynomial-time-sat-solver-devised-by-sergey-gubin-0804.26992008-04-18 https://scifaro.com/en/abs/generalized-modal-satisfiability-0804.27292008-12-18 https://scifaro.com/en/abs/combinatorial-invariants-for-graph-isomorphism-problem-0804.36152008-05-19 https://scifaro.com/en/abs/on-computing-the-shadows-and-slices-of-polytopes-0804.41502012-11-26 https://scifaro.com/en/abs/lattice-problems-gauge-functions-and-parameterized-algorithms-0804.47442008-05-01 https://scifaro.com/en/abs/analysis-of-the-deterministic-polynomial-time-solvability-of-the-0-1-knapsack-problem-0805.05172008-09-07 https://scifaro.com/en/abs/decomposition-techniques-for-subgraph-matching-0805.10302008-12-18 https://scifaro.com/en/abs/almost-natural-proofs-0805.13852009-03-30 https://scifaro.com/en/abs/efficiently-testing-sparse-gf-2-polynomials-0805.17652008-05-14 https://scifaro.com/en/abs/communication-lower-bounds-using-dual-polynomials-0805.21352008-05-15 https://scifaro.com/en/abs/independence-of-p-vs-np-in-regards-to-oracle-relativizations-0805.21702008-09-04 https://scifaro.com/en/abs/a-new-structural-property-of-sat-0805.30582008-05-21 https://scifaro.com/en/abs/report-on-article-the-travelling-salesman-problem-a-linear-programming-formulation-0805.47182008-06-02 https://scifaro.com/en/abs/the-mixing-time-of-glauber-dynamics-for-colouring-regular-trees-0806.09212008-06-06 https://scifaro.com/en/abs/3-connected-planar-graph-isomorphism-is-in-log-space-0806.10412008-09-16 https://scifaro.com/en/abs/frequency-of-correctness-versus-average-case-polynomial-time-and-generalized-juntas-0806.25552008-06-17 https://scifaro.com/en/abs/algorithmic-problem-complexity-0807.06722008-07-08 https://scifaro.com/en/abs/quantum-query-complexity-of-multilinear-identity-testing-0807.14122008-07-10 https://scifaro.com/en/abs/branching-proofs-of-infeasibility-in-low-density-subset-sum-problems-0808.00232008-08-10 https://scifaro.com/en/abs/model-checking-positive-equality-free-fo-boolean-structures-and-digraphs-of-size-three-0808.06472008-08-06 https://scifaro.com/en/abs/graham-s-schedules-and-the-number-partition-problem-0808.11192008-08-11 https://scifaro.com/en/abs/on-bounded-integer-programming-0808.13642008-08-12 https://scifaro.com/en/abs/characterization-of-any-non-linear-boolean-function-using-a-set-of-linear-operators-0808.16412008-08-13 https://scifaro.com/en/abs/decision-problems-for-convex-languages-0808.19282009-04-14 https://scifaro.com/en/abs/every-computably-enumerable-random-real-is-provably-computably-enumerable-random-0808.22202009-06-08 https://scifaro.com/en/abs/on-nfas-where-all-states-are-final-initial-or-both-0808.24172009-07-03 https://scifaro.com/en/abs/multitask-efficiencies-in-the-decision-tree-model-0808.26622016-11-17 https://scifaro.com/en/abs/analysis-of-the-postulates-produced-by-karp-s-theorem-0808.32222008-09-03 https://scifaro.com/en/abs/the-complexity-of-reasoning-for-fragments-of-default-logic-0808.38842010-08-24 https://scifaro.com/en/abs/swapping-lemmas-for-regular-and-context-free-languages-0808.41222009-03-05 https://scifaro.com/en/abs/approximating-transitivity-in-directed-networks-0809.01882008-09-02 https://scifaro.com/en/abs/linear-kernelizations-for-restricted-3-hitting-set-problems-0809.02572008-09-20 https://scifaro.com/en/abs/instruction-sequences-and-non-uniform-complexity-theory-0809.03522010-07-15 https://scifaro.com/en/abs/the-complexity-of-counting-solutions-to-generalised-satisfiability-problems-modulo-k-0809.18362008-09-11 https://scifaro.com/en/abs/an-approximation-algorithm-for-approximation-rank-0809.20932021-03-09 https://scifaro.com/en/abs/a-log-space-algorithm-for-canonization-of-planar-graphs-0809.23192009-01-30 https://scifaro.com/en/abs/depth-as-randomness-deficiency-0809.25462008-09-16 https://scifaro.com/en/abs/on-time-bounded-incompressibility-of-compressible-strings-and-sequences-0809.29652009-08-11 https://scifaro.com/en/abs/improved-monotone-circuit-depth-upper-bound-for-directed-graph-reachability-0809.36142008-09-23 https://scifaro.com/en/abs/complexity-classes-as-mathematical-axioms-0810.00332009-06-17 https://scifaro.com/en/abs/a-simple-constant-probability-rp-reduction-from-np-to-parity-p-0810.10182008-10-07 https://scifaro.com/en/abs/1-25-approximation-algorithm-for-the-steiner-tree-problem-with-distances-one-and-two-0810.18512008-10-13 https://scifaro.com/en/abs/ogden-s-lemma-for-regular-tree-languages-0810.42492008-10-24 https://scifaro.com/en/abs/new-constructions-for-query-efficient-locally-decodable-codes-of-subexponential-length-0810.45762011-09-29 https://scifaro.com/en/abs/p-is-not-equal-to-np-0810.50562009-07-13 https://scifaro.com/en/abs/a-complexity-dichotomy-for-hypergraph-partition-functions-0811.00372010-01-04 https://scifaro.com/en/abs/solving-the-p-np-problem-under-intrinsic-uncertainty-0811.04632008-11-10 https://scifaro.com/en/abs/algorithmic-complexity-and-randomness-in-elastic-solids-0811.06232008-11-06 https://scifaro.com/en/abs/a-note-on-the-inversion-complexity-of-boolean-functions-in-boolean-formulas-0811.06992008-11-06 https://scifaro.com/en/abs/the-complexity-of-propositional-implication-0811.09592010-06-02 https://scifaro.com/en/abs/modular-difference-logic-is-hard-0811.09872008-11-07 https://scifaro.com/en/abs/symbolic-backwards-reachability-analysis-for-higher-order-pushdown-systems-0811.11032015-07-01 https://scifaro.com/en/abs/applying-practice-to-theory-0811.13052008-11-11 https://scifaro.com/en/abs/a-divergence-formula-for-randomness-and-dimension-0811.18252008-11-13 https://scifaro.com/en/abs/on-models-of-a-nondeterministic-computation-0811.25862008-11-18 https://scifaro.com/en/abs/geometric-properties-of-satisfying-assignments-of-random-epsilon-1-in-k-sat-0811.31162010-03-18 https://scifaro.com/en/abs/an-almost-optimal-rank-bound-for-depth-3-identities-0811.31612008-11-20 https://scifaro.com/en/abs/trading-grh-for-algebra-algorithms-for-factoring-polynomials-and-related-structures-0811.31652009-02-08 https://scifaro.com/en/abs/highly-undecidable-problems-about-recognizability-by-tiling-systems-0811.37042009-08-04 https://scifaro.com/en/abs/real-computation-with-least-discrete-advice-a-complexity-theory-of-nonuniform-computability-0811.37822009-09-02 https://scifaro.com/en/abs/on-the-complexity-of-matroid-isomorphism-problem-0811.38592008-11-25 https://scifaro.com/en/abs/extractors-and-an-efficient-variant-of-muchnik-s-theorem-0811.39582008-11-25 https://scifaro.com/en/abs/a-polytime-proof-of-correctness-of-the-rabin-miller-algorithm-from-fermat-s-little-theorem-0811.39592008-11-25 https://scifaro.com/en/abs/dichotomy-results-for-fixed-point-counting-in-boolean-dynamical-systems-0812.02832008-12-02 https://scifaro.com/en/abs/hierarchy-and-equivalence-of-multi-letter-quantum-finite-automata-0812.08522010-03-10 https://scifaro.com/en/abs/polynomial-hierarchy-betti-numbers-and-a-real-analogue-of-toda-s-theorem-0812.12002011-02-02 https://scifaro.com/en/abs/unary-finite-automata-vs-arithmetic-progressions-0812.12912008-12-09 https://scifaro.com/en/abs/an-extension-of-the-permutation-group-enumeration-technique-collapse-of-the-polynomial-hierarchy-mathbf-np-p-0812.13852017-10-31 https://scifaro.com/en/abs/scarf-is-ppad-complete-0812.16012009-05-04 https://scifaro.com/en/abs/dynamic-complexity-of-formal-languages-0812.19152008-12-11 https://scifaro.com/en/abs/a-factor-3-2-approximation-for-generalized-steiner-tree-problem-with-distances-one-and-two-0812.21372008-12-12 https://scifaro.com/en/abs/two-conjectures-such-that-the-proof-of-any-one-of-them-will-lead-to-the-proof-that-p-np-0812.32142008-12-31 https://scifaro.com/en/abs/a-randomized-polynomial-time-algorithm-for-the-spanning-hypertree-problem-on-3-uniform-hypergraphs-0812.35932008-12-19 https://scifaro.com/en/abs/graph-field-automata-0812.40092015-12-08 https://scifaro.com/en/abs/the-complexity-of-weighted-boolean-csp-with-mixed-signs-0812.41712009-06-03 https://scifaro.com/en/abs/randomized-self-assembly-for-exact-shapes-0901.18492015-03-13 https://scifaro.com/en/abs/beyond-language-equivalence-on-visibly-pushdown-automata-0901.20682015-07-01 https://scifaro.com/en/abs/language-recognition-by-generalized-quantum-finite-automata-with-unbounded-error-abstract-poster-0901.27032010-09-20 https://scifaro.com/en/abs/measuring-communication-complexity-using-instance-complexity-with-oracles-0901.29062009-01-20 https://scifaro.com/en/abs/the-complexity-of-computing-minimal-unidirectional-covering-sets-0901.36922015-02-06 https://scifaro.com/en/abs/closures-in-formal-languages-and-kuratowski-s-theorem-0901.37612009-04-15 https://scifaro.com/en/abs/closures-in-formal-languages-concatenation-separation-and-algorithms-0901.37632009-04-12 https://scifaro.com/en/abs/using-kolmogorov-complexity-for-understanding-some-limitations-on-steganography-0901.40232009-01-27 https://scifaro.com/en/abs/bounds-on-the-size-of-small-depth-circuits-for-approximating-majority-0902.00472009-02-03 https://scifaro.com/en/abs/immunity-and-pseudorandomness-of-context-free-languages-0902.02612011-09-20 https://scifaro.com/en/abs/non-monotone-submodular-maximization-under-matroid-and-knapsack-constraints-0902.03532009-02-03 https://scifaro.com/en/abs/finding-exact-minimal-polynomial-by-approximations-0902.08282009-02-06 https://scifaro.com/en/abs/kolmogorov-complexity-and-solovay-functions-0902.10412009-02-10 https://scifaro.com/en/abs/hardness-and-algorithms-for-rainbow-connectivity-0902.12552009-02-17 https://scifaro.com/en/abs/enumerating-homomorphisms-0902.12562009-02-10 https://scifaro.com/en/abs/asymptotically-optimal-lower-bounds-on-the-nih-multi-party-information-0902.16092009-02-11 https://scifaro.com/en/abs/even-faster-exact-bandwidth-0902.16612009-02-11 https://scifaro.com/en/abs/polynomial-kernelizations-for-min-f-pi-1-and-max-np-0902.18352015-03-13 https://scifaro.com/en/abs/a-superpolynomial-lower-bound-on-the-size-of-uniform-non-constant-depth-threshold-circuits-for-the-permanent-0902.18662009-02-12 https://scifaro.com/en/abs/languages-recognized-by-nondeterministic-quantum-finite-automata-0902.20812014-01-29 https://scifaro.com/en/abs/extracting-the-kolmogorov-complexity-of-strings-and-sequences-from-sources-with-limited-independence-0902.21412009-02-13 https://scifaro.com/en/abs/a-stronger-lp-bound-for-formula-size-lower-bounds-via-clique-constraints-0902.21462009-02-13 https://scifaro.com/en/abs/a-generalization-of-nemhauser-and-trotter-s-local-optimization-theorem-0902.21492009-02-13 https://scifaro.com/en/abs/a-dichotomy-theorem-for-polynomial-evaluation-0902.23002009-12-15 https://scifaro.com/en/abs/a-multi-round-communication-lower-bound-for-gap-hamming-and-some-consequences-0902.23992009-02-17 https://scifaro.com/en/abs/group-theoretic-partial-matrix-multiplication-0902.24072009-02-17 https://scifaro.com/en/abs/a-time-lower-bound-for-multiple-nucleation-on-a-surface-0902.24222009-08-04 https://scifaro.com/en/abs/a-unified-algorithm-for-accelerating-edit-distance-computation-via-text-compression-0902.26492009-02-17 https://scifaro.com/en/abs/inseparability-and-strong-hypotheses-for-disjoint-np-pairs-0902.26742010-02-03 https://scifaro.com/en/abs/the-one-way-communication-complexity-of-group-membership-0902.31752021-10-05 https://scifaro.com/en/abs/bounded-independence-fools-halfspaces-0902.37572009-02-24 https://scifaro.com/en/abs/succinctness-of-two-way-probabilistic-and-quantum-finite-automata-0903.00502014-01-29 https://scifaro.com/en/abs/tetravex-is-np-complete-0903.11472012-04-18 https://scifaro.com/en/abs/on-tiered-small-jump-operators-0903.24102015-07-01 https://scifaro.com/en/abs/on-the-computational-complexity-of-satisfiability-solving-for-string-theories-0903.28252009-03-17 https://scifaro.com/en/abs/polylog-space-compression-pushdown-compression-and-lempel-ziv-are-incomparable-0903.41012009-03-25 https://scifaro.com/en/abs/graph-homomorphisms-with-complex-values-a-dichotomy-theorem-0903.47282011-10-10 https://scifaro.com/en/abs/quasipolynomial-normalisation-in-deep-inference-via-atomic-flows-and-threshold-formulae-0903.53922017-01-11 https://scifaro.com/en/abs/holographic-algorithms-without-matchgates-0904.04712009-04-07 https://scifaro.com/en/abs/settling-the-complexity-of-arrow-debreu-equilibria-in-markets-with-additively-separable-utilities-0904.06442009-04-07 https://scifaro.com/en/abs/about-the-impossibility-to-prove-p-np-and-the-pseudo-randomness-in-np-0904.06982016-03-28 https://scifaro.com/en/abs/reducibility-among-fractional-stability-problems-0904.14352009-04-10 https://scifaro.com/en/abs/self-assembly-of-a-statistically-self-similar-fractal-0904.16302011-07-21 https://scifaro.com/en/abs/the-power-of-depth-2-circuits-over-algebras-0904.20582016-09-08 https://scifaro.com/en/abs/exact-and-approximation-algorithms-for-geometric-and-capacitated-set-cover-problems-with-applications-0904.23102009-09-30 https://scifaro.com/en/abs/variations-on-muchnik-s-conditional-complexity-theorem-0904.31162011-03-21 https://scifaro.com/en/abs/a-thermodynamic-turing-machine-artificial-molecular-computing-using-classical-reversible-logic-switching-networks-0904.32732009-05-14 https://scifaro.com/en/abs/refutation-of-aslam-s-proof-that-np-p-0904.39122009-05-15 https://scifaro.com/en/abs/a-critique-of-solving-the-p-np-problem-under-intrinsic-uncertainty-arxiv-0811-0463-0904.39272009-04-27 https://scifaro.com/en/abs/representating-groups-on-graphs-0904.39412015-05-13 https://scifaro.com/en/abs/perfect-phylogeny-haplotyping-is-complete-for-logspace-0905.06022009-05-06 https://scifaro.com/en/abs/two-message-quantum-interactive-proofs-are-in-pspace-0905.13002009-05-11 https://scifaro.com/en/abs/minimizing-communication-in-linear-algebra-0905.24852011-09-20 https://scifaro.com/en/abs/computational-complexity-and-numerical-stability-of-linear-problems-0906.06872010-06-22 https://scifaro.com/en/abs/physical-portrayal-of-computational-complexity-0906.10842012-03-20 https://scifaro.com/en/abs/cell-probe-lower-bounds-for-prefix-sums-0906.13702009-06-09 https://scifaro.com/en/abs/on-quantum-classical-equivalence-for-composed-communication-problems-0906.13992010-02-03 https://scifaro.com/en/abs/approximating-the-permanent-via-nonabelian-determinants-0906.17022009-06-10 https://scifaro.com/en/abs/partial-randomness-and-dimension-of-recursively-enumerable-reals-0906.28122015-05-13 https://scifaro.com/en/abs/multi-head-finite-automata-characterizations-concepts-and-open-problems-0906.30512009-06-19 https://scifaro.com/en/abs/computational-power-of-p-systems-with-small-size-insertion-and-deletion-rules-0906.31192009-06-18 https://scifaro.com/en/abs/are-stable-instances-easy-0906.31622009-06-18 https://scifaro.com/en/abs/a-general-notion-of-useful-information-0906.31862009-06-18 https://scifaro.com/en/abs/on-the-injectivity-of-the-global-function-of-a-cellular-automaton-in-the-hyperbolic-plane-extended-abstract-0906.31972009-06-18 https://scifaro.com/en/abs/some-considerations-on-universality-0906.31992009-06-23 https://scifaro.com/en/abs/representing-a-p-complete-problem-by-small-trellis-automata-0906.32082009-06-18 https://scifaro.com/en/abs/intrinsically-universal-cellular-automata-0906.32132009-06-18 https://scifaro.com/en/abs/small-turing-universal-signal-machines-0906.32252009-06-22 https://scifaro.com/en/abs/a-particular-universal-cellular-automaton-0906.32272009-06-22 https://scifaro.com/en/abs/computational-processes-and-incompleteness-0906.32282009-06-18 https://scifaro.com/en/abs/new-choice-for-small-universal-devices-symport-antiport-p-systems-0906.32312009-06-18 https://scifaro.com/en/abs/a-concrete-view-of-rule-110-computation-0906.32482009-06-18 https://scifaro.com/en/abs/limitations-of-self-assembly-at-temperature-one-extended-abstract-0906.32512009-06-18 https://scifaro.com/en/abs/communications-in-cellular-automata-0906.32842009-06-22 https://scifaro.com/en/abs/self-assembly-of-infinite-structures-0906.33062009-06-19 https://scifaro.com/en/abs/on-acceptance-conditions-for-membrane-systems-characterisations-of-l-and-nl-0906.33272009-06-19 https://scifaro.com/en/abs/on-the-boundaries-of-solvability-and-unsolvability-in-tag-systems-theoretical-and-experimental-results-0906.33292009-06-22 https://scifaro.com/en/abs/complexity-through-the-observation-of-simple-systems-0906.33322009-06-22 https://scifaro.com/en/abs/on-the-algorithmic-nature-of-the-world-0906.35542015-03-13 https://scifaro.com/en/abs/speedup-for-natural-problems-and-noncomputability-0906.37652012-09-24 https://scifaro.com/en/abs/a-divergence-formula-for-randomness-and-dimension-short-version-0906.41622009-06-24 https://scifaro.com/en/abs/the-pattern-matrix-method-journal-version-0906.42912009-06-24 https://scifaro.com/en/abs/the-complexity-of-probabilistic-lobbying-0906.44312011-03-01 https://scifaro.com/en/abs/proceedings-international-workshop-on-the-complexity-of-simple-programs-0906.46122009-10-13 https://scifaro.com/en/abs/response-to-refutation-of-aslam-s-proof-that-np-p-0906.51122017-10-10 https://scifaro.com/en/abs/a-note-on-mathematical-modelling-of-practical-multicampaign-assignment-and-its-computational-complexity-0906.54752010-05-04 https://scifaro.com/en/abs/on-unique-independence-weighted-graphs-0907.00882009-07-02 https://scifaro.com/en/abs/on-the-complexity-of-deciding-whether-the-distinguishing-chromatic-number-of-a-graph-is-at-most-two-0907.06912009-07-06 https://scifaro.com/en/abs/reducing-tile-complexity-for-the-self-assembly-of-scaled-shapes-through-temperature-programming-0907.13072009-09-30 https://scifaro.com/en/abs/inapproximability-of-the-tutte-polynomial-of-a-planar-graph-0907.17242012-10-03 https://scifaro.com/en/abs/separations-of-non-monotonic-randomness-notions-0907.23242009-07-15 https://scifaro.com/en/abs/homogeneous-formulas-and-symmetric-polynomials-0907.26212009-07-16 https://scifaro.com/en/abs/the-complexity-of-approximating-bounded-degree-boolean-sharp-csp-0907.26632011-09-19 https://scifaro.com/en/abs/an-overview-of-mathematical-issues-arising-in-the-geometric-complexity-theory-approach-to-vp-v-s-vnp-0907.28502011-01-10 https://scifaro.com/en/abs/a-survey-on-continuous-time-computations-0907.31172009-07-20 https://scifaro.com/en/abs/reachability-time-games-on-timed-automata-0907.34142020-01-16 https://scifaro.com/en/abs/on-the-geometry-of-differential-privacy-0907.37542009-11-09 https://scifaro.com/en/abs/on-lower-bounds-for-constant-width-arithmetic-circuits-0907.37802009-08-14 https://scifaro.com/en/abs/p-np-proof-0907.39652019-07-01 https://scifaro.com/en/abs/arithmetic-circuits-and-the-hadamard-product-of-polynomials-0907.40062009-07-24 https://scifaro.com/en/abs/vertex-cover-problem-parameterized-above-and-below-tight-bounds-0907.44882009-08-28 https://scifaro.com/en/abs/complexity-classes-of-equivalence-problems-revisited-0907.47752011-06-30 https://scifaro.com/en/abs/a-hitting-set-construction-with-application-to-arithmetic-circuit-lower-bounds-0907.55752009-12-08 https://scifaro.com/en/abs/on-the-running-time-of-the-shortest-programs-0908.11592009-09-07 https://scifaro.com/en/abs/matrix-p-norms-are-np-hard-to-approximate-if-p-neq-1-2-infty-0908.13972010-04-26 https://scifaro.com/en/abs/on-p-vs-np-geometric-complexity-theory-explicit-proofs-and-the-complexity-barrier-0908.19322009-08-19 https://scifaro.com/en/abs/on-p-vs-np-geometric-complexity-theory-and-the-riemann-hypothesis-0908.19362009-08-19 https://scifaro.com/en/abs/approximate-counting-and-quantum-computation-0908.21222009-08-17 https://scifaro.com/en/abs/polynomial-space-approximation-of-no-signaling-provers-0908.23632009-10-20 https://scifaro.com/en/abs/concurrent-knowledge-extraction-in-the-public-key-model-0908.24762009-08-19 https://scifaro.com/en/abs/on-optimal-heuristic-randomized-semidecision-procedures-with-application-to-proof-complexity-0908.27072010-02-03 https://scifaro.com/en/abs/a-strong-direct-product-theorem-for-disjointness-0908.29402010-04-12 https://scifaro.com/en/abs/recombinations-of-busy-beaver-machines-0908.40132009-09-07 https://scifaro.com/en/abs/depth-independent-lower-bounds-on-the-communication-complexity-of-read-once-boolean-formulas-0908.44532009-09-01 https://scifaro.com/en/abs/singularity-of-sparse-circulant-matrices-is-np-complete-0909.26942009-09-16 https://scifaro.com/en/abs/on-the-communication-complexity-of-xor-functions-0909.33922010-02-10 https://scifaro.com/en/abs/r-esolution-du-partition-problem-par-une-approche-arithm-etique-0909.34662010-12-06 https://scifaro.com/en/abs/method-of-resolution-of-3sat-in-polynomial-time-0909.38682010-09-14 https://scifaro.com/en/abs/a-note-on-the-sign-degree-of-formulas-0909.46072009-09-28 https://scifaro.com/en/abs/a-regularity-lemma-and-low-weight-approximators-for-low-degree-polynomial-threshold-functions-0909.47272015-03-13 https://scifaro.com/en/abs/average-sensitivity-and-noise-sensitivity-of-polynomial-threshold-functions-0909.50112009-10-19 https://scifaro.com/en/abs/complexity-of-strong-implementability-0909.50292009-09-29 https://scifaro.com/en/abs/an-exponential-lower-bound-on-obdd-refutations-for-pigeonhole-formulas-0909.50382009-09-29 https://scifaro.com/en/abs/bounding-the-sensitivity-of-polynomial-threshold-functions-0909.51752014-03-28 https://scifaro.com/en/abs/the-remote-point-problem-small-bias-space-and-expanding-generator-sets-0909.53132010-02-03 https://scifaro.com/en/abs/proceedings-fourth-athens-colloquium-on-algorithms-and-complexity-0909.54792009-10-01 https://scifaro.com/en/abs/clique-and-vertex-cover-are-solvable-in-polynomial-time-if-the-input-structure-is-ordered-and-contains-a-successor-predicate-0909.55212022-06-28 https://scifaro.com/en/abs/partition-arguments-in-multiparty-communication-complexity-0909.56842017-10-10 https://scifaro.com/en/abs/balancing-bounded-treewidth-circuits-0910.14272015-05-14 https://scifaro.com/en/abs/weakening-assumptions-for-deterministic-subexponential-time-non-singular-matrix-completion-0910.14432009-10-09 https://scifaro.com/en/abs/the-intersection-of-two-halfspaces-has-high-threshold-degree-0910.18622016-09-08 https://scifaro.com/en/abs/improved-inapproximability-results-for-maximum-k-colorable-subgraph-0910.22712015-05-14 https://scifaro.com/en/abs/on-the-hardness-of-the-noncommutative-determinant-0910.23702009-10-26 https://scifaro.com/en/abs/fixed-point-tile-sets-and-their-applications-0910.24152014-12-05 https://scifaro.com/en/abs/polynomially-correlated-knapsack-is-np-complete-0910.26492009-10-15 https://scifaro.com/en/abs/adaptive-concurrent-non-malleability-with-bare-public-keys-0910.32822009-10-20 https://scifaro.com/en/abs/improved-approximation-of-linear-threshold-functions-0910.37192009-10-21 https://scifaro.com/en/abs/compression-based-investigation-of-the-dynamical-properties-of-cellular-automata-and-other-systems-0910.40422011-01-24 https://scifaro.com/en/abs/pseudorandom-generators-for-polynomial-threshold-functions-0910.41222015-03-13 https://scifaro.com/en/abs/optimal-bounds-for-sign-representing-the-intersection-of-two-halfspaces-by-polynomials-0910.42242010-02-25 https://scifaro.com/en/abs/the-partition-bound-for-classical-communication-complexity-and-query-complexity-0910.42662009-11-19 https://scifaro.com/en/abs/nonapproximablity-of-the-normalized-information-distance-0910.43532009-10-23 https://scifaro.com/en/abs/preprocessing-of-min-ones-problems-a-dichotomy-0910.45182009-10-26 https://scifaro.com/en/abs/the-complexity-of-iterated-strategy-elimination-0910.51072010-01-20 https://scifaro.com/en/abs/using-elimination-theory-to-construct-rigid-matrices-0910.53012015-01-27 https://scifaro.com/en/abs/undecidability-of-performance-equivalence-of-petri-nets-0910.58192015-06-29 https://scifaro.com/en/abs/bounds-on-monotone-switching-networks-for-directed-connectivity-0911.06642016-12-01 https://scifaro.com/en/abs/most-tensor-problems-are-np-hard-0911.13932013-07-02 https://scifaro.com/en/abs/graph-isomorphism-and-volumes-of-convex-bodies-0911.17392009-11-10 https://scifaro.com/en/abs/algorithms-for-quantum-branching-programs-based-on-fingerprinting-0911.23172009-11-13 https://scifaro.com/en/abs/characterizing-polynomial-time-computability-of-rational-and-real-functions-0911.23252009-11-13 https://scifaro.com/en/abs/tile-packing-tomography-is-np-hard-0911.25672010-12-22 https://scifaro.com/en/abs/a-recursive-definition-of-the-holographic-standard-signature-0911.29072009-11-17 https://scifaro.com/en/abs/bounded-independence-fools-degree-2-threshold-functions-0911.33892010-02-18 https://scifaro.com/en/abs/polynomial-threshold-functions-structure-approximation-and-pseudorandomness-0911.34732009-11-29 https://scifaro.com/en/abs/towards-a-dichotomy-for-the-possible-winner-problem-in-elections-based-on-scoring-rules-0911.34922010-05-03 https://scifaro.com/en/abs/circuit-lower-bounds-help-functions-and-the-remote-point-problem-0911.43372009-11-24 https://scifaro.com/en/abs/on-the-equivalence-between-minimal-sufficient-statistics-minimal-typical-models-and-initial-segments-of-the-halting-sequence-0911.45212009-11-25 https://scifaro.com/en/abs/quantifying-resource-use-in-computations-0911.52622009-11-30 https://scifaro.com/en/abs/subsampling-mathematical-relaxations-and-average-case-complexity-0911.55262010-05-03 https://scifaro.com/en/abs/temperature-1-self-assembly-deterministic-assembly-in-3d-and-probabilistic-assembly-in-2d-0912.00272015-03-13 https://scifaro.com/en/abs/hardness-results-for-the-gapped-consecutive-ones-property-0912.03092009-12-05 https://scifaro.com/en/abs/hardness-amplification-in-proof-complexity-0912.05682009-12-04 https://scifaro.com/en/abs/a-boundary-between-universality-and-non-universality-in-spiking-neural-p-systems-0912.07412015-03-13 https://scifaro.com/en/abs/on-the-computational-complexity-of-spiking-neural-p-systems-0912.09282009-12-07 https://scifaro.com/en/abs/abstract-milling-with-turn-costs-0912.10502009-12-08 https://scifaro.com/en/abs/on-the-optimality-of-a-class-of-lp-based-algorithms-0912.17762009-12-10 https://scifaro.com/en/abs/deterministic-identity-testing-of-read-once-algebraic-branching-programs-0912.25652009-12-15 https://scifaro.com/en/abs/the-multivariate-resultant-is-np-hard-in-any-characteristic-0912.26072012-10-05 https://scifaro.com/en/abs/the-gaussian-surface-area-and-noise-sensitivity-of-degree-d-polynomials-0912.27092009-12-15 https://scifaro.com/en/abs/complexity-of-propositional-abduction-for-restricted-sets-of-boolean-functions-0912.31342010-06-29 https://scifaro.com/en/abs/derandomizing-from-random-strings-0912.31622009-12-17 https://scifaro.com/en/abs/frugal-and-truthful-auctions-for-vertex-covers-flows-and-cuts-0912.33102011-06-14 https://scifaro.com/en/abs/new-learning-and-testing-problems-for-read-once-functions-0912.36272009-12-21 https://scifaro.com/en/abs/on-the-circuit-size-of-inverses-0912.37302011-02-25 https://scifaro.com/en/abs/the-complexity-of-the-list-homomorphism-problem-for-graphs-0912.38022010-02-03 https://scifaro.com/en/abs/log-space-algorithms-for-paths-and-matchings-in-k-trees-0912.46022010-02-03 https://scifaro.com/en/abs/an-invariance-principle-for-polytopes-0912.48842013-02-05 https://scifaro.com/en/abs/inapproximability-of-maximal-strip-recovery-0912.49352015-05-14 https://scifaro.com/en/abs/better-gap-hamming-lower-bounds-via-better-round-elimination-0912.52762009-12-31 https://scifaro.com/en/abs/elementary-complexity-and-von-neumann-algebras-0912.53422009-12-31 https://scifaro.com/en/abs/collapsing-and-separating-completeness-notions-under-average-case-and-worst-case-hypotheses-1001.01172010-02-03 https://scifaro.com/en/abs/intrinsic-universality-in-self-assembly-1001.02082016-09-08 https://scifaro.com/en/abs/restricted-space-algorithms-for-isomorphism-on-bounded-treewidth-graphs-1001.03832010-02-03 https://scifaro.com/en/abs/holant-problems-for-regular-graphs-with-complex-edge-functions-1001.04642011-08-09 https://scifaro.com/en/abs/alternation-trading-proofs-linear-programming-and-lower-bounds-1001.07462010-02-03 https://scifaro.com/en/abs/fooling-functions-of-halfspaces-under-product-distributions-1001.15932010-01-12 https://scifaro.com/en/abs/on-the-power-of-unambiguity-in-logspace-1001.20342010-01-14 https://scifaro.com/en/abs/block-sensitivity-of-minterm-transitive-functions-1001.20522010-01-14 https://scifaro.com/en/abs/circuit-partitions-and-p-complete-products-of-inner-products-1001.23142010-01-15 https://scifaro.com/en/abs/stochastic-budget-optimization-in-internet-advertising-1001.27352015-03-13 https://scifaro.com/en/abs/approximate-self-assembly-of-the-sierpinski-triangle-1001.28882015-05-18 https://scifaro.com/en/abs/the-recognition-of-tolerance-and-bounded-tolerance-graphs-1001.32512010-02-03 https://scifaro.com/en/abs/randomness-testing-of-compressed-data-1001.34852010-03-25 https://scifaro.com/en/abs/two-phase-algorithms-for-the-parametric-shortest-path-problem-1001.37492010-02-03 https://scifaro.com/en/abs/the-p-versus-np-problem-1001.38162010-01-22 https://scifaro.com/en/abs/is-space-a-stronger-resource-than-time-positive-answer-for-the-nondeterministic-at-least-quadratic-time-case-1001.46492010-01-27 https://scifaro.com/en/abs/m-sophistication-1001.46872010-01-27 https://scifaro.com/en/abs/evasiveness-and-the-distribution-of-prime-numbers-1001.48292010-02-03 https://scifaro.com/en/abs/the-complexity-of-approximating-bounded-degree-boolean-csp-extended-abstract-1001.49872010-02-03 https://scifaro.com/en/abs/efficient-implementation-of-rewriting-revisited-technical-report-1001.54042011-06-09 https://scifaro.com/en/abs/from-sylvester-gallai-configurations-to-rank-bounds-improved-black-box-identity-test-for-depth-3-circuits-1002.01452010-02-09 https://scifaro.com/en/abs/approximating-the-partition-function-of-the-ferromagnetic-potts-model-1002.09862012-11-13 https://scifaro.com/en/abs/deterministic-black-box-identity-testing-pi-ordered-algebraic-branching-programs-1002.14962010-02-09 https://scifaro.com/en/abs/derandomized-parallel-repetition-via-structured-pcps-1002.16062014-03-19 https://scifaro.com/en/abs/finding-and-counting-vertex-colored-subtrees-1002.18802012-02-27 https://scifaro.com/en/abs/optimal-lower-bounds-for-projective-list-update-algorithms-1002.24402014-12-02 https://scifaro.com/en/abs/a-complete-characterization-of-statistical-query-learning-with-applications-to-evolvability-1002.31832013-11-26 https://scifaro.com/en/abs/on-the-complexity-of-stratified-logics-1002.34532010-02-19 https://scifaro.com/en/abs/a-pcp-characterization-of-am-1002.36642010-02-22 https://scifaro.com/en/abs/polyominoes-simulating-arbitrary-neighborhood-zippers-and-tilings-1002.37692011-04-12 https://scifaro.com/en/abs/limits-of-approximation-algorithms-pcps-and-unique-games-dimacs-tutorial-lecture-notes-1002.38642010-03-30 https://scifaro.com/en/abs/partitionability-to-two-trees-is-np-complete-1002.39372010-02-23 https://scifaro.com/en/abs/properties-of-pseudo-primitive-words-and-their-applications-1002.40842010-02-23 https://scifaro.com/en/abs/pebbling-and-branching-programs-solving-the-tree-evaluation-problem-1002.46762010-02-26 https://scifaro.com/en/abs/a-definable-number-which-cannot-be-approximated-algorithmically-1003.04802010-03-03 https://scifaro.com/en/abs/repeating-patterns-in-linear-programs-that-express-np-complete-problems-1003.11642010-03-08 https://scifaro.com/en/abs/the-zero-exemplar-distance-problem-1003.19912015-05-18 https://scifaro.com/en/abs/on-the-relative-strength-of-pebbling-and-resolution-1003.30472015-03-13 https://scifaro.com/en/abs/on-a-variant-of-monotone-nae-3sat-and-the-triangle-free-cut-problem-1003.37042010-03-30 https://scifaro.com/en/abs/an-effective-dichotomy-for-the-counting-constraint-satisfaction-problem-1003.38792011-08-18 https://scifaro.com/en/abs/on-extractors-and-exposure-resilient-functions-for-sublogarithmic-entropy-1003.40292010-12-14 https://scifaro.com/en/abs/bounds-for-bilinear-complexity-of-noncommutative-group-algebras-1003.46792010-03-25 https://scifaro.com/en/abs/optimal-direct-sum-results-for-deterministic-and-randomized-decision-tree-complexity-1004.01052010-04-02 https://scifaro.com/en/abs/on-the-parity-complexity-measures-of-boolean-functions-1004.04362010-04-06 https://scifaro.com/en/abs/from-holant-to-csp-and-back-dichotomy-for-holant-c-problems-1004.08032015-03-14 https://scifaro.com/en/abs/a-separation-of-np-and-conp-in-multiparty-communication-complexity-1004.08172022-03-29 https://scifaro.com/en/abs/on-the-complexity-of-local-search-for-weighted-standard-set-problems-1004.08712015-05-18 https://scifaro.com/en/abs/the-complexity-of-partition-functions-on-hermitian-matrices-1004.09922010-04-08 https://scifaro.com/en/abs/on-the-completeness-of-quantum-computation-models-1004.10272015-05-18 https://scifaro.com/en/abs/existential-second-order-logic-expression-with-horn-first-order-for-maximum-clique-decision-version-1004.18142010-10-05 https://scifaro.com/en/abs/the-complexity-of-approximately-counting-stable-matchings-1004.18362012-04-20 https://scifaro.com/en/abs/algebraic-proofs-over-noncommutative-formulas-1004.21592010-08-03 https://scifaro.com/en/abs/local-versus-global-search-in-channel-graphs-1004.25262010-04-16 https://scifaro.com/en/abs/w-1-hardness-of-some-domination-like-problems-parameterized-by-tree-width-1004.26422014-04-04 https://scifaro.com/en/abs/the-communication-complexity-of-xor-games-via-summing-operators-1004.28822010-04-19 https://scifaro.com/en/abs/on-the-approximability-of-robust-spanning-tree-problems-1004.28912010-04-19 https://scifaro.com/en/abs/the-dichotomy-of-list-homomorphisms-for-digraphs-1004.29082010-04-21 https://scifaro.com/en/abs/enumeration-of-the-monomials-of-a-polynomial-and-related-complexity-classes-1004.30202011-02-01 https://scifaro.com/en/abs/the-space-complexity-of-recognizing-well-parenthesized-expressions-in-the-streaming-model-the-index-function-revisited-1004.31652014-07-11 https://scifaro.com/en/abs/information-cost-tradeoffs-for-augmented-index-and-streaming-language-recognition-1004.33042015-03-14 https://scifaro.com/en/abs/the-complexity-of-multiple-precision-arithmetic-1004.36082021-03-22 https://scifaro.com/en/abs/parameterized-control-complexity-in-fallback-voting-1004.36592010-04-22 https://scifaro.com/en/abs/improved-inapproximability-for-submodular-maximization-1004.37772010-04-22 https://scifaro.com/en/abs/resolving-the-complexity-of-some-data-privacy-problems-1004.38112010-04-26 https://scifaro.com/en/abs/distance-constraint-satisfaction-problems-1004.38422016-04-27 https://scifaro.com/en/abs/an-oracle-strongly-separating-deterministic-time-from-nondeterministic-time-via-kolmogorov-complexity-1004.39932015-03-14 https://scifaro.com/en/abs/self-assembly-of-arbitrary-shapes-using-rnase-enzymes-meeting-the-kolmogorov-bound-with-small-scale-factor-extended-abstract-1004.43832010-07-09 https://scifaro.com/en/abs/lipschitz-continuous-ordinary-differential-equations-are-polynomial-space-complete-1004.46222010-07-19 https://scifaro.com/en/abs/on-the-complexity-of-the-k-anonymization-problem-1004.47292010-04-28 https://scifaro.com/en/abs/shallow-circuits-with-high-powered-inputs-1004.49602010-08-02 https://scifaro.com/en/abs/space-complexity-of-perfect-matching-in-bounded-genus-bipartite-graphs-1004.50802010-04-29 https://scifaro.com/en/abs/circuits-with-arbitrary-gates-for-random-operators-1004.52362015-03-17 https://scifaro.com/en/abs/settling-the-complexity-of-local-max-cut-almost-completely-1004.53292011-06-27 https://scifaro.com/en/abs/observation-of-implicit-complexity-by-non-confluence-1005.05192010-05-20 https://scifaro.com/en/abs/improved-direct-product-theorems-for-randomized-query-complexity-1005.06442014-05-12 https://scifaro.com/en/abs/min-rank-conjecture-for-log-depth-circuits-1005.10092012-04-18 https://scifaro.com/en/abs/quantum-complexity-restrictions-on-algorithms-and-architectures-1005.14252010-05-11 https://scifaro.com/en/abs/binary-matroids-and-quantum-probability-distributions-1005.17442010-05-12 https://scifaro.com/en/abs/a-short-introduction-to-kolmogorov-complexity-1005.24002010-05-17 https://scifaro.com/en/abs/on-tractable-exponential-sums-1005.26322015-05-19 https://scifaro.com/en/abs/pebbles-and-branching-programs-for-tree-evaluation-1005.26422015-03-17 https://scifaro.com/en/abs/the-complexity-of-weighted-and-unweighted-csp-1005.26782015-03-17 https://scifaro.com/en/abs/a-proof-for-p-np-problem-1005.30102020-07-02 https://scifaro.com/en/abs/bucklin-voting-is-broadly-resistant-to-control-1005.41152016-08-14 https://scifaro.com/en/abs/on-a-new-complete-invariant-of-acyclic-graphs-1005.41222010-08-10 https://scifaro.com/en/abs/using-a-skewed-hamming-distance-to-speed-up-deterministic-local-search-1005.48742010-05-27 https://scifaro.com/en/abs/computational-transition-at-the-uniqueness-threshold-1005.55842010-06-01 https://scifaro.com/en/abs/image-characterization-and-classification-by-physical-complexity-1006.00512015-03-17 https://scifaro.com/en/abs/on-the-weak-computability-of-continuous-real-functions-1006.03942010-06-03 https://scifaro.com/en/abs/the-descriptive-set-theoretic-complexity-of-the-set-of-points-of-continuity-of-a-multi-valued-function-extended-abstract-1006.03992010-06-03 https://scifaro.com/en/abs/computing-the-solutions-of-the-combined-korteweg-de-vries-equation-by-turing-machines-1006.04002010-06-03 https://scifaro.com/en/abs/a-local-to-global-principle-for-the-complexity-of-riemann-mappings-extended-abstract-1006.04022010-06-03 https://scifaro.com/en/abs/complete-multi-representations-of-sets-in-a-computable-measure-space-1006.04062010-06-03 https://scifaro.com/en/abs/proceedings-seventh-international-conference-on-computability-and-complexity-in-analysis-1006.05512010-06-04 https://scifaro.com/en/abs/impossibility-of-independence-amplification-in-kolmogorov-complexity-theory-1006.07012015-05-19 https://scifaro.com/en/abs/counting-dependent-and-independent-strings-1006.13152015-05-19 https://scifaro.com/en/abs/parameterized-two-player-nash-equilibrium-1006.20632010-06-11 https://scifaro.com/en/abs/the-complexity-of-the-np-class-1006.22182010-06-14 https://scifaro.com/en/abs/the-power-of-nondeterminism-in-self-assembly-1006.28972010-11-29 https://scifaro.com/en/abs/identifying-shapes-using-self-assembly-extended-abstract-1006.30462010-06-16 https://scifaro.com/en/abs/normalized-information-distance-is-not-semicomputable-1006.32752010-06-17 https://scifaro.com/en/abs/exponential-inapproximability-of-selecting-a-maximum-volume-sub-matrix-1006.43492011-10-13 https://scifaro.com/en/abs/arithmetic-circuits-the-chasm-at-depth-four-gets-wider-1006.47002012-03-26 https://scifaro.com/en/abs/complexity-classifications-for-propositional-abduction-in-post-s-framework-1006.49232010-06-28 https://scifaro.com/en/abs/approximating-the-tutte-polynomial-of-a-binary-matroid-and-other-related-combinatorial-polynomials-1006.52342013-08-01 https://scifaro.com/en/abs/computational-complexity-of-reconstruction-and-isomorphism-testing-for-designs-and-line-graphs-1006.58922018-07-03 https://scifaro.com/en/abs/pseudorandom-generators-and-the-bqp-vs-ph-problem-1007.03052010-12-23 https://scifaro.com/en/abs/approximate-counting-for-complex-weighted-boolean-constraint-satisfaction-problems-1007.03912012-10-17 https://scifaro.com/en/abs/on-the-solution-of-the-graph-isomorphism-problem-part-1-1007.10592012-10-22 https://scifaro.com/en/abs/learning-read-once-functions-using-subcube-identity-queries-1007.10732010-07-08 https://scifaro.com/en/abs/exponential-time-complexity-of-weighted-counting-of-independent-sets-1007.11462015-05-19 https://scifaro.com/en/abs/a-dense-hierarchy-of-sublinear-time-approximation-schemes-for-bin-packing-1007.12602011-02-25 https://scifaro.com/en/abs/integrality-gaps-of-linear-and-semi-definite-programming-relaxations-for-knapsack-1007.12832010-07-09 https://scifaro.com/en/abs/can-random-coin-flips-speed-up-a-computer-1007.16782010-07-13 https://scifaro.com/en/abs/communication-complexity-1007.18412010-07-13 https://scifaro.com/en/abs/np-pspace-1007.18682010-07-14 https://scifaro.com/en/abs/the-complexity-of-testing-monomials-in-multivariate-polynomials-1007.26732010-07-19 https://scifaro.com/en/abs/algorithms-for-testing-monomials-in-multivariate-polynomials-1007.26752010-07-19 https://scifaro.com/en/abs/approximating-multilinear-monomial-coefficients-and-maximum-multilinear-monomials-in-multivariate-polynomials-1007.26782015-05-19 https://scifaro.com/en/abs/on-the-applicability-of-post-s-lattice-1007.29242012-01-06 https://scifaro.com/en/abs/unbounded-error-quantum-computation-with-small-space-bounds-1007.36242014-01-29 https://scifaro.com/en/abs/symmetric-determinantal-representation-of-formulas-and-weakly-skew-circuits-1007.38042012-10-24 https://scifaro.com/en/abs/complexity-of-data-dependence-problems-for-program-schemas-with-concurrency-1007.38782011-04-13 https://scifaro.com/en/abs/polynomial-time-approximation-scheme-for-max-cut-problem-1007.42572011-04-06 https://scifaro.com/en/abs/about-functions-where-function-input-describes-inner-working-of-the-function-1007.46602010-07-28 https://scifaro.com/en/abs/sensitivity-versus-block-sensitivity-of-boolean-functions-1008.05212010-12-09 https://scifaro.com/en/abs/holographic-algorithms-with-matchgates-capture-precisely-tractable-planar-csp-1008.06832010-08-05 https://scifaro.com/en/abs/a-decidable-dichotomy-theorem-on-directed-graph-homomorphisms-with-non-negative-weights-1008.09152010-08-06 https://scifaro.com/en/abs/matrix-sparsification-and-the-sparse-null-space-problem-1008.14982010-08-10 https://scifaro.com/en/abs/the-complexity-of-conservative-finite-valued-csps-1008.15552010-08-10 https://scifaro.com/en/abs/query-efficient-locally-decodable-codes-of-subexponential-length-1008.16172010-08-11 https://scifaro.com/en/abs/accepting-hybrid-networks-of-evolutionary-processors-with-special-topologies-and-small-communication-1008.16492010-08-11 https://scifaro.com/en/abs/on-the-complexity-of-the-evaluation-of-transient-extensions-of-boolean-functions-1008.16662010-08-11 https://scifaro.com/en/abs/understanding-space-in-proof-complexity-separations-and-trade-offs-via-substitutions-1008.17892010-08-12 https://scifaro.com/en/abs/symmetry-and-uncountability-of-computation-1008.22472010-09-24 https://scifaro.com/en/abs/the-quantum-query-complexity-of-ac0-1008.24222012-02-01 https://scifaro.com/en/abs/a-dichotomy-theorem-for-the-approximate-counting-of-complex-weighted-bounded-degree-boolean-csps-1008.26882015-05-19 https://scifaro.com/en/abs/motion-planning-with-pull-moves-1008.29522010-08-18 https://scifaro.com/en/abs/generalising-tractable-vcsps-defined-by-symmetric-tournament-pair-multimorphisms-1008.31042010-08-19 https://scifaro.com/en/abs/a-dichotomy-theorem-for-conservative-general-valued-csps-1008.40352010-08-25 https://scifaro.com/en/abs/separations-of-matroid-freeness-properties-1008.44012010-08-30 https://scifaro.com/en/abs/shortest-paths-between-shortest-paths-and-independent-sets-1008.45632015-05-19 https://scifaro.com/en/abs/explicit-proofs-and-the-flip-1009.02462010-09-02 https://scifaro.com/en/abs/dichotomy-for-tree-structured-trigraph-list-homomorphism-problems-1009.03582010-09-03 https://scifaro.com/en/abs/on-complexity-of-isoperimetric-problems-on-trees-1009.07062010-09-06 https://scifaro.com/en/abs/knowledge-recognition-algorithm-enables-p-np-1009.08842010-09-07 https://scifaro.com/en/abs/complexity-classifications-for-different-equivalence-and-audit-problems-for-boolean-circuits-1009.12082015-07-01 https://scifaro.com/en/abs/complexity-of-non-monotonic-logics-1009.19902010-09-13 https://scifaro.com/en/abs/the-exponential-time-complexity-of-computing-the-probability-that-a-graph-is-connected-1009.23632015-05-19 https://scifaro.com/en/abs/quantum-function-computation-using-sublogarithmic-space-abstract-poster-1009.31242010-09-17 https://scifaro.com/en/abs/the-complexity-of-rerouting-shortest-paths-1009.32172012-04-26 https://scifaro.com/en/abs/an-optimal-lower-bound-on-the-communication-complexity-of-gap-hamming-distance-1009.34602012-07-02 https://scifaro.com/en/abs/quantum-one-way-communication-is-exponentially-stronger-than-classical-communication-1009.36402010-09-21 https://scifaro.com/en/abs/3-sat-polynomial-solution-of-knowledge-recognition-algorithm-1009.36872010-12-13 https://scifaro.com/en/abs/robust-coin-flipping-1009.41882015-03-13 https://scifaro.com/en/abs/adding-a-referee-to-an-interconnection-network-what-can-not-be-computed-in-one-round-1009.44472010-10-06 https://scifaro.com/en/abs/on-polynomial-multiplication-in-chebyshev-basis-1009.45972013-09-10 https://scifaro.com/en/abs/the-complexity-of-counting-eulerian-tours-in-4-regular-graphs-1009.50192010-09-28 https://scifaro.com/en/abs/on-the-complexity-of-the-multiple-stack-tsp-kstsp-1009.50292010-09-28 https://scifaro.com/en/abs/approximability-of-the-multiple-stack-tsp-1009.50302010-09-28 https://scifaro.com/en/abs/improving-the-space-bounded-version-of-muchnik-s-conditional-complexity-theorem-via-naive-derandomization-1009.51082012-03-12 https://scifaro.com/en/abs/determining-all-maximum-uniquely-restricted-matching-in-bipartite-graphs-1009.54352010-09-29 https://scifaro.com/en/abs/the-baire-partial-quasi-metric-space-a-mathematical-tool-for-asymptotic-complexity-analysis-in-computer-science-1009.61052010-10-01 https://scifaro.com/en/abs/strong-direct-product-conjecture-holds-for-all-relations-in-public-coin-randomized-one-way-communication-complexity-1010.05222010-10-15 https://scifaro.com/en/abs/a-strong-direct-product-theorem-for-two-way-public-coin-communication-complexity-1010.08462010-11-29 https://scifaro.com/en/abs/faster-polynomial-multiplication-via-discrete-fourier-transforms-1010.11012010-10-07 https://scifaro.com/en/abs/a-path-order-for-rewrite-systems-that-compute-exponential-time-functions-technical-report-1010.11282011-06-10 https://scifaro.com/en/abs/complejidad-descriptiva-y-computacional-en-maquinas-de-turing-pequenas-1010.13282011-04-19 https://scifaro.com/en/abs/a-simple-deterministic-reduction-for-the-gap-minimum-distance-of-code-problem-1010.14812010-10-08 https://scifaro.com/en/abs/the-surprizing-complexity-of-generalized-reachability-games-1010.24202012-02-06 https://scifaro.com/en/abs/resource-bounded-dimension-in-computational-learning-theory-1010.54702015-03-17 https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-estimating-the-partition-function-of-the-ferromagnetic-ising-model-on-a-regular-matroid-1010.62312013-08-01 https://scifaro.com/en/abs/a-non-expert-view-on-turing-machines-proof-verifiers-and-mental-reasoning-1011.00462012-03-02 https://scifaro.com/en/abs/independent-sets-in-random-graphs-from-the-weighted-second-moment-method-1011.01802011-11-15 https://scifaro.com/en/abs/variations-on-the-sensitivity-conjecture-1011.03542010-11-02 https://scifaro.com/en/abs/quantum-computation-with-devices-whose-contents-are-never-read-1011.12012014-01-29 https://scifaro.com/en/abs/adversarial-satisfiability-problem-1011.12732015-03-23 https://scifaro.com/en/abs/multivariate-analyis-of-swap-bribery-1011.13382015-05-20 https://scifaro.com/en/abs/geometric-complexity-theory-and-tensor-rank-1011.13502010-11-08 https://scifaro.com/en/abs/on-the-problem-of-local-randomness-in-privacy-amplification-with-an-active-adversary-1011.25512010-11-12 https://scifaro.com/en/abs/reductions-between-expansion-problems-1011.25862010-11-12 https://scifaro.com/en/abs/a-solution-to-the-p-versus-np-problem-1011.27302014-07-08 https://scifaro.com/en/abs/schaefer-s-theorem-for-graphs-1011.28942015-05-19 https://scifaro.com/en/abs/blackbox-identity-testing-for-bounded-top-fanin-depth-3-circuits-the-field-doesn-t-matter-1011.32342015-03-17 https://scifaro.com/en/abs/program-size-and-temperature-in-self-assembly-1011.34932015-03-17 https://scifaro.com/en/abs/realizable-paths-and-the-nl-vs-l-problem-1011.38402010-11-18 https://scifaro.com/en/abs/cross-composition-a-new-technique-for-kernelization-lower-bounds-1011.42242015-03-17 https://scifaro.com/en/abs/complexity-of-homogeneous-co-boolean-constraint-satisfaction-problems-1011.47442010-11-23 https://scifaro.com/en/abs/complexity-of-existential-positive-first-order-logic-1011.47572011-01-13 https://scifaro.com/en/abs/strong-direct-product-theorems-for-quantum-communication-and-query-complexity-1011.49352010-11-23 https://scifaro.com/en/abs/enumeration-order-complexity-equivalency-1011.59662010-11-30 https://scifaro.com/en/abs/border-basis-detection-is-np-complete-1011.60212010-11-30 https://scifaro.com/en/abs/kolmogorov-loveland-sets-and-advice-complexity-classes-1012.02322011-02-17 https://scifaro.com/en/abs/a-note-on-nonuniform-versus-uniform-acc-k-circuits-for-ne-1012.05562010-12-06 https://scifaro.com/en/abs/agnostic-learning-of-monomials-by-halfspaces-is-hard-1012.07292010-12-06 https://scifaro.com/en/abs/interactive-proofs-with-competing-teams-of-no-signaling-provers-1012.08212013-08-08 https://scifaro.com/en/abs/the-complexity-of-approximately-counting-stable-roommate-assignments-1012.12372012-04-20 https://scifaro.com/en/abs/unary-subset-sum-is-in-logspace-1012.13362017-07-28 https://scifaro.com/en/abs/k-independent-gaussians-fool-polynomial-threshold-functions-1012.16142011-11-14 https://scifaro.com/en/abs/robust-simulations-and-significant-separations-1012.20342010-12-10 https://scifaro.com/en/abs/np-completeness-proof-rbcdn-reduction-problem-1012.21422010-12-13 https://scifaro.com/en/abs/multivariate-polynomial-integration-and-derivative-are-polynomial-time-inapproximable-unless-p-np-1012.23772010-12-13 https://scifaro.com/en/abs/ne-is-not-np-turing-reducible-to-nonexpoentially-dense-np-sets-1012.23942010-12-14 https://scifaro.com/en/abs/passively-mobile-communicating-machines-that-use-restricted-space-1012.24402010-12-14 https://scifaro.com/en/abs/solving-the-rural-postman-problem-using-the-adleman-lipton-model-1012.25272010-12-16 https://scifaro.com/en/abs/dense-locally-testable-codes-cannot-have-constant-rate-and-distance-1012.27382010-12-14 https://scifaro.com/en/abs/random-generation-and-approximate-counting-of-combinatorial-structures-1012.30002010-12-15 https://scifaro.com/en/abs/a-note-about-a-partial-no-go-theorem-for-quantum-pcp-1012.33192012-06-12 https://scifaro.com/en/abs/local-testability-and-self-correctability-of-q-ary-sparse-linear-codes-1012.35062015-03-17 https://scifaro.com/en/abs/on-the-polynomial-depth-of-various-sets-of-random-strings-1012.35482015-03-17 https://scifaro.com/en/abs/the-model-checking-problem-for-intuitionistic-propositional-logic-with-one-variable-is-ac1-complete-1012.38282011-09-16 https://scifaro.com/en/abs/a-relation-between-the-protocol-partition-number-and-the-quasi-additive-bound-1012.51302010-12-24 https://scifaro.com/en/abs/non-negative-weighted-csps-an-effective-complexity-dichotomy-1012.56592010-12-30 https://scifaro.com/en/abs/finding-of-k-in-fagin-s-r-theorem-24-1012.58042016-10-20 https://scifaro.com/en/abs/on-arthur-merlin-games-in-communication-complexity-1101.05232011-01-04 https://scifaro.com/en/abs/almost-settling-the-hardness-of-noncommutative-determinant-1101.11692018-10-09 https://scifaro.com/en/abs/on-quadratic-programming-with-a-ratio-objective-1101.17102015-03-17 https://scifaro.com/en/abs/the-complexity-of-3sat-n-and-the-p-versus-np-problem-1101.20182013-11-12 https://scifaro.com/en/abs/planarity-testing-revisited-1101.26372015-03-17 https://scifaro.com/en/abs/lower-bound-for-deterministic-semantic-incremental-branching-programs-solving-gen-1101.27052011-01-17 https://scifaro.com/en/abs/superiority-of-exact-quantum-automata-for-promise-problems-1101.38372014-01-29 https://scifaro.com/en/abs/short-propositional-refutations-for-dense-random-3cnf-formulas-1101.39702011-06-06 https://scifaro.com/en/abs/tight-bounds-on-the-randomized-communication-complexity-of-symmetric-xor-functions-in-one-way-and-smp-models-1101.45552011-11-01 https://scifaro.com/en/abs/a-zero-one-subexp-dimension-law-for-bpp-1101.48482015-03-18 https://scifaro.com/en/abs/np-has-log-space-verifiers-with-fixed-size-public-quantum-registers-1101.52272012-04-06 https://scifaro.com/en/abs/resource-bounded-measure-1101.54552012-02-01 https://scifaro.com/en/abs/tensor-rank-some-lower-and-upper-bounds-1102.00722012-03-05 https://scifaro.com/en/abs/classical-and-quantum-computation-with-small-space-bounds-phd-thesis-1102.03782011-02-03 https://scifaro.com/en/abs/probabilistic-and-quantum-finite-automata-with-postselection-1102.06662011-02-04 https://scifaro.com/en/abs/on-approximating-four-covering-and-packing-problems-1102.10062011-02-07 https://scifaro.com/en/abs/new-definition-for-fuzzy-constraint-satisfaction-problem-and-its-applications-1102.11222015-03-18 https://scifaro.com/en/abs/computation-with-narrow-ctcs-1102.11992014-01-29 https://scifaro.com/en/abs/the-hardness-of-median-in-the-synchronized-bit-communication-model-1102.12082011-02-08 https://scifaro.com/en/abs/axiomatizing-resource-bounds-for-measure-1102.20952012-02-01 https://scifaro.com/en/abs/spectral-algorithms-for-unique-games-1102.23002011-02-14 https://scifaro.com/en/abs/finite-state-verifiers-with-constant-randomness-1102.27192015-07-01 https://scifaro.com/en/abs/algebraic-independence-and-blackbox-identity-testing-1102.27892011-02-15 https://scifaro.com/en/abs/min-csp-on-four-elements-moving-beyond-submodularity-1102.28802011-04-29 https://scifaro.com/en/abs/applications-of-monotone-rank-to-complexity-theory-1102.29322011-11-22 https://scifaro.com/en/abs/superiority-of-one-way-and-realtime-quantum-machines-and-new-directions-1102.30932011-05-10 https://scifaro.com/en/abs/many-one-reductions-and-the-category-of-multivalued-functions-1102.31512015-12-31 https://scifaro.com/en/abs/on-sorting-by-bounded-block-interchanges-1102.32452011-10-06 https://scifaro.com/en/abs/low-level-dichotomy-for-quantified-constraint-satisfaction-problems-1102.34632011-02-18 https://scifaro.com/en/abs/derandomizing-hssw-algorithm-for-3-sat-1102.37662011-02-21 https://scifaro.com/en/abs/bpp-is-in-np-and-conp-1102.43462011-02-25 https://scifaro.com/en/abs/the-influence-lower-bound-via-query-elimination-1102.46992011-02-24 https://scifaro.com/en/abs/program-size-versus-time-complexity-speed-up-and-slowdown-phenomena-in-small-turing-machines-1102.53892015-03-19 https://scifaro.com/en/abs/tight-bounds-for-parallel-randomized-load-balancing-1102.54252011-03-01 https://scifaro.com/en/abs/an-implicit-cover-problem-in-wild-population-study-1102.54712015-03-19 https://scifaro.com/en/abs/a-formalization-of-polytime-functions-1102.54952021-03-23 https://scifaro.com/en/abs/on-unique-games-with-negative-weights-1102.56052013-03-15 https://scifaro.com/en/abs/3-sat-faster-and-simpler-unique-sat-bounds-for-ppsz-hold-in-general-1103.21652011-05-06 https://scifaro.com/en/abs/control-complexity-in-bucklin-and-fallback-voting-1103.22302015-03-19 https://scifaro.com/en/abs/proceedings-csr-2010-workshop-on-high-productivity-computations-1103.22682011-03-17 https://scifaro.com/en/abs/on-computational-power-of-quantum-read-once-branching-programs-1103.28092011-03-16 https://scifaro.com/en/abs/on-the-certification-of-the-restricted-isometry-property-1103.49842011-10-18 https://scifaro.com/en/abs/on-the-complexity-of-edge-packing-and-vertex-packing-1103.55602011-04-08 https://scifaro.com/en/abs/symmetry-of-information-and-bounds-on-nonuniform-randomness-extraction-via-kolmogorov-extractors-1103.56692011-03-30 https://scifaro.com/en/abs/qcsp-on-partially-reflexive-forests-1103.62122011-04-01 https://scifaro.com/en/abs/counting-homomorphisms-and-partition-functions-1104.01852011-05-23 https://scifaro.com/en/abs/possibilities-and-impossibilities-in-kolmogorov-complexity-extraction-1104.08722012-06-19 https://scifaro.com/en/abs/a-small-prg-for-polynomial-threshold-functions-of-gaussians-1104.12092011-04-08 https://scifaro.com/en/abs/new-hardness-results-in-rainbow-connectivity-1104.20742011-04-13 https://scifaro.com/en/abs/minimization-for-generalized-boolean-formulas-1104.23122011-04-13 https://scifaro.com/en/abs/a-parallel-approximation-algorithm-for-positive-semidefinite-programming-1104.25022011-04-14 https://scifaro.com/en/abs/computational-complexity-on-signed-numbers-1104.25382011-04-14 https://scifaro.com/en/abs/backdoors-to-tractable-answer-set-programming-1104.27882014-03-07 https://scifaro.com/en/abs/on-the-optimal-compression-of-sets-in-pspace-1104.28162011-04-15 https://scifaro.com/en/abs/storage-enforcement-with-kolmogorov-complexity-and-list-decoding-1104.30252011-04-18 https://scifaro.com/en/abs/numbers-as-data-structures-the-prime-successor-function-as-primitive-1104.30562011-04-18 https://scifaro.com/en/abs/correlation-testing-for-affine-invariant-properties-on-mathbb-f-p-n-in-the-high-error-regime-1104.33352013-08-14 https://scifaro.com/en/abs/empirical-encounters-with-computational-irreducibility-and-unpredictability-1104.34212011-06-24 https://scifaro.com/en/abs/the-two-bicliques-problem-is-in-np-intersection-conp-1104.34632015-03-19 https://scifaro.com/en/abs/inapproximability-of-np-complete-variants-of-nash-equilibrium-1104.37602011-04-20 https://scifaro.com/en/abs/fairness-through-awareness-1104.39132011-11-30 https://scifaro.com/en/abs/arc-preserving-subsequences-of-arc-annotated-sequences-1104.44332011-04-25 https://scifaro.com/en/abs/the-3-satisfiability-problem-1104.44902012-01-09 https://scifaro.com/en/abs/lasserre-hierarchy-higher-eigenvalues-and-approximation-schemes-for-quadratic-integer-programming-with-psd-objectives-1104.47462015-03-19 https://scifaro.com/en/abs/the-computational-complexity-of-disconnected-cut-and-2k2-partition-1104.47792014-10-30 https://scifaro.com/en/abs/parallelism-and-time-in-hierarchical-self-assembly-1104.52262017-02-14 https://scifaro.com/en/abs/the-complexity-of-surjective-homomorphism-problems-a-survey-1104.52572011-09-27 https://scifaro.com/en/abs/quantum-counter-automata-1105.01652014-01-29 https://scifaro.com/en/abs/derandomization-of-online-assignment-algorithms-for-dynamic-graphs-1105.02332011-05-03 https://scifaro.com/en/abs/on-gr-obner-basis-detection-for-zero-dimensional-ideals-1105.04332011-05-04 https://scifaro.com/en/abs/complexity-of-unconstrained-l-2-l-p-minimization-1105.06382011-05-04 https://scifaro.com/en/abs/new-heuristic-rounding-approaches-to-the-quadratic-assignment-problem-1105.19992011-05-11 https://scifaro.com/en/abs/computing-in-the-fractal-cloud-modular-generic-solvers-for-sat-and-q-sat-variants-1105.34542015-03-19 https://scifaro.com/en/abs/nearly-optimal-np-hardness-of-vertex-cover-on-k-uniform-k-partite-hypergraphs-1105.41752011-05-24 https://scifaro.com/en/abs/improved-inapproximability-results-for-counting-independent-sets-in-the-hard-core-model-1105.51312013-08-12 https://scifaro.com/en/abs/a-combination-of-testability-and-decodability-by-tensor-products-1105.58062011-05-31 https://scifaro.com/en/abs/asymptotic-granularity-reduction-and-its-application-1106.01082014-11-04 https://scifaro.com/en/abs/a-dual-approach-for-solving-nonlinear-infinite-norm-minimization-problems-with-applications-in-separable-cases-1106.08512011-06-07 https://scifaro.com/en/abs/barbosa-uniform-polynomial-time-bounds-and-promises-1106.11502015-03-19 https://scifaro.com/en/abs/a-novel-hybrid-algorithm-for-task-graph-scheduling-1106.19102011-06-13 https://scifaro.com/en/abs/zen-puzzle-garden-is-np-complete-1106.21042011-06-13 https://scifaro.com/en/abs/another-approach-to-the-equivalence-of-measure-many-one-way-quantum-finite-automata-and-its-application-1106.24812023-06-19 https://scifaro.com/en/abs/algorithmic-complexity-for-short-binary-strings-applied-to-psychology-a-primer-1106.30592013-12-10 https://scifaro.com/en/abs/confronting-intractability-via-parameters-1106.31612011-11-23 https://scifaro.com/en/abs/complexity-classes-and-theories-for-the-comparator-circuit-value-problem-1106.41422011-10-06 https://scifaro.com/en/abs/expressibility-at-the-machine-level-versus-structure-level-eso-universal-horn-logic-and-the-class-p-1106.46062012-07-24 https://scifaro.com/en/abs/computing-hypergraph-width-measures-exactly-1106.47192011-06-24 https://scifaro.com/en/abs/some-results-on-equivalence-of-multi-letter-quantum-finite-automata-1106.52232023-06-06 https://scifaro.com/en/abs/class-based-rough-approximation-with-dominance-principle-1106.56012016-11-17 https://scifaro.com/en/abs/a-probabilistic-attack-on-np-complete-problems-1107.00982012-08-06 https://scifaro.com/en/abs/bilinear-complexity-of-algebras-and-the-chudnovsky-chudnovsky-interpolation-method-1107.03362012-03-19 https://scifaro.com/en/abs/on-the-furthest-hyperplane-problem-and-maximal-margin-clustering-1107.13582012-02-06 https://scifaro.com/en/abs/the-limited-power-of-powering-polynomial-identity-testing-and-a-depth-four-lower-bound-for-the-permanent-1107.14342012-02-17 https://scifaro.com/en/abs/sets-have-simple-members-1107.14582014-03-21 https://scifaro.com/en/abs/intuitionistic-implication-makes-model-checking-hard-1107.19632015-07-01 https://scifaro.com/en/abs/complexity-of-metric-dimension-on-planar-graphs-1107.22562016-07-13 https://scifaro.com/en/abs/private-data-release-via-learning-thresholds-1107.24442011-07-14 https://scifaro.com/en/abs/lower-bounds-for-number-in-hand-multiparty-communication-complexity-made-easy-1107.25592015-02-10 https://scifaro.com/en/abs/on-the-feasibility-of-maintenance-algorithms-in-dynamic-graphs-1107.27222012-02-20 https://scifaro.com/en/abs/on-the-computational-complexity-of-stochastic-controller-optimization-in-pomdps-1107.30902012-10-05 https://scifaro.com/en/abs/a-satisfiability-algorithm-for-ac-0-1107.31272015-03-19 https://scifaro.com/en/abs/on-the-simulation-of-adaptive-measurements-via-postselection-1107.32712011-07-19 https://scifaro.com/en/abs/computational-hardness-of-enumerating-satisfying-spin-assignments-in-triangulations-1107.37672011-07-20 https://scifaro.com/en/abs/analysis-on-the-computability-over-the-efficient-utilization-problem-of-the-four-dimensional-space-time-1107.41502015-01-26 https://scifaro.com/en/abs/deterministic-construction-of-an-approximate-m-ellipsoid-and-its-application-to-derandomizing-lattice-algorithms-1107.54782011-07-28 https://scifaro.com/en/abs/bqp-and-ppad-1108.02232011-08-02 https://scifaro.com/en/abs/algorithmic-complexity-of-pair-cleaning-method-for-k-satisfiability-problem-draft-version-1108.04082012-06-01 https://scifaro.com/en/abs/turing-degrees-of-multidimensional-sfts-1108.10122012-06-04 https://scifaro.com/en/abs/why-philosophers-should-care-about-computational-complexity-1108.17912024-05-11 https://scifaro.com/en/abs/graph-and-election-problems-parameterized-by-feedback-set-numbers-1108.21912011-08-11 https://scifaro.com/en/abs/width-parameterized-sat-time-space-tradeoffs-1108.23852011-08-12 https://scifaro.com/en/abs/tight-bounds-for-the-space-complexity-of-nonregular-language-recognition-by-real-time-machines-1108.26132013-05-09 https://scifaro.com/en/abs/structure-from-local-optima-learning-subspace-juntas-via-higher-order-pca-1108.33292012-04-17 https://scifaro.com/en/abs/gadgets-and-anti-gadgets-leading-to-a-complexity-dichotomy-1108.33832011-11-30 https://scifaro.com/en/abs/new-separation-between-s-f-and-bs-f-1108.34942011-08-18 https://scifaro.com/en/abs/constructing-minimal-phylogenetic-networks-from-softwired-clusters-is-fixed-parameter-tractable-1108.36532011-08-19 https://scifaro.com/en/abs/a-swar-approach-to-counting-ones-1108.38602015-07-03 https://scifaro.com/en/abs/taking-the-final-step-to-a-full-dichotomy-of-the-possible-winner-problem-in-pure-scoring-rules-1108.44362011-11-29 https://scifaro.com/en/abs/parameterized-complexity-of-maxsat-above-average-1108.45012011-12-21 https://scifaro.com/en/abs/sparse-approximation-is-hard-1108.46642011-11-29 https://scifaro.com/en/abs/the-expressibility-of-functions-on-the-boolean-domain-with-applications-to-counting-csps-1108.52882013-10-25 https://scifaro.com/en/abs/un-metodo-estable-para-la-evaluacion-de-la-complejidad-algoritmica-de-cadenas-cortas-1108.53872011-09-01 https://scifaro.com/en/abs/on-quantum-interactive-proofs-with-short-messages-1109.09642011-09-06 https://scifaro.com/en/abs/a-w-1-completeness-result-for-generalized-permutation-pattern-matching-1109.19512013-01-15 https://scifaro.com/en/abs/the-complexity-of-the-empire-colouring-problem-1109.21622018-06-06 https://scifaro.com/en/abs/2-log-1-eps-n-hardness-for-closest-vector-problem-with-preprocessing-1109.21762011-09-13 https://scifaro.com/en/abs/various-complexity-results-for-computational-mass-spectrometry-problems-1109.33672012-04-23 https://scifaro.com/en/abs/local-correction-of-juntas-1109.36392011-12-30 https://scifaro.com/en/abs/optimization-randomized-approximability-and-boolean-constraint-satisfaction-problems-1109.36512011-09-19 https://scifaro.com/en/abs/inapproximability-of-treewidth-one-shot-pebbling-and-related-layout-problems-1109.49102011-09-23 https://scifaro.com/en/abs/a-market-for-air-traffic-flow-management-1109.52142011-09-27 https://scifaro.com/en/abs/aut-omatas-celulares-elementales-aplicados-a-la-encriptaci-on-de-datos-1109.52822011-09-27 https://scifaro.com/en/abs/note-on-the-complexity-of-deciding-the-rainbow-connectedness-for-bipartite-graphs-1109.55342011-09-28 https://scifaro.com/en/abs/approximation-complexity-of-complex-weighted-degree-two-counting-constraint-satisfaction-problems-1109.57892012-10-23 https://scifaro.com/en/abs/optimal-accessing-and-non-accessing-structures-for-graph-protocols-1109.61812011-10-05 https://scifaro.com/en/abs/parameterized-complexity-in-multiple-interval-graphs-domination-partition-separation-irredundancy-1110.01872015-03-19 https://scifaro.com/en/abs/np-is-not-al-and-p-is-not-nc-is-not-nl-is-not-l-1110.02002011-11-22 https://scifaro.com/en/abs/alan-turing-and-the-origins-of-complexity-1110.02712014-02-10 https://scifaro.com/en/abs/lsm-is-not-generated-by-binary-functions-1110.04612012-06-22 https://scifaro.com/en/abs/boolean-satisfiability-using-noise-based-logic-1110.05502011-10-05 https://scifaro.com/en/abs/on-the-parameterized-complexity-of-default-logic-and-autoepistemic-logic-1110.06232011-10-07 https://scifaro.com/en/abs/the-complexity-of-rooted-phylogeny-problems-1110.06932015-07-01 https://scifaro.com/en/abs/on-the-hidden-shifted-power-problem-1110.08122012-01-04 https://scifaro.com/en/abs/on-approximability-of-block-sorting-1110.08922011-10-06 https://scifaro.com/en/abs/hierarchies-of-inefficient-kernelizability-1110.09762015-03-19 https://scifaro.com/en/abs/spider-solitaire-is-np-complete-1110.10522011-10-06 https://scifaro.com/en/abs/np-hardness-and-fixed-parameter-tractability-of-realizing-degree-sequences-with-directed-acyclic-graphs-1110.15102012-01-18 https://scifaro.com/en/abs/algorithm-that-solves-3-sat-in-polynomial-time-1110.16582015-06-04 https://scifaro.com/en/abs/the-complexity-of-the-fermionant-and-immanants-of-constant-width-1110.18212015-01-22 https://scifaro.com/en/abs/restricted-parameter-range-promise-set-cover-problems-are-easy-1110.18962011-10-11 https://scifaro.com/en/abs/the-complexity-of-small-universal-turing-machines-a-survey-1110.22302011-10-12 https://scifaro.com/en/abs/the-complexity-of-conservative-valued-csps-1110.28092015-03-19 https://scifaro.com/en/abs/approximation-for-maximum-surjective-constraint-satisfaction-problems-1110.29532011-10-14 https://scifaro.com/en/abs/software-engineering-and-complexity-in-effective-algebraic-geometry-1110.30302012-04-26 https://scifaro.com/en/abs/rainbow-connections-for-planar-graphs-and-line-graphs-1110.31472011-11-15 https://scifaro.com/en/abs/about-set-theoretic-properties-of-one-way-functions-1110.31892015-03-19 https://scifaro.com/en/abs/tron-a-combinatorial-game-on-abstract-graphs-1110.32112011-10-17 https://scifaro.com/en/abs/complexity-of-ising-polynomials-1110.36392012-10-15 https://scifaro.com/en/abs/the-parameterised-complexity-of-list-problems-on-graphs-of-bounded-treewidth-1110.40772016-08-05 https://scifaro.com/en/abs/the-complexity-of-weighted-counting-for-acyclic-conjunctive-queries-1110.42012011-12-08 https://scifaro.com/en/abs/subspace-evasive-sets-1110.56962011-10-27 https://scifaro.com/en/abs/parameterized-complexity-of-satisfying-almost-all-linear-equations-over-mathbb-f-2-1110.59152012-12-04 https://scifaro.com/en/abs/a-counterexample-to-the-generalized-linial-nisan-conjecture-1110.61262011-10-28 https://scifaro.com/en/abs/monomials-in-arithmetic-circuits-complete-problems-in-the-counting-hierarchy-1110.62712012-03-28 https://scifaro.com/en/abs/construction-of-an-np-problem-with-an-exponential-lower-bound-1111.03052011-11-03 https://scifaro.com/en/abs/making-the-long-code-shorter-with-applications-to-the-unique-games-conjecture-1111.04052016-11-25 https://scifaro.com/en/abs/inclusion-of-unambiguous-re-s-is-np-hard-1111.04222011-11-03 https://scifaro.com/en/abs/pancake-flipping-is-hard-1111.04342012-09-05 https://scifaro.com/en/abs/jacobian-hits-circuits-hitting-sets-lower-bounds-for-depth-d-occur-k-formulas-depth-3-transcendence-degree-k-circuits-1111.05822011-11-03 https://scifaro.com/en/abs/on-identity-testing-of-tensors-low-rank-recovery-and-compressed-sensing-1111.06632012-12-03 https://scifaro.com/en/abs/maximum-bounded-rooted-tree-packing-problem-1111.07062011-11-04 https://scifaro.com/en/abs/a-casual-tour-around-a-circuit-complexity-bound-1111.12612015-03-19 https://scifaro.com/en/abs/monotone-switching-networks-for-directed-connectivity-are-strictly-more-powerful-than-certain-knowledge-switching-networks-1111.21272011-11-10 https://scifaro.com/en/abs/complexity-of-counting-csp-with-complex-weights-1111.23842015-03-19 https://scifaro.com/en/abs/proving-the-power-of-postselection-1111.31252014-04-11 https://scifaro.com/en/abs/approximating-fixation-probabilities-in-the-generalized-moran-process-1111.33212014-03-21 https://scifaro.com/en/abs/unpredictability-and-computational-irreducibility-1111.41212012-02-06 https://scifaro.com/en/abs/an-additivity-theorem-for-plain-kolmogorov-complexity-1111.43722012-02-16 https://scifaro.com/en/abs/quantum-fourier-sampling-code-equivalence-and-the-quantum-security-of-the-mceliece-and-sidelnikov-cryptosystems-1111.43822011-11-21 https://scifaro.com/en/abs/universal-computation-is-almost-surely-chaotic-1111.49492015-07-06 https://scifaro.com/en/abs/improved-lower-bounds-for-the-shortest-superstring-and-related-problems-1111.54422012-08-28 https://scifaro.com/en/abs/an-additive-combinatorics-approach-to-the-log-rank-conjecture-in-communication-complexity-1111.58842011-11-28 https://scifaro.com/en/abs/memoryless-computation-new-results-constructions-and-extensions-1111.60262015-03-19 https://scifaro.com/en/abs/constraint-satisfaction-tractability-from-semi-lattice-operations-on-infinite-sets-1111.66162011-11-30 https://scifaro.com/en/abs/fast-balanced-partitioning-is-hard-even-on-grids-and-trees-1111.67452019-04-29 https://scifaro.com/en/abs/the-traveling-salesman-problem-low-dimensionality-implies-a-polynomial-time-approximation-scheme-1112.06992016-09-09 https://scifaro.com/en/abs/small-jump-with-negation-utm-trampoline-1112.09872014-10-14 https://scifaro.com/en/abs/what-makes-normalized-weighted-satisfiability-tractable-1112.10402011-12-06 https://scifaro.com/en/abs/improved-hardness-results-for-unique-shortest-vector-problem-1112.15642011-12-08 https://scifaro.com/en/abs/a-discrepancy-lower-bound-for-information-complexity-1112.20002012-06-13 https://scifaro.com/en/abs/lie-algebra-conjugacy-1112.20122011-12-12 https://scifaro.com/en/abs/efficiency-theory-a-unifying-theory-for-information-computation-and-intelligence-1112.21272016-10-26 https://scifaro.com/en/abs/on-weak-odd-domination-and-graph-based-quantum-secret-sharing-1112.24952016-10-11 https://scifaro.com/en/abs/errors-in-improved-polynomial-algorithm-for-3-sat-proposed-by-narendra-chaudhari-1112.25192011-12-13 https://scifaro.com/en/abs/on-the-treewidth-of-dynamic-graphs-1112.27952012-05-28 https://scifaro.com/en/abs/constraint-satisfaction-with-counting-quantifiers-1112.29742011-12-14 https://scifaro.com/en/abs/solution-of-the-propeller-conjecture-in-mathbb-r-3-1112.29932014-04-08 https://scifaro.com/en/abs/computing-bits-of-algebraic-numbers-1112.42952011-12-20 https://scifaro.com/en/abs/subexponential-fixed-parameter-tractability-of-cluster-editing-1112.44192015-03-19 https://scifaro.com/en/abs/intractability-of-the-minimum-flip-supertree-problem-and-its-variants-1112.45362011-12-21 https://scifaro.com/en/abs/new-lower-bounds-for-the-border-rank-of-matrix-multiplication-1112.60072013-06-04 https://scifaro.com/en/abs/short-proofs-for-the-determinant-identities-1112.62652013-04-23 https://scifaro.com/en/abs/threshold-saturation-in-spatially-coupled-constraint-satisfaction-problems-1112.63202015-06-03 https://scifaro.com/en/abs/testing-low-complexity-affine-invariant-properties-1201.03302012-10-09 https://scifaro.com/en/abs/noise-vs-computational-intractability-in-dynamics-1201.04882017-02-15 https://scifaro.com/en/abs/on-the-dynamic-qualitative-behaviour-of-universal-computation-1201.08242012-01-05 https://scifaro.com/en/abs/computer-runtimes-and-the-length-of-proofs-on-an-algorithmic-probabilistic-application-to-waiting-times-in-automatic-theorem-proving-1201.08252012-01-05 https://scifaro.com/en/abs/complexity-classification-in-infinite-domain-constraint-satisfaction-1201.08562019-04-23 https://scifaro.com/en/abs/implicit-complexity-for-coinductive-data-a-characterization-of-corecurrence-1201.11192012-01-06 https://scifaro.com/en/abs/sublogarithmic-uniform-boolean-proof-nets-1201.11202012-01-06 https://scifaro.com/en/abs/a-type-system-for-pspace-derived-from-light-linear-logic-1201.11222012-01-06 https://scifaro.com/en/abs/statistical-algorithms-and-a-lower-bound-for-detecting-planted-clique-1201.12142016-08-16 https://scifaro.com/en/abs/turing-machines-and-understanding-computational-complexity-1201.12232013-08-26 https://scifaro.com/en/abs/two-hands-are-better-than-one-up-to-constant-factors-1201.16502015-03-20 https://scifaro.com/en/abs/a-direct-product-theorem-for-bounded-round-public-coin-randomized-communication-complexity-1201.16662012-01-10 https://scifaro.com/en/abs/polynomial-time-algorithms-for-multi-type-branching-processes-and-stochastic-context-free-grammars-1201.23742013-02-21 https://scifaro.com/en/abs/a-new-order-theoretic-characterisation-of-the-polytime-computable-functions-1201.25532012-01-17 https://scifaro.com/en/abs/near-optimal-expanding-generating-sets-for-solvable-permutation-groups-1201.31812012-01-17 https://scifaro.com/en/abs/partial-degree-bounded-edge-packing-problem-1201.31842012-01-17 https://scifaro.com/en/abs/simulating-special-but-natural-quantum-circuits-1201.33062015-03-20 https://scifaro.com/en/abs/on-the-intrinsic-complexity-of-elimination-problems-in-effective-algebraic-geometry-1201.43442012-04-26 https://scifaro.com/en/abs/gaming-is-a-hard-job-but-someone-has-to-do-it-1201.49952013-10-29 https://scifaro.com/en/abs/scrabble-is-pspace-complete-1201.52982012-01-26 https://scifaro.com/en/abs/on-approximation-lower-bounds-for-tsp-with-bounded-metrics-1201.58212012-08-09 https://scifaro.com/en/abs/near-optimal-deterministic-algorithms-for-volume-computation-and-lattice-problems-via-m-ellipsoids-1201.59722014-03-05 https://scifaro.com/en/abs/length-3-edge-disjoint-paths-and-partial-orientation-1201.65782012-02-01 https://scifaro.com/en/abs/the-complexity-of-computing-the-sign-of-the-tutte-polynomial-1202.03132014-10-10 https://scifaro.com/en/abs/from-heaps-of-matches-to-the-limits-of-computability-1202.06642012-02-06 https://scifaro.com/en/abs/topological-approach-to-solve-p-versus-np-1202.11942012-10-16 https://scifaro.com/en/abs/smoothed-complexity-theory-1202.19362015-03-20 https://scifaro.com/en/abs/lower-bounds-on-testing-functions-of-low-fourier-degree-1202.34792013-08-27 https://scifaro.com/en/abs/the-rapid-points-of-a-complex-oscillation-1202.38552015-07-01 https://scifaro.com/en/abs/on-the-complexity-of-solving-linear-congruences-and-computing-nullspaces-modulo-a-constant-1202.39492013-08-06 https://scifaro.com/en/abs/algebraic-independence-in-positive-characteristic-a-p-adic-calculus-1202.43012012-02-21 https://scifaro.com/en/abs/solving-the-canonical-representation-and-star-system-problems-for-proper-circular-arc-graphs-in-log-space-1202.44062013-12-06 https://scifaro.com/en/abs/polynomial-time-algorithms-for-branching-markov-decision-processes-and-probabilistic-min-max-polynomial-bellman-equations-1202.47982012-02-24 https://scifaro.com/en/abs/some-results-on-more-flexible-versions-of-graph-motif-1202.51842014-09-11 https://scifaro.com/en/abs/explicit-optimal-hardness-via-gaussian-stability-results-1202.52582013-08-12 https://scifaro.com/en/abs/on-the-computational-complexity-of-a-game-of-cops-and-robbers-1202.60432012-12-19 https://scifaro.com/en/abs/constant-factor-lasserre-integrality-gaps-for-graph-partitioning-problems-1202.60712015-03-20 https://scifaro.com/en/abs/functions-that-preserve-p-randomness-1202.63952012-03-01 https://scifaro.com/en/abs/tensor-rank-and-strong-quantum-nondeterminism-in-multiparty-communication-1202.64442013-08-13 https://scifaro.com/en/abs/complexity-of-complexity-and-strings-with-maximal-plain-and-prefix-kolmogorov-complexity-1202.66682013-05-06 https://scifaro.com/en/abs/on-the-distribution-of-the-fourier-spectrum-of-halfspaces-1202.66802012-03-01 https://scifaro.com/en/abs/on-equivalence-languages-equivalence-and-minimization-of-multi-letter-and-multi-letter-measure-many-quantum-automata-1203.01132023-07-21 https://scifaro.com/en/abs/data-structure-lower-bounds-on-random-access-to-grammar-compressed-strings-1203.10802012-05-04 https://scifaro.com/en/abs/correlation-communication-complexity-of-generating-bipartite-states-1203.11532012-03-07 https://scifaro.com/en/abs/a-turing-machine-resisting-isolated-bursts-of-faults-1203.13352012-03-08 https://scifaro.com/en/abs/the-complexity-of-the-puzzles-of-final-fantasy-xiii-2-1203.16332012-03-09 https://scifaro.com/en/abs/calculation-of-the-minimum-computational-complexity-based-on-information-entropy-1203.17922012-03-09 https://scifaro.com/en/abs/classic-nintendo-games-are-computationally-hard-1203.18952015-02-10 https://scifaro.com/en/abs/relativized-propositional-calculus-1203.21682012-03-12 https://scifaro.com/en/abs/on-exact-algorithms-for-permutation-csp-1203.28012012-03-14 https://scifaro.com/en/abs/report-on-mathematical-aspects-of-p-vs-np-and-its-variants-1203.28882012-03-22 https://scifaro.com/en/abs/revisiting-the-complexity-of-and-or-graph-solution-1203.32492012-03-16 https://scifaro.com/en/abs/observability-of-turing-machines-a-refinement-of-the-theory-of-computation-1203.32982012-03-16 https://scifaro.com/en/abs/space-bounded-kolmogorov-extractors-1203.36742012-03-19 https://scifaro.com/en/abs/homomorphic-hashing-for-sparse-coefficient-extraction-1203.40632012-03-20 https://scifaro.com/en/abs/variety-evasive-sets-1203.45322012-03-21 https://scifaro.com/en/abs/turing-machines-can-be-efficiently-simulated-by-the-general-purpose-analog-computer-1203.46672017-01-18 https://scifaro.com/en/abs/clique-problem-cutting-plane-proofs-and-communication-complexity-1203.54142018-05-30 https://scifaro.com/en/abs/how-to-solve-ksat-in-polynomial-time-1203.60202012-04-03 https://scifaro.com/en/abs/classical-and-quantum-satisfiability-1203.61612012-03-29 https://scifaro.com/en/abs/solving-mahjong-solitaire-boards-with-peeking-1203.65592012-04-04 https://scifaro.com/en/abs/complexity-information-flow-in-a-multi-threaded-imperative-language-1203.68782012-04-02 https://scifaro.com/en/abs/a-note-on-the-balanced-st-connectivity-1204.08162012-04-05 https://scifaro.com/en/abs/densities-and-entropies-in-cellular-automata-1204.09492012-04-05 https://scifaro.com/en/abs/approximation-limits-of-linear-programs-beyond-hierarchies-1204.09572014-05-20 https://scifaro.com/en/abs/the-power-of-linear-programming-for-valued-csps-1204.10792015-11-24 https://scifaro.com/en/abs/the-complexity-of-monotone-hybrid-logics-over-linear-frames-and-the-natural-numbers-1204.11962012-06-13 https://scifaro.com/en/abs/new-lower-bounds-for-matching-vector-codes-1204.13672013-04-01 https://scifaro.com/en/abs/lower-bounds-on-information-complexity-via-zero-communication-protocols-and-applications-1204.15052013-01-21 https://scifaro.com/en/abs/phase-transition-in-unrestricted-random-sat-1204.16562012-04-10 https://scifaro.com/en/abs/a-non-triviality-certificate-for-scalars-and-its-application-to-linear-systems-1204.17642012-04-10 https://scifaro.com/en/abs/strengthened-hardness-for-approximating-minimum-unique-game-and-small-set-expansion-1204.20262014-12-16 https://scifaro.com/en/abs/a-new-reduction-from-search-svp-to-optimization-svp-1204.20402012-04-11 https://scifaro.com/en/abs/the-complexity-of-string-partitioning-1204.22012012-04-11 https://scifaro.com/en/abs/clique-in-3-track-interval-graphs-is-apx-hard-1204.22022012-04-11 https://scifaro.com/en/abs/lower-bound-on-weights-of-large-degree-threshold-functions-1204.26522015-07-01 https://scifaro.com/en/abs/hardness-results-for-approximate-pure-horn-cnf-formulae-minimization-1204.35292014-03-12 https://scifaro.com/en/abs/towards-the-notion-of-an-abstract-quantum-automaton-1204.39862012-06-12 https://scifaro.com/en/abs/deterministic-function-computation-with-chemical-reaction-networks-1204.41762015-03-20 https://scifaro.com/en/abs/non-existence-of-polynomial-kernels-for-the-test-cover-problem-1204.43682012-04-20 https://scifaro.com/en/abs/computing-multiplicities-of-lie-group-representations-1204.43792012-10-31 https://scifaro.com/en/abs/on-the-minimum-degree-up-to-local-complementation-bounds-and-complexity-1204.45642016-10-11 https://scifaro.com/en/abs/complexity-of-tropical-and-min-plus-linear-prevarieties-1204.45782012-04-23 https://scifaro.com/en/abs/the-computational-complexity-of-minesweeper-1204.46592012-04-23 https://scifaro.com/en/abs/kolmogorov-complexity-causality-and-spin-1204.54472012-04-26 https://scifaro.com/en/abs/relativizing-small-complexity-classes-and-their-theories-1204.55082012-04-26 https://scifaro.com/en/abs/efficient-programs-of-npc-problems-should-be-length-upper-bounded-and-a-thought-experiment-to-search-for-them-by-machine-enumeration-1204.55762012-10-09 https://scifaro.com/en/abs/on-the-usefulness-of-predicates-1204.56622012-04-26 https://scifaro.com/en/abs/a-new-point-of-np-hardness-for-2-to-1-label-cover-1204.56662012-04-26 https://scifaro.com/en/abs/degree-two-approximate-boolean-csps-with-variable-weights-1204.57142012-04-26 https://scifaro.com/en/abs/a-complete-dichotomy-rises-from-the-capture-of-vanishing-signatures-1204.64452018-01-11 https://scifaro.com/en/abs/universal-factor-graphs-1204.64842012-05-01 https://scifaro.com/en/abs/a-note-on-no-need-to-choose-how-to-get-both-a-ptas-and-sublinear-query-complexity-1204.65882012-05-01 https://scifaro.com/en/abs/nonuniform-kolmogorov-extractors-1204.66962012-05-01 https://scifaro.com/en/abs/an-entropic-proof-of-chang-s-inequality-1205.02632012-05-17 https://scifaro.com/en/abs/analysis-of-boolean-functions-1205.03142012-05-03 https://scifaro.com/en/abs/tight-bounds-for-low-dimensional-star-stencils-in-the-parallel-external-memory-model-1205.06062015-01-23 https://scifaro.com/en/abs/a-note-on-a-problem-in-communication-complexity-1205.09032012-05-07 https://scifaro.com/en/abs/information-complexity-versus-corruption-and-applications-to-orthogonality-and-gap-hamming-1205.09682012-05-07 https://scifaro.com/en/abs/on-the-complexity-of-recognizing-s-composite-and-s-prime-graphs-1205.09912017-05-11 https://scifaro.com/en/abs/a-wronskian-approach-to-the-real-tau-conjecture-1205.10152014-05-19 https://scifaro.com/en/abs/width-and-size-of-regular-resolution-proofs-1205.10502015-07-01 https://scifaro.com/en/abs/on-the-complexity-of-trial-and-error-1205.11832013-04-19 https://scifaro.com/en/abs/inapproximability-after-uniqueness-phase-transition-in-two-spin-systems-1205.29342015-03-20 https://scifaro.com/en/abs/dnf-sparsification-and-a-faster-deterministic-counting-algorithm-1205.35342012-05-17 https://scifaro.com/en/abs/p-versus-up-1205.36552014-07-18 https://scifaro.com/en/abs/an-np-complete-problem-in-grid-coloring-1205.38132022-12-13 https://scifaro.com/en/abs/the-permanent-graph-gadgets-and-counting-solutions-for-certain-types-of-planar-formulas-1205.41242012-05-21 https://scifaro.com/en/abs/hypercontractivity-sum-of-squares-proofs-and-their-applications-1205.44842014-11-18 https://scifaro.com/en/abs/translating-the-cantor-set-by-a-random-1205.48212021-02-09 https://scifaro.com/en/abs/on-the-practically-interesting-instances-of-maxcut-1205.48932012-05-23 https://scifaro.com/en/abs/spectral-norm-of-symmetric-functions-1205.52822012-05-25 https://scifaro.com/en/abs/turing-equivalent-automata-using-a-fixed-size-quantum-memory-1205.53952012-05-25 https://scifaro.com/en/abs/deterministic-polynomial-factoring-and-association-schemes-1205.56532019-02-20 https://scifaro.com/en/abs/computation-environments-an-interactive-semantics-for-turing-machines-which-p-is-not-equal-to-np-considering-it-1205.59942012-05-29 https://scifaro.com/en/abs/optimal-epsilon-biased-sets-with-just-a-little-randomness-1205.62182013-04-19 https://scifaro.com/en/abs/solving-satisfiability-by-bayesian-inference-1205.66582020-02-05 https://scifaro.com/en/abs/streaming-algorithms-for-recognizing-nearly-well-parenthesized-expressions-1206.02062012-06-04 https://scifaro.com/en/abs/some-computational-aspects-of-essential-properties-of-evolution-and-life-1206.03752012-06-05 https://scifaro.com/en/abs/nearly-optimal-solutions-for-the-chow-parameters-problem-and-low-weight-approximation-of-halfspaces-1206.09852012-06-06 https://scifaro.com/en/abs/new-lower-bounds-for-the-rank-of-matrix-multiplication-1206.15302013-10-31 https://scifaro.com/en/abs/exponential-time-complexity-of-the-permanent-and-the-tutte-polynomial-1206.17752018-04-24 https://scifaro.com/en/abs/on-the-complexity-of-minimum-labeling-alignment-of-two-genomes-1206.18772012-06-12 https://scifaro.com/en/abs/a-proof-checking-view-of-parameterized-complexity-1206.24362012-07-30 https://scifaro.com/en/abs/improved-inapproximability-for-tsp-1206.24972012-06-13 https://scifaro.com/en/abs/decomposition-of-kolmogorov-complexity-and-link-to-geometry-1206.28932012-06-14 https://scifaro.com/en/abs/hardness-of-vertex-deletion-and-project-scheduling-1206.34082012-06-18 https://scifaro.com/en/abs/parametrized-complexity-of-weak-odd-domination-problems-1206.40812015-01-15 https://scifaro.com/en/abs/factoring-bivariate-lacunary-polynomials-without-heights-1206.42242013-07-02 https://scifaro.com/en/abs/efficiently-expressing-feasibility-problems-in-linear-systems-as-feasibility-problems-in-asymptotic-linear-programs-1206.42362012-06-20 https://scifaro.com/en/abs/constraint-satisfaction-parameterized-by-solution-size-1206.48542014-01-21 https://scifaro.com/en/abs/on-bilinear-algorithms-for-multiplication-in-quaternion-algebras-1206.55012012-08-29 https://scifaro.com/en/abs/kernelization-lower-bounds-by-cross-composition-1206.59412015-03-20 https://scifaro.com/en/abs/on-the-cnf-complexity-of-bipartite-graphs-containing-no-k-2-2-s-1206.60682012-06-27 https://scifaro.com/en/abs/an-algebraic-approach-to-symmetric-extended-formulations-1206.63182012-06-28 https://scifaro.com/en/abs/augmenting-a-geometric-matching-is-np-complete-1206.63602012-06-28 https://scifaro.com/en/abs/extending-partial-representations-of-subclasses-of-chordal-graphs-1207.02552013-05-22 https://scifaro.com/en/abs/pseudo-finite-hard-instances-for-a-student-teacher-game-with-a-nisan-wigderson-generator-1207.03932015-07-01 https://scifaro.com/en/abs/optimization-of-quadratic-forms-np-hard-problems-neural-networks-1207.06342012-07-04 https://scifaro.com/en/abs/minimizing-the-number-of-lattice-points-in-a-translated-polygon-1207.09792012-07-05 https://scifaro.com/en/abs/relationship-between-circuit-complexity-and-symmetry-1207.21712013-04-24 https://scifaro.com/en/abs/a-robust-khintchine-inequality-and-algorithms-for-computing-optimal-constants-in-fourier-analysis-and-high-dimensional-geometry-1207.22292013-05-06 https://scifaro.com/en/abs/dichotomy-for-holant-problems-with-a-function-on-domain-size-3-1207.23542012-07-11 https://scifaro.com/en/abs/one-counter-verifiers-for-decidable-languages-1207.38802012-07-18 https://scifaro.com/en/abs/complexity-of-canadian-traveler-problem-variants-1207.47102012-07-20 https://scifaro.com/en/abs/two-betting-strategies-that-predict-all-compressible-sequences-presentation-1207.47152012-07-20 https://scifaro.com/en/abs/integer-factoring-and-modular-square-roots-1207.52202015-12-02 https://scifaro.com/en/abs/cancellation-free-circuits-an-approach-for-proving-superlinear-lower-bounds-for-linear-boolean-operators-1207.53212012-07-24 https://scifaro.com/en/abs/black-box-identity-testing-for-low-degree-unmixed-sigma-pi-sigma-pi-k-circuits-1207.58842012-07-26 https://scifaro.com/en/abs/kolmogorov-complexity-clustering-objects-and-similarity-1207.61882012-07-27 https://scifaro.com/en/abs/sparse-extractor-families-for-all-the-entropy-1207.62602012-07-27 https://scifaro.com/en/abs/an-algebraic-theory-of-complexity-for-discrete-optimisation-1207.66922015-03-20 https://scifaro.com/en/abs/the-power-of-linear-programming-for-valued-csps-a-constructive-characterization-1207.72132015-03-20 https://scifaro.com/en/abs/hamming-approximation-of-np-witnesses-1208.02572013-08-06 https://scifaro.com/en/abs/optimization-hardness-as-transient-chaos-in-an-analog-approach-to-constraint-satisfaction-1208.05262012-08-03 https://scifaro.com/en/abs/p-np-1208.09542017-03-21 https://scifaro.com/en/abs/the-complexity-of-approximating-conservative-counting-csps-1208.17832014-07-08 https://scifaro.com/en/abs/space-efficient-circuit-evaluation-1208.22172012-08-13 https://scifaro.com/en/abs/compression-with-wildcards-all-models-of-a-boolean-2-cnf-1208.25592025-04-08 https://scifaro.com/en/abs/the-relative-exponential-time-complexity-of-approximate-counting-satisfying-assignments-1208.25612012-08-14 https://scifaro.com/en/abs/the-complexity-of-the-comparator-circuit-value-problem-1208.27212013-07-29 https://scifaro.com/en/abs/on-derivatives-and-subpattern-orders-of-countable-subshifts-1208.27562012-08-15 https://scifaro.com/en/abs/enumerable-distributions-randomness-dependence-1208.29552021-08-03 https://scifaro.com/en/abs/quasi-optimal-multiplication-of-linear-differential-operators-1208.36392016-11-15 https://scifaro.com/en/abs/approximating-the-partition-function-of-planar-two-state-spin-systems-1208.49872014-07-08 https://scifaro.com/en/abs/hitting-all-maximal-independent-sets-of-a-bipartite-graph-1208.55892015-05-12 https://scifaro.com/en/abs/a-strong-direct-product-theorem-in-terms-of-the-smooth-rectangle-bound-1209.02632013-02-20 https://scifaro.com/en/abs/computational-complexity-of-interactive-behaviors-1209.06632012-09-05 https://scifaro.com/en/abs/a-sufficient-condition-for-first-order-non-definability-of-arrowing-problems-1209.08022012-09-06 https://scifaro.com/en/abs/combinatorial-spaces-and-order-topologies-1209.10602015-03-20 https://scifaro.com/en/abs/explicit-tensors-of-border-rank-at-least-2n-1-1209.16642013-08-08 https://scifaro.com/en/abs/deciding-the-winner-of-an-arbitrary-finite-poset-game-is-pspace-complete-1209.17502015-03-20 https://scifaro.com/en/abs/quasi-polynomial-hitting-set-for-set-depth-delta-formulas-1209.23332012-09-12 https://scifaro.com/en/abs/quasipolynomial-time-identity-testing-of-non-commutative-and-read-once-oblivious-algebraic-branching-programs-1209.24082013-09-24 https://scifaro.com/en/abs/notes-on-random-reals-1209.28752012-09-14 https://scifaro.com/en/abs/polynomial-path-orders-a-maximal-model-1209.37932012-09-19 https://scifaro.com/en/abs/the-non-adaptive-query-complexity-of-testing-k-parities-1209.38492013-07-04 https://scifaro.com/en/abs/the-arithmetic-complexity-of-tensor-contractions-1209.48652012-09-24 https://scifaro.com/en/abs/probabilistic-verifiers-for-asymmetric-debates-1209.51922012-09-25 https://scifaro.com/en/abs/the-parameterized-complexity-of-domination-type-problems-and-application-to-linear-codes-1209.52672015-01-15 https://scifaro.com/en/abs/geometric-complexity-theory-v-efficient-algorithms-for-noether-normalization-1209.59932016-05-27 https://scifaro.com/en/abs/better-pseudorandom-generators-from-milder-pseudorandom-restrictions-1210.00492012-10-02 https://scifaro.com/en/abs/essential-convexity-and-complexity-of-semi-algebraic-constraints-1210.04202015-07-01 https://scifaro.com/en/abs/a-pseudorandom-generator-for-polynomial-threshold-functions-of-gaussian-with-subpolynomial-seed-length-1210.12802012-10-05 https://scifaro.com/en/abs/on-the-complexity-of-the-multivariate-resultant-1210.14512013-02-12 https://scifaro.com/en/abs/turing-patterns-with-turing-machines-emergence-and-low-level-structure-formation-1210.15722012-10-08 https://scifaro.com/en/abs/extensions-of-the-minimum-cost-homomorphism-problem-1210.22602012-10-09 https://scifaro.com/en/abs/the-discrete-strategy-improvement-algorithm-for-parity-games-and-complexity-measures-for-directed-graphs-1210.24592012-10-10 https://scifaro.com/en/abs/the-hardness-of-the-functional-orientation-2-color-problem-1210.25442013-04-24 https://scifaro.com/en/abs/improved-approximation-lower-bounds-for-vertex-cover-on-power-law-graphs-and-some-generalizations-1210.26982012-10-10 https://scifaro.com/en/abs/the-complexity-of-finite-valued-csps-1210.29872016-09-22 https://scifaro.com/en/abs/np-completeness-of-deciding-the-feasibility-of-linear-equations-over-binary-variables-with-coefficients-and-constants-that-are-0-1-or-1-1210.41202012-10-23 https://scifaro.com/en/abs/a-quantum-algorithm-for-solving-the-3-sat-problem-1210.43212012-10-19 https://scifaro.com/en/abs/on-efficient-constructions-of-short-lists-containing-mostly-ramsey-graphs-1210.44082012-10-17 https://scifaro.com/en/abs/an-improved-lower-bound-of-the-spark-with-application-1210.50832012-10-19 https://scifaro.com/en/abs/new-np-hardness-results-for-3-coloring-and-2-to-1-label-cover-1210.56482012-10-30 https://scifaro.com/en/abs/local-correction-with-constant-error-rate-1210.56772012-10-23 https://scifaro.com/en/abs/symmetric-determinantal-representations-in-characteristic-2-1210.58792013-06-06 https://scifaro.com/en/abs/synthesis-of-sup-interpretations-a-survey-1210.71362012-11-29 https://scifaro.com/en/abs/hypercomputation-towards-an-extension-of-the-classical-notion-of-computability-1210.71712012-10-29 https://scifaro.com/en/abs/a-dichotomy-theorem-for-homomorphism-polynomials-1210.76412012-10-30 https://scifaro.com/en/abs/an-atypical-survey-of-typical-case-heuristic-algorithms-1210.80992012-10-31 https://scifaro.com/en/abs/explicit-lower-bounds-via-geometric-complexity-theory-1210.83682013-03-19 https://scifaro.com/en/abs/randomness-and-non-determinism-1211.00712018-12-03 https://scifaro.com/en/abs/on-complexity-of-regular-realizability-problems-1211.06062013-01-01 https://scifaro.com/en/abs/hidden-cliques-and-the-certification-of-the-restricted-isometry-property-1211.06652012-11-06 https://scifaro.com/en/abs/majority-is-stablest-discrete-and-sos-1211.10012012-11-07 https://scifaro.com/en/abs/algorithms-and-hardness-for-robust-subspace-recovery-1211.10412013-12-05 https://scifaro.com/en/abs/a-prg-for-lipschitz-functions-of-polynomials-with-applications-to-sparsest-cut-1211.11092012-11-07 https://scifaro.com/en/abs/new-results-on-stabbing-segments-with-a-polygon-1211.14902014-06-23 https://scifaro.com/en/abs/on-the-parameterized-and-approximation-hardness-of-metric-dimension-1211.16362012-11-08 https://scifaro.com/en/abs/inverse-problems-in-approximate-uniform-generation-1211.17222012-11-09 https://scifaro.com/en/abs/approximability-and-proof-complexity-1211.19582012-11-09 https://scifaro.com/en/abs/lee-yang-theorems-and-the-complexity-of-computing-averages-1211.23762013-03-07 https://scifaro.com/en/abs/computational-aspects-of-nearly-single-peaked-electorates-1211.26272017-07-24 https://scifaro.com/en/abs/optimal-hitting-sets-for-combinatorial-shapes-1211.34392012-11-16 https://scifaro.com/en/abs/on-the-principal-impossibility-to-prove-p-np-1211.34922012-11-16 https://scifaro.com/en/abs/the-complexity-of-non-monotone-markets-1211.49182012-11-22 https://scifaro.com/en/abs/on-the-behavior-of-tile-assembly-system-at-high-temperatures-1211.49492012-11-22 https://scifaro.com/en/abs/a-note-on-kolmogorov-uspensky-machines-1211.55442012-11-26 https://scifaro.com/en/abs/online-vector-scheduling-and-generalized-load-balancing-1211.57292014-01-15 https://scifaro.com/en/abs/circuit-complexity-and-problem-structure-in-hamming-space-1211.57732018-05-30 https://scifaro.com/en/abs/on-the-rank-of-n-times-n-matrix-multiplication-1211.63202013-11-08 https://scifaro.com/en/abs/subexponential-and-fpt-time-inapproximability-of-independent-set-and-related-problems-1211.66562012-11-29 https://scifaro.com/en/abs/on-approximating-graph-bipartization-via-node-deletion-1211.67242012-12-03 https://scifaro.com/en/abs/the-power-of-choice-for-random-satisfiability-1211.69972012-12-03 https://scifaro.com/en/abs/euclidean-partitions-optimizing-noise-stability-1211.71382014-05-27 https://scifaro.com/en/abs/unshuffling-a-square-is-np-hard-1211.71612012-12-03 https://scifaro.com/en/abs/checking-generalized-debates-with-small-space-and-randomness-1211.73462012-12-03 https://scifaro.com/en/abs/finite-and-infinite-basis-in-p-and-np-1212.01912015-01-28 https://scifaro.com/en/abs/parameters-of-two-prover-one-round-game-and-the-hardness-of-connectivity-problems-1212.07522012-12-13 https://scifaro.com/en/abs/natural-proofs-versus-derandomization-1212.18912015-07-23 https://scifaro.com/en/abs/amortized-communication-complexity-of-an-equality-predicate-1212.19412012-12-12 https://scifaro.com/en/abs/the-complexity-of-planar-boolean-csp-with-complex-weights-1212.22842013-08-07 https://scifaro.com/en/abs/subtraction-makes-computing-integers-faster-1212.25492019-11-06 https://scifaro.com/en/abs/and-and-or-or-uniform-polynomial-size-circuits-1212.32822013-09-06 https://scifaro.com/en/abs/inapproximability-of-dominating-set-in-power-law-graphs-1212.35172012-12-17 https://scifaro.com/en/abs/every-locally-characterized-affine-invariant-property-is-testable-1212.38492013-01-18 https://scifaro.com/en/abs/sliding-windows-with-limited-storage-1212.43722013-09-19 https://scifaro.com/en/abs/a-satisfiability-algorithm-for-sparse-depth-two-threshold-circuits-1212.45482013-04-19 https://scifaro.com/en/abs/np-hardness-of-optimizing-the-sum-of-rational-linear-functions-over-an-asymptotic-linear-program-1212.50972012-12-21 https://scifaro.com/en/abs/hypercontractive-inequalities-via-sos-and-the-frankl-r-odl-graph-1212.53242016-03-03 https://scifaro.com/en/abs/short-lists-for-shortest-descriptions-in-short-time-1212.61042014-02-14 https://scifaro.com/en/abs/solvability-of-hornsat-and-cnfsat-1212.67252013-01-01 https://scifaro.com/en/abs/two-dimensional-kolmogorov-complexity-and-validation-of-the-coding-theorem-method-by-compressibility-1212.67452015-08-27 https://scifaro.com/en/abs/superlinear-lower-bounds-for-multipass-graph-processing-1212.69252016-02-10 https://scifaro.com/en/abs/the-odd-even-delta-problem-is-p-hard-1212.69352013-01-01 https://scifaro.com/en/abs/three-element-min-sol-and-conservative-min-cost-hom-1301.00272013-10-01 https://scifaro.com/en/abs/the-computational-landscape-of-permutation-patterns-1301.03402015-06-23 https://scifaro.com/en/abs/the-parameterized-complexity-of-some-permutation-group-problems-1301.03792013-01-18 https://scifaro.com/en/abs/moment-matching-polynomials-1301.08202013-01-07 https://scifaro.com/en/abs/on-lower-bound-methods-for-tree-like-cutting-plane-proofs-1301.08622013-01-08 https://scifaro.com/en/abs/pebbling-entropy-and-branching-program-size-lower-bounds-1301.14252013-11-19 https://scifaro.com/en/abs/short-lists-with-short-programs-in-short-time-1301.15472017-03-31 https://scifaro.com/en/abs/on-the-power-of-many-one-bit-provers-1301.27292013-01-15 https://scifaro.com/en/abs/a-characterization-of-approximation-resistance-for-even-k-partite-csps-1301.27312013-01-15 https://scifaro.com/en/abs/approximating-holant-problems-by-winding-1301.28802013-01-15 https://scifaro.com/en/abs/instruction-sequence-based-non-uniform-complexity-classes-1301.32972014-08-13 https://scifaro.com/en/abs/combinatorial-optimization-in-pattern-assembly-1301.37712013-01-17 https://scifaro.com/en/abs/one-round-multi-party-communication-complexity-of-distinguishing-sums-1301.42692013-01-22 https://scifaro.com/en/abs/on-the-logical-depth-function-1301.44512013-07-08 https://scifaro.com/en/abs/improved-hardness-of-approximating-chromatic-number-1301.52162013-02-05 https://scifaro.com/en/abs/a-direct-reduction-of-ppad-lemke-verified-linear-complementarity-problems-to-bimatrix-games-1302.00672013-02-04 https://scifaro.com/en/abs/a-strong-direct-product-theorem-for-the-tribes-function-via-the-smooth-rectangle-bound-1302.02752014-07-14 https://scifaro.com/en/abs/arthur-merlin-streaming-complexity-1302.04182013-02-05 https://scifaro.com/en/abs/on-the-dynamic-compressibility-of-sets-1302.04872013-02-05 https://scifaro.com/en/abs/orbit-problem-revisited-1302.05662013-09-20 https://scifaro.com/en/abs/a-combination-framework-for-complexity-1302.09732013-02-06 https://scifaro.com/en/abs/short-lists-with-short-programs-in-short-time-a-short-proof-1302.11092013-02-06 https://scifaro.com/en/abs/acquaintance-time-of-a-graph-1302.27872014-03-14 https://scifaro.com/en/abs/arithmetic-circuit-lower-bounds-via-maxrank-1302.33082013-02-15 https://scifaro.com/en/abs/lower-bounds-for-the-circuit-size-of-partially-homogeneous-polynomials-1302.33602017-08-03 https://scifaro.com/en/abs/on-polynomial-kernels-for-sparse-integer-linear-programs-1302.34942013-02-18 https://scifaro.com/en/abs/on-polynomial-kernels-for-integer-linear-programs-covering-packing-and-feasibility-1302.34962013-02-18 https://scifaro.com/en/abs/global-optimal-solutions-to-general-sensor-network-localization-problem-1302.36732013-11-22 https://scifaro.com/en/abs/a-composition-theorem-for-decision-tree-complexity-1302.42072013-02-19 https://scifaro.com/en/abs/model-checking-lower-bounds-for-simple-graphs-1302.42662015-07-01 https://scifaro.com/en/abs/on-the-sum-of-l1-influences-1302.46252014-04-15 https://scifaro.com/en/abs/on-the-complexity-of-barrier-resilience-for-fat-regions-1302.47072017-06-07 https://scifaro.com/en/abs/towards-randomized-testing-of-q-monomials-in-multivariate-polynomials-1302.58982013-08-14 https://scifaro.com/en/abs/dual-lower-bounds-for-approximate-degree-and-markov-bernstein-inequalities-1302.61912014-03-25 https://scifaro.com/en/abs/complexity-vs-energy-theory-of-computation-and-theoretical-physics-1302.66952015-06-15 https://scifaro.com/en/abs/qcsp-on-partially-reflexive-cycles-the-wavy-line-of-tractability-1303.00412013-03-04 https://scifaro.com/en/abs/explicit-noether-normalization-for-simultaneous-conjugation-via-polynomial-identity-testing-1303.00842013-03-11 https://scifaro.com/en/abs/monomial-testing-and-applications-1303.04782013-04-15 https://scifaro.com/en/abs/constant-unary-constraints-and-symmetric-real-weighted-counting-constraint-satisfaction-problems-1303.13472015-08-25 https://scifaro.com/en/abs/arithmetic-branching-programs-with-memory-1303.19692013-03-11 https://scifaro.com/en/abs/witness-of-unsatisfiability-for-a-random-3-satisfiability-formula-1303.24132013-07-29 https://scifaro.com/en/abs/proof-of-the-hypothesis-edmonds-s-not-polynomial-of-npc-problems-and-classification-of-the-problems-with-polynomial-certificates-1303.25802013-03-12 https://scifaro.com/en/abs/on-the-complexity-of-the-orbit-problem-1303.29812016-06-23 https://scifaro.com/en/abs/the-complexity-of-proving-that-a-graph-is-ramsey-1303.31662013-03-14 https://scifaro.com/en/abs/feedback-arc-set-problem-and-np-hardness-of-minimum-recurrent-configuration-problem-of-chip-firing-game-on-directed-graphs-1303.37082015-06-05 https://scifaro.com/en/abs/on-the-computational-complexity-of-data-flow-analysis-1303.43152024-09-13 https://scifaro.com/en/abs/computing-in-the-limit-1303.44082017-02-21 https://scifaro.com/en/abs/subgraphs-satisfying-mso-properties-on-z-topologically-orderable-digraphs-1303.44432013-06-18 https://scifaro.com/en/abs/projection-onto-the-cosparse-set-is-np-hard-1303.53052014-03-12 https://scifaro.com/en/abs/model-checking-for-modal-dependence-logic-an-approach-through-post-s-lattice-1303.64242013-03-27 https://scifaro.com/en/abs/new-inapproximability-bounds-for-tsp-1303.64372013-06-12 https://scifaro.com/en/abs/matchgates-revisited-1303.67292013-03-29 https://scifaro.com/en/abs/holographaic-alogorithms-on-bases-of-rank-2-1303.73612013-04-01 https://scifaro.com/en/abs/wang-s-b-machines-are-efficiently-universal-as-is-hasenjaeger-s-small-universal-electromechanical-toy-1304.00532014-08-06 https://scifaro.com/en/abs/evasive-properties-of-sparse-graphs-and-some-linear-equations-in-primes-1304.01882013-04-05 https://scifaro.com/en/abs/on-the-structure-of-boolean-functions-with-small-spectral-norm-1304.03712013-05-23 https://scifaro.com/en/abs/separating-or-sum-and-xor-circuits-1304.05132013-04-24 https://scifaro.com/en/abs/represent-mod-function-by-low-degree-polynomial-with-unbounded-one-sided-error-1304.07132013-04-03 https://scifaro.com/en/abs/timing-in-chemical-reaction-networks-1304.08722013-04-17 https://scifaro.com/en/abs/on-optimal-language-compression-for-sets-in-pspace-poly-1304.10052013-04-04 https://scifaro.com/en/abs/on-the-communication-complexity-of-sparse-set-disjointness-and-exists-equal-problems-1304.12172013-04-05 https://scifaro.com/en/abs/fourier-sparsity-spectral-norm-and-the-log-rank-conjecture-1304.12452013-04-10 https://scifaro.com/en/abs/on-the-structure-of-the-class-np-1304.13072016-03-03 https://scifaro.com/en/abs/a-composition-theorem-for-the-fourier-entropy-influence-conjecture-1304.13472013-04-05 https://scifaro.com/en/abs/intrinsic-universality-in-tile-self-assembly-requires-cooperation-1304.16792013-04-11 https://scifaro.com/en/abs/the-round-complexity-of-small-set-intersection-1304.17962013-04-10 https://scifaro.com/en/abs/on-the-subexponential-time-complexity-of-csp-1304.19962013-04-09 https://scifaro.com/en/abs/resolution-structure-in-hornsat-and-cnfsat-1304.20262013-04-09 https://scifaro.com/en/abs/the-h-index-can-be-easily-manipulated-1304.25572013-09-13 https://scifaro.com/en/abs/the-complexity-of-approximating-vertex-expansion-1304.31392013-11-12 https://scifaro.com/en/abs/a-modified-dna-computing-approach-to-tackle-the-exponential-solution-space-of-the-graph-coloring-problem-1304.35412013-04-15 https://scifaro.com/en/abs/annotations-for-sparse-data-streams-1304.38162013-04-16 https://scifaro.com/en/abs/all-sampling-methods-produce-outliers-1304.38722022-07-28 https://scifaro.com/en/abs/power-of-the-interactive-proof-systems-with-verifiers-modeled-by-semi-quantum-two-way-finite-automata-1304.38762015-05-05 https://scifaro.com/en/abs/leaderless-deterministic-chemical-reaction-networks-1304.45192013-04-17 https://scifaro.com/en/abs/small-bias-sets-for-nonabelian-groups-derandomizing-the-alon-roichman-theorem-1304.50102013-05-01 https://scifaro.com/en/abs/computational-irreducibility-and-computational-analogy-1304.52472013-10-15 https://scifaro.com/en/abs/complexity-classifications-for-logic-based-argumentation-1304.53882014-02-28 https://scifaro.com/en/abs/a-note-on-the-complexity-of-comparing-succinctly-represented-integers-with-an-application-to-maximum-probability-parsing-1304.54292014-04-08 https://scifaro.com/en/abs/local-backbones-1304.54792014-07-21 https://scifaro.com/en/abs/la-machine-alpha-mod-ele-g-en-erique-pour-les-algorithmes-naturels-1304.56042013-04-23 https://scifaro.com/en/abs/another-asymptotic-notation-almost-1304.56172015-10-20 https://scifaro.com/en/abs/improved-bounds-for-reduction-to-depth-4-and-depth-3-1304.57772014-05-19 https://scifaro.com/en/abs/improved-complexity-results-on-k-coloring-p-t-free-graphs-1304.58082013-10-07 https://scifaro.com/en/abs/on-fixed-polynomial-size-circuit-lower-bounds-for-uniform-polynomials-in-the-sense-of-valiant-1304.59102013-04-23 https://scifaro.com/en/abs/on-partial-vertex-cover-on-bipartite-graphs-and-trees-1304.59342013-04-23 https://scifaro.com/en/abs/unifying-and-generalizing-known-lower-bounds-via-geometric-complexity-theory-1304.63332017-09-07 https://scifaro.com/en/abs/distance-sensitive-property-testing-lower-bounds-1304.66852013-08-28 https://scifaro.com/en/abs/approximation-hardness-of-graphic-tsp-on-cubic-graphs-1304.68002013-05-15 https://scifaro.com/en/abs/staged-self-assembly-and-polyomino-context-free-grammars-1304.70382013-07-02 https://scifaro.com/en/abs/computing-higher-homotopy-groups-is-w-1-hard-1304.77052013-04-30 https://scifaro.com/en/abs/complexity-theory-for-operators-in-analysis-1305.04532013-05-03 https://scifaro.com/en/abs/equations-for-lower-bounds-on-border-rank-1305.07792013-07-10 https://scifaro.com/en/abs/sparser-random-3sat-refutation-algorithms-and-the-interpolation-problem-1305.09482014-05-20 https://scifaro.com/en/abs/a-collapse-theorem-for-holographic-algorithms-with-matchgates-on-domain-size-at-most-4-1305.14092013-05-21 https://scifaro.com/en/abs/analytical-approach-to-parallel-repetition-1305.19792014-07-08 https://scifaro.com/en/abs/on-the-reduction-of-the-csp-dichotomy-conjecture-to-digraphs-1305.20392013-08-05 https://scifaro.com/en/abs/inapproximability-for-antiferromagnetic-spin-systems-in-the-tree-non-uniqueness-region-1305.29022014-11-05 https://scifaro.com/en/abs/cancellation-free-circuits-in-unbounded-and-bounded-depth-1305.30412014-10-20 https://scifaro.com/en/abs/fpt-is-characterized-by-useful-obstruction-sets-1305.31022013-05-15 https://scifaro.com/en/abs/computing-cliques-is-intractable-1305.32182013-10-23 https://scifaro.com/en/abs/on-the-existence-of-0-1-polytopes-with-high-semidefinite-extension-complexity-1305.32682013-12-04 https://scifaro.com/en/abs/on-structural-parameterizations-for-the-2-club-problem-1305.37352013-05-17 https://scifaro.com/en/abs/3sum-3xor-triangles-1305.38272013-05-17 https://scifaro.com/en/abs/an-exponential-lower-bound-for-cunningham-s-rule-1305.39442013-05-20 https://scifaro.com/en/abs/computability-vs-nondeterministic-and-p-vs-np-1305.40292015-01-09 https://scifaro.com/en/abs/the-unique-games-conjecture-integrality-gap-for-cut-problems-and-embeddability-of-negative-type-metrics-into-ell-1-1305.45812013-05-21 https://scifaro.com/en/abs/a-lower-bound-for-fourier-transform-computation-in-a-linear-model-over-2x2-unitary-gates-using-matrix-entropy-1305.47452013-05-22 https://scifaro.com/en/abs/a-characterization-of-approximation-resistance-1305.55002013-10-24 https://scifaro.com/en/abs/the-promise-polynomial-hierarchy-1305.55612013-07-31 https://scifaro.com/en/abs/computing-with-and-without-arbitrary-large-numbers-1305.57132013-05-27 https://scifaro.com/en/abs/complexity-classes-as-mathematical-axioms-ii-1305.60762016-07-01 https://scifaro.com/en/abs/the-complexity-of-approximately-counting-tree-homomorphisms-1305.63062014-06-16 https://scifaro.com/en/abs/fractional-pebbling-game-lower-bounds-1305.63762013-05-29 https://scifaro.com/en/abs/the-complexity-of-the-proper-orientation-number-1305.64322014-06-09 https://scifaro.com/en/abs/domino-tatami-covering-is-np-complete-1305.66692013-05-30 https://scifaro.com/en/abs/lower-bounds-for-rams-and-quantifier-elimination-1306.01532013-06-04 https://scifaro.com/en/abs/classical-hardness-of-learning-with-errors-1306.02812013-06-04 https://scifaro.com/en/abs/the-ram-equivalent-of-p-vs-rp-1306.04002013-10-01 https://scifaro.com/en/abs/composition-limits-and-separating-examples-for-some-boolean-function-complexity-measures-1306.06302013-06-05 https://scifaro.com/en/abs/estimating-the-distance-from-testable-affine-invariant-properties-1306.06492013-06-05 https://scifaro.com/en/abs/some-properties-are-not-even-partially-testable-1306.13602013-06-07 https://scifaro.com/en/abs/communication-is-bounded-by-root-of-rank-1306.18772013-10-09 https://scifaro.com/en/abs/paradigms-for-parameterized-enumeration-1306.21712013-06-11 https://scifaro.com/en/abs/metric-dimension-for-gabriel-unit-disk-graphs-is-np-complete-1306.21872013-06-11 https://scifaro.com/en/abs/multi-parameter-complexity-analysis-for-constrained-size-graph-problems-using-greediness-for-parameterization-1306.22172013-06-11 https://scifaro.com/en/abs/generalization-of-boole-shannon-expansion-consistency-of-boolean-equations-and-elimination-by-orthonormal-expansion-1306.24842013-12-06 https://scifaro.com/en/abs/pseudorandomness-for-regular-branching-programs-via-fourier-analysis-1306.30042013-06-21 https://scifaro.com/en/abs/the-straight-line-complexity-of-small-factorials-and-primorials-1306.30912014-12-16 https://scifaro.com/en/abs/3-color-bounded-patterned-self-assembly-1306.32572013-06-17 https://scifaro.com/en/abs/a-note-on-scheduling-with-low-rank-processing-times-1306.37272013-06-18 https://scifaro.com/en/abs/truth-table-minimization-of-computational-models-1306.37662013-06-18 https://scifaro.com/en/abs/satisfiability-algorithms-for-restricted-circuit-classes-1306.40292013-06-19 https://scifaro.com/en/abs/computation-in-anonymous-networks-1306.41512013-06-19 https://scifaro.com/en/abs/new-upper-bound-on-block-sensitivity-and-certificate-complexity-in-terms-of-sensitivity-1306.44662013-06-25 https://scifaro.com/en/abs/counting-list-matrix-partitions-of-graphs-1306.51762015-04-20 https://scifaro.com/en/abs/the-fine-classification-of-conjunctive-queries-and-parameterized-logarithmic-space-complexity-1306.54242013-06-26 https://scifaro.com/en/abs/a-more-complicated-hardness-proof-for-finding-densest-subgraphs-in-bounded-degree-graphs-1306.65982013-06-28 https://scifaro.com/en/abs/rational-series-and-asymptotic-expansion-for-linear-homogeneous-divide-and-conquer-recurrences-1307.01892013-07-02 https://scifaro.com/en/abs/the-complexity-of-counting-homomorphisms-to-cactus-graphs-modulo-2-1307.05562014-09-29 https://scifaro.com/en/abs/strong-equivalence-of-reversible-circuits-is-conp-complete-1307.08362016-10-17 https://scifaro.com/en/abs/representing-boolean-functions-using-polynomials-more-can-offer-less-1307.11572013-07-05 https://scifaro.com/en/abs/one-hierarchy-spawns-another-graph-deconstructions-and-the-complexity-classification-of-conjunctive-queries-1307.13532016-03-02 https://scifaro.com/en/abs/randomness-conservation-over-algorithms-1307.31842013-10-15 https://scifaro.com/en/abs/a-reduction-of-3-sat-problem-to-buchberger-algorithm-1307.36822013-07-16 https://scifaro.com/en/abs/algebraic-complexity-classes-1307.38632013-12-10 https://scifaro.com/en/abs/pebble-games-proof-complexity-and-time-space-trade-offs-1307.39132015-07-01 https://scifaro.com/en/abs/some-improvements-to-total-degree-tests-1307.39752013-07-16 https://scifaro.com/en/abs/an-alternative-proof-of-the-exponential-monotone-complexity-of-the-clique-function-1307.43082013-09-10 https://scifaro.com/en/abs/on-the-complexity-of-a-matching-problem-with-asymmetric-weights-1307.44202013-07-22 https://scifaro.com/en/abs/small-depth-proof-systems-1307.48972013-07-19 https://scifaro.com/en/abs/hard-asymptotic-sets-for-one-dimensional-cellular-automata-1307.49102013-07-19 https://scifaro.com/en/abs/on-the-np-hardness-of-approximating-ordering-constraint-satisfaction-problems-1307.50902013-07-22 https://scifaro.com/en/abs/the-complexity-of-reachability-problems-for-flat-counter-machines-with-periodic-loops-1307.53212016-02-16 https://scifaro.com/en/abs/an-exact-algorithm-for-1-in-3-sat-1307.57762013-07-30 https://scifaro.com/en/abs/computability-of-probability-distributions-and-characteristic-functions-1307.63572015-07-01 https://scifaro.com/en/abs/fixed-parameter-complexity-and-approximability-of-norm-maximization-1307.64142013-07-25 https://scifaro.com/en/abs/generalized-wong-sequences-and-their-applications-to-edmonds-problems-1307.64292014-06-27 https://scifaro.com/en/abs/efficient-quantum-protocols-for-xor-functions-1307.67382013-07-26 https://scifaro.com/en/abs/spin-glass-approach-to-the-feedback-vertex-set-problem-1307.69482014-04-22 https://scifaro.com/en/abs/association-schemes-non-commutative-polynomial-concentration-and-sum-of-squares-lower-bounds-for-planted-clique-1307.76152013-11-14 https://scifaro.com/en/abs/space-complexity-of-list-h-colouring-a-dichotomy-1308.01802013-08-02 https://scifaro.com/en/abs/on-kolmogorov-complexity-of-random-very-long-braided-words-1308.02112013-08-20 https://scifaro.com/en/abs/a-note-reviewing-turing-s-1936-1308.04972025-11-06 https://scifaro.com/en/abs/computational-complexity-of-the-minimum-cost-homomorphism-problem-on-three-element-domains-1308.13942013-10-01 https://scifaro.com/en/abs/the-parameterised-complexity-of-counting-connected-subgraphs-and-graph-motifs-1308.15752014-11-17 https://scifaro.com/en/abs/depth-4-lower-bounds-determinantal-complexity-a-unified-approach-1308.16402013-11-18 https://scifaro.com/en/abs/improved-lower-bounds-for-testing-triangle-freeness-in-boolean-functions-via-fast-matrix-multiplication-1308.16432013-08-08 https://scifaro.com/en/abs/a-tau-conjecture-for-newton-polygons-1308.22862014-05-14 https://scifaro.com/en/abs/on-the-parameterized-complexity-of-reconfiguration-problems-1308.24092013-08-23 https://scifaro.com/en/abs/exponential-quantum-classical-gaps-in-multiparty-nondeterministic-communication-complexity-1308.24502013-08-20 https://scifaro.com/en/abs/independent-set-induced-matching-and-pricing-connections-and-tight-subexponential-time-approximation-hardnesses-1308.26172013-08-20 https://scifaro.com/en/abs/completeness-results-for-parameterized-space-classes-1308.28922013-08-14 https://scifaro.com/en/abs/gap-theorems-for-the-delay-of-circuits-simulating-finite-automata-1308.29702013-08-15 https://scifaro.com/en/abs/hardness-of-finding-independent-sets-in-2-colorable-and-almost-2-colorable-hypergraphs-1308.32472013-10-08 https://scifaro.com/en/abs/polynomial-kernels-collapse-the-w-hierarchy-1308.36132013-08-19 https://scifaro.com/en/abs/on-sparsification-for-computing-treewidth-1308.36652013-08-19 https://scifaro.com/en/abs/locally-testable-codes-and-cayley-graphs-1308.51582013-08-26 https://scifaro.com/en/abs/algorithmic-randomness-and-ramsey-properties-of-countable-homogeneous-structures-1308.55062013-08-27 https://scifaro.com/en/abs/tree-codes-and-a-conjecture-on-exponential-sums-1308.60072013-12-11 https://scifaro.com/en/abs/oracle-tractability-of-skew-bisubmodular-functions-1308.65052013-08-30 https://scifaro.com/en/abs/algorithms-versus-circuit-lower-bounds-1309.02492013-09-03 https://scifaro.com/en/abs/a-new-kind-of-complexity-1309.02962020-02-25 https://scifaro.com/en/abs/approximate-constraint-satisfaction-requires-large-lp-relaxations-1309.05632016-02-09 https://scifaro.com/en/abs/threefold-post-correspondence-system-1309.06332013-09-04 https://scifaro.com/en/abs/randomness-efficient-curve-samplers-1309.10892013-09-05 https://scifaro.com/en/abs/topology-and-non-deterministic-polynomial-time-computation-avoidance-of-the-misbehaviour-of-hub-free-diagrams-and-consequences-1309.12692013-09-06 https://scifaro.com/en/abs/satisfiability-of-cross-product-terms-is-complete-for-real-nondeterministic-polytime-blum-shub-smale-machines-1309.12702013-09-06 https://scifaro.com/en/abs/fractal-dimension-versus-process-complexity-1309.17792016-08-24 https://scifaro.com/en/abs/ultimate-positivity-is-decidable-for-simple-linear-recurrence-sequences-1309.19142017-04-07 https://scifaro.com/en/abs/determinant-versus-permanent-salvation-via-generalization-the-algebraic-complexity-of-the-fermionant-and-the-immanant-1309.21562013-09-10 https://scifaro.com/en/abs/the-average-sensitivity-of-an-intersection-of-half-spaces-1309.29872015-01-28 https://scifaro.com/en/abs/on-sat-representations-of-xor-constraints-1309.30602014-06-24 https://scifaro.com/en/abs/element-distinctness-frequency-moments-and-sliding-windows-1309.36902013-09-17 https://scifaro.com/en/abs/problem-complexity-research-from-energy-perspective-1309.39752014-12-04 https://scifaro.com/en/abs/the-complexity-of-parity-graph-homomorphism-an-initial-investigation-1309.40332013-09-17 https://scifaro.com/en/abs/dynamic-vs-oblivious-routing-in-network-design-1309.41402013-09-18 https://scifaro.com/en/abs/parameterized-exact-and-approximation-algorithms-for-maximum-k-set-cover-and-related-satisfiability-problems-1309.47182016-09-28 https://scifaro.com/en/abs/log-space-counter-is-useful-for-unary-languages-by-help-of-a-constant-size-quantum-register-1309.47672013-09-25 https://scifaro.com/en/abs/parameterized-enumeration-with-ordering-1309.50092013-10-08 https://scifaro.com/en/abs/new-algorithms-for-solving-tropical-linear-systems-1309.52062013-09-23 https://scifaro.com/en/abs/linear-kernels-for-k-tuple-and-liar-s-domination-in-bounded-genus-graphs-1309.54612014-08-19 https://scifaro.com/en/abs/pseudorandomness-for-multilinear-read-once-algebraic-branching-programs-in-any-order-1309.56682013-09-24 https://scifaro.com/en/abs/on-regular-sets-of-bounds-and-determinism-versus-nondeterminism-1309.58622013-09-24 https://scifaro.com/en/abs/playing-with-parameters-structural-parameterization-in-graphs-1309.61442013-10-14 https://scifaro.com/en/abs/quasi-decidability-of-a-fragment-of-the-first-order-theory-of-real-numbers-1309.62802016-08-15 https://scifaro.com/en/abs/exploring-programmable-self-assembly-in-non-dna-based-molecular-computing-1309.64492013-09-26 https://scifaro.com/en/abs/the-computational-complexity-of-the-game-of-set-and-its-theoretical-applications-1309.65042013-09-26 https://scifaro.com/en/abs/on-the-complexity-of-reconstructing-chemical-reaction-networks-1309.71982013-09-30 https://scifaro.com/en/abs/small-polynomial-time-universal-petri-nets-1309.72882013-09-30 https://scifaro.com/en/abs/on-the-tape-number-problem-for-deterministic-time-classes-1309.74572013-10-01 https://scifaro.com/en/abs/communication-complexity-of-promise-problems-and-their-applications-to-finite-automata-1309.77392013-10-01 https://scifaro.com/en/abs/on-the-optimality-of-approximation-schemes-for-the-classical-scheduling-problem-1310.03982013-10-02 https://scifaro.com/en/abs/the-sat-unsat-transition-in-the-adversarial-sat-problem-1310.09672014-04-02 https://scifaro.com/en/abs/complexity-of-linear-circuits-and-geometry-1310.13622015-03-11 https://scifaro.com/en/abs/gap-amplification-for-small-set-expansion-via-random-walks-1310.14932014-07-03 https://scifaro.com/en/abs/on-the-intersection-of-a-sparse-curve-and-a-low-degree-curve-a-polynomial-version-of-the-lost-theorem-1310.24472014-07-24 https://scifaro.com/en/abs/fixed-parameter-inapproximability-for-clique-and-setcover-in-time-super-exponential-in-opt-1310.27112013-12-06 https://scifaro.com/en/abs/a-quantum-lower-bound-for-distinguishing-random-functions-from-random-permutations-1310.28852013-12-23 https://scifaro.com/en/abs/evaluation-of-dnf-formulas-1310.36732014-10-09 https://scifaro.com/en/abs/weak-bases-of-boolean-co-clones-1310.36742013-10-15 https://scifaro.com/en/abs/topological-additive-numbering-of-directed-acyclic-graphs-1310.41412017-10-27 https://scifaro.com/en/abs/arbitrary-sequence-rams-1310.45882013-10-18 https://scifaro.com/en/abs/mupad-codes-which-implement-limit-computable-functions-that-cannot-be-bounded-by-any-computable-function-1310.53632014-10-09 https://scifaro.com/en/abs/parameterized-in-approximability-of-subset-problems-1310.55762013-10-22 https://scifaro.com/en/abs/short-mathsf-res-mathsf-polylog-refutations-if-and-only-if-narrow-mathsf-res-refutations-1310.57142013-10-23 https://scifaro.com/en/abs/trading-inference-effort-versus-size-in-cnf-knowledge-compilation-1310.57462013-11-11 https://scifaro.com/en/abs/computing-in-permutation-groups-without-memory-1310.60082013-10-23 https://scifaro.com/en/abs/computing-in-matrix-groups-without-memory-1310.60092013-10-23 https://scifaro.com/en/abs/the-frequent-paucity-of-trivial-strings-1310.63832014-05-08 https://scifaro.com/en/abs/some-remarks-on-lower-bounds-for-queue-machines-preliminary-report-1310.63982018-03-13 https://scifaro.com/en/abs/some-hard-families-of-parameterised-counting-problems-1310.65242014-09-26 https://scifaro.com/en/abs/on-logical-depth-and-the-running-time-of-shortest-programs-1310.69762013-10-28 https://scifaro.com/en/abs/rank-and-fooling-set-size-1310.73212013-10-29 https://scifaro.com/en/abs/hardness-measures-and-resolution-lower-bounds-1310.76272014-02-18 https://scifaro.com/en/abs/b-coloring-is-np-hard-on-co-bipartite-graphs-and-polytime-solvable-on-tree-cographs-1310.83132023-04-04 https://scifaro.com/en/abs/power-of-nondetreministic-jags-on-cayley-graphs-1310.83172013-11-01 https://scifaro.com/en/abs/pebbling-arguments-for-tree-evaluation-1311.02932013-11-05 https://scifaro.com/en/abs/hardness-amplification-and-the-approximate-degree-of-constant-depth-circuits-1311.16162014-04-29 https://scifaro.com/en/abs/relating-and-contrasting-plain-and-prefix-kolmogorov-complexity-1311.20922014-05-08 https://scifaro.com/en/abs/communication-lower-bounds-via-critical-block-sensitivity-1311.23552016-07-12 https://scifaro.com/en/abs/derandomizing-polynomial-identity-over-finite-fields-implies-super-polynomial-circuit-lower-bounds-for-nexp-1311.23582013-11-12 https://scifaro.com/en/abs/the-matching-polytope-has-exponential-extension-complexity-1311.23692017-03-21 https://scifaro.com/en/abs/breaking-the-ppsz-barrier-for-unique-3-sat-1311.25132014-02-18 https://scifaro.com/en/abs/losing-weight-by-gaining-edges-1311.30542015-11-26 https://scifaro.com/en/abs/local-reductions-1311.31712014-04-09 https://scifaro.com/en/abs/advancements-on-sefe-and-partitioned-book-embedding-problems-1311.36072014-04-29 https://scifaro.com/en/abs/deterministic-primality-testing-understanding-the-aks-algorithm-1311.37852013-11-18 https://scifaro.com/en/abs/average-case-polyhedral-complexity-of-the-maximum-stable-set-problem-1311.40012016-10-26 https://scifaro.com/en/abs/the-power-of-linear-programming-for-general-valued-csps-1311.42192015-11-24 https://scifaro.com/en/abs/bis-hardness-for-2-spin-systems-on-bipartite-bounded-degree-graphs-in-the-tree-nonuniqueness-region-1311.44512016-05-30 https://scifaro.com/en/abs/on-the-complexity-of-random-satisfiability-problems-with-planted-solutions-1311.48212018-03-07 https://scifaro.com/en/abs/ferromagnetic-potts-model-refined-bis-hardness-and-related-results-1311.48392016-09-15 https://scifaro.com/en/abs/algorithmic-regularity-for-polynomials-and-applications-1311.50902013-11-21 https://scifaro.com/en/abs/breaking-the-quadratic-barrier-for-3-lccs-over-the-reals-1311.51022013-11-21 https://scifaro.com/en/abs/computational-complexity-of-smooth-differential-equations-1311.54142015-07-01 https://scifaro.com/en/abs/challenges-in-computational-lower-bounds-1311.54672013-11-22 https://scifaro.com/en/abs/improved-extractors-for-affine-lines-1311.56222013-12-05 https://scifaro.com/en/abs/the-ergodicity-of-the-collatz-process-in-positive-integer-field-1311.56902013-11-25 https://scifaro.com/en/abs/ordered-biclique-partitions-and-communication-complexity-problems-1311.61922013-12-30 https://scifaro.com/en/abs/a-deterministic-polynomial-space-construction-for-eps-nets-under-any-norm-1311.66712013-12-04 https://scifaro.com/en/abs/the-limits-of-depth-reduction-for-arithmetic-formulas-it-s-all-about-the-top-fan-in-1311.67162013-11-27 https://scifaro.com/en/abs/deterministic-approximate-counting-for-degree-2-polynomial-threshold-functions-1311.71052013-11-28 https://scifaro.com/en/abs/deterministic-approximate-counting-for-juntas-of-degree-2-polynomial-threshold-functions-1311.71152013-11-28 https://scifaro.com/en/abs/efficient-deterministic-approximate-counting-for-low-degree-polynomial-threshold-functions-1311.71782013-12-02 https://scifaro.com/en/abs/hierarchies-1311.72292013-12-02 https://scifaro.com/en/abs/linear-list-approximation-for-short-programs-or-the-power-of-a-few-random-bits-1311.72782015-01-21 https://scifaro.com/en/abs/super-polylogarithmic-hypergraph-coloring-hardness-via-low-degree-long-codes-1311.74072017-03-09 https://scifaro.com/en/abs/weak-parity-1312.00362013-12-03 https://scifaro.com/en/abs/formulas-vs-circuits-for-small-distance-connectivity-1312.03552013-12-03 https://scifaro.com/en/abs/verifying-whether-one-tape-non-deterministic-turing-machines-run-in-time-cn-d-1312.04962019-08-20 https://scifaro.com/en/abs/a-note-on-the-quantum-collision-and-set-equality-problems-1312.10272013-12-12 https://scifaro.com/en/abs/the-self-assembly-of-paths-and-squares-at-temperature-1-1312.12992013-12-10 https://scifaro.com/en/abs/vertex-disjoint-path-in-upward-planar-graphs-1312.15262013-12-06 https://scifaro.com/en/abs/the-parameterized-complexity-of-reasoning-problems-beyond-np-1312.16722016-07-04 https://scifaro.com/en/abs/on-the-relation-generation-method-of-joux-for-computing-discrete-logarithms-1312.16742013-12-24 https://scifaro.com/en/abs/upper-semicomputable-sumtests-for-lower-semicomputable-semimeasures-1312.17182013-12-09 https://scifaro.com/en/abs/hitting-sets-for-low-distance-multilinear-depth-3-1312.18262013-12-09 https://scifaro.com/en/abs/satisfiability-and-evolution-1312.19832014-08-13 https://scifaro.com/en/abs/hierarchical-complexity-of-2-clique-colouring-weakly-chordal-graphs-and-perfect-graphs-having-cliques-of-size-at-least-3-1312.20862013-12-12 https://scifaro.com/en/abs/dynamic-complexity-of-planar-3-connected-graph-isomorphism-1312.21412013-12-10 https://scifaro.com/en/abs/a-composition-theorem-for-parity-kill-number-1312.21432013-12-10 https://scifaro.com/en/abs/high-dimensional-expanders-and-property-testing-1312.23672013-12-10 https://scifaro.com/en/abs/a-protocol-for-generating-random-elements-with-their-probabilities-1312.24832014-03-25 https://scifaro.com/en/abs/a-new-view-on-worst-case-to-average-case-reductions-for-np-problems-1312.24902014-03-25 https://scifaro.com/en/abs/hardness-of-finding-independent-sets-in-2-colorable-hypergraphs-and-of-satisfiable-csps-1312.29152013-12-11 https://scifaro.com/en/abs/decision-trees-protocols-and-the-fourier-entropy-influence-conjecture-1312.30032013-12-12 https://scifaro.com/en/abs/iterated-group-products-and-leakage-resilience-against-nc-1-1312.31932013-12-12 https://scifaro.com/en/abs/robust-optimization-with-incremental-recourse-1312.40752013-12-17 https://scifaro.com/en/abs/on-constraint-satisfaction-problems-below-p-1312.44282013-12-18 https://scifaro.com/en/abs/a-computational-trichotomy-for-connectivity-of-boolean-satisfiability-1312.45242015-10-27 https://scifaro.com/en/abs/logics-for-complexity-classes-1312.46522014-11-25 https://scifaro.com/en/abs/complexity-hierarchies-beyond-elementary-1312.56862016-02-05 https://scifaro.com/en/abs/on-the-dynamic-width-of-the-3-colorability-problem-1312.59372014-02-18 https://scifaro.com/en/abs/superpolynomial-lower-bounds-for-general-homogeneous-depth-4-arithmetic-circuits-1312.59782013-12-23 https://scifaro.com/en/abs/generating-matrix-identities-and-proof-complexity-1312.62422014-09-04 https://scifaro.com/en/abs/a-pumping-lemma-for-non-cooperative-self-assembly-1312.66682015-07-31 https://scifaro.com/en/abs/the-connectivity-of-boolean-satisfiability-dichotomies-for-formulas-and-circuits-1312.66792015-10-27 https://scifaro.com/en/abs/approximating-quadratic-0-1-programming-via-socp-1312.70422013-12-30 https://scifaro.com/en/abs/algorithmic-perspectives-of-network-transitive-reduction-problems-and-their-applications-to-synthesis-and-analysis-of-biological-networks-1312.73062013-12-30 https://scifaro.com/en/abs/tree-width-and-logspace-determinants-and-counting-euler-tours-1312.74682014-01-03 https://scifaro.com/en/abs/reachability-in-cooperating-systems-with-architectural-constraints-is-pspace-complete-1312.76152013-12-31 https://scifaro.com/en/abs/on-the-limits-of-depth-reduction-at-depth-3-over-small-finite-fields-1401.01892014-01-03 https://scifaro.com/en/abs/graph-isomorphism-and-the-lasserre-hierarchy-1401.07582016-10-31 https://scifaro.com/en/abs/progress-on-polynomial-identity-testing-ii-1401.09762014-01-07 https://scifaro.com/en/abs/on-symmetric-circuits-and-fixed-point-logics-1401.11252014-01-07 https://scifaro.com/en/abs/hardness-of-robust-graph-isomorphism-lasserre-gaps-and-asymmetry-of-random-graphs-1401.24362014-01-13 https://scifaro.com/en/abs/new-algorithms-and-lower-bounds-for-circuits-with-linear-threshold-gates-1401.24442014-01-13 https://scifaro.com/en/abs/parameterized-complexity-of-edge-interdiction-problems-1401.25322014-01-14 https://scifaro.com/en/abs/function-spaces-for-second-order-polynomial-time-1401.28612015-10-28 https://scifaro.com/en/abs/lines-missing-every-random-point-1401.30632014-07-25 https://scifaro.com/en/abs/turing-minimalism-and-the-emergence-of-complexity-1401.36132014-08-01 https://scifaro.com/en/abs/2-3-quantified-boolean-formula-games-and-their-complexities-1401.36872014-12-31 https://scifaro.com/en/abs/testing-equivalence-of-polynomials-under-shifts-1401.37142014-02-20 https://scifaro.com/en/abs/a-quadratically-tight-partition-bound-for-classical-communication-complexity-and-query-complexity-1401.45122014-01-21 https://scifaro.com/en/abs/on-the-computing-power-of-and-times-1401.48792014-04-16 https://scifaro.com/en/abs/0-1-integer-linear-programming-with-a-linear-number-of-constraints-1401.55122014-02-20 https://scifaro.com/en/abs/partition-expanders-1401.57812022-03-30 https://scifaro.com/en/abs/tractable-triangles-and-cross-free-convexity-in-discrete-optimisation-1401.58552014-01-24 https://scifaro.com/en/abs/the-effective-solving-of-the-tasks-from-np-by-a-quantum-computer-1401.60302014-12-10 https://scifaro.com/en/abs/affine-extractors-over-large-fields-with-exponential-error-1401.61892014-01-27 https://scifaro.com/en/abs/hypergraph-acyclicity-and-propositional-model-counting-1401.63072014-01-27 https://scifaro.com/en/abs/approximation-resistance-by-disguising-biased-distributions-1401.65202015-11-10 https://scifaro.com/en/abs/am-with-multiple-merlins-1401.68482014-01-28 https://scifaro.com/en/abs/np-is-contained-in-dtime-n-o-log-gamma-1401.74802022-06-10 https://scifaro.com/en/abs/remarks-on-aks-primality-testing-algorithm-and-a-flaw-in-the-definition-of-p-1402.01462014-02-04 https://scifaro.com/en/abs/finding-optimal-strategies-of-almost-acyclic-simple-stochatic-games-1402.04712014-08-10 https://scifaro.com/en/abs/approximate-computation-of-dft-without-performing-any-multiplications-applications-to-radar-signal-processing-1402.05322014-02-05 https://scifaro.com/en/abs/robust-satisfiability-of-systems-of-equations-1402.08582014-02-05 https://scifaro.com/en/abs/checking-the-strict-positivity-of-kraus-maps-is-np-hard-1402.14292014-02-07 https://scifaro.com/en/abs/how-fast-can-we-multiply-large-integers-on-an-actual-computer-1402.18112014-02-11 https://scifaro.com/en/abs/a-characterization-of-locally-testable-affine-invariant-properties-via-decomposition-theorems-1402.21752014-02-11 https://scifaro.com/en/abs/computational-limits-for-matrix-completion-1402.23312014-04-11 https://scifaro.com/en/abs/sparsification-and-subexponential-approximation-1402.28432014-02-17 https://scifaro.com/en/abs/inequalities-and-tail-bounds-for-elementary-symmetric-polynomial-with-applications-1402.35432015-08-12 https://scifaro.com/en/abs/proof-complexity-and-the-kneser-lov-asz-theorem-1402.43382018-05-16 https://scifaro.com/en/abs/the-complexity-of-ferromagnetic-two-spin-systems-with-external-fields-1402.43462014-02-19 https://scifaro.com/en/abs/on-coloring-resilient-graphs-1402.43762014-06-13 https://scifaro.com/en/abs/on-the-isomorphism-problem-for-helly-circular-arc-graphs-1402.46422017-04-20 https://scifaro.com/en/abs/vertex-cover-reconfiguration-and-beyond-1402.49262020-12-11 https://scifaro.com/en/abs/a-tight-lower-bound-on-certificate-complexity-in-terms-of-block-sensitivity-and-sensitivity-1402.50782015-03-27 https://scifaro.com/en/abs/on-the-power-of-multiplexing-in-number-on-the-forehead-protocols-1402.53112014-02-24 https://scifaro.com/en/abs/circulant-graphs-and-gcd-and-lcm-of-subsets-1402.54492014-02-25 https://scifaro.com/en/abs/the-challenges-of-unbounded-treewidth-in-parameterised-subgraph-counting-problems-1402.58572015-06-01 https://scifaro.com/en/abs/a-generalization-of-extension-complexity-that-captures-p-1402.59502014-04-14 https://scifaro.com/en/abs/computing-discrete-logarithms-in-subfields-of-residue-class-rings-1402.66582014-02-27 https://scifaro.com/en/abs/an-improved-interactive-streaming-algorithm-for-the-distinct-elements-problem-1402.68002014-02-28 https://scifaro.com/en/abs/lower-bounds-for-approximate-ldc-1402.69522014-02-28 https://scifaro.com/en/abs/on-the-complexity-of-computing-two-nonlinearity-measures-1403.04172014-03-04 https://scifaro.com/en/abs/algebraic-properties-of-valued-constraint-satisfaction-problem-1403.04762016-05-03 https://scifaro.com/en/abs/limits-to-the-scope-of-applicability-of-extended-formulations-for-lp-models-of-combinatorial-optimization-problems-a-summary-1403.05292016-10-21 https://scifaro.com/en/abs/an-n-log-n-lower-bound-for-fourier-transform-computation-in-the-well-conditioned-model-1403.13072014-07-25 https://scifaro.com/en/abs/candy-crush-is-np-hard-1403.19112014-03-11 https://scifaro.com/en/abs/minimal-tsp-tour-is-conp-complete-1403.34312014-03-24 https://scifaro.com/en/abs/parameterized-inapproximability-of-target-set-selection-and-generalizations-1403.35652015-06-11 https://scifaro.com/en/abs/organization-mechanism-and-counting-algorithm-on-vertex-cover-solutions-1403.40102015-06-19 https://scifaro.com/en/abs/p-is-not-equal-to-np-by-modus-tollens-1403.41432018-10-12 https://scifaro.com/en/abs/occam-bound-on-lowest-complexity-of-elements-1403.45392018-12-03 https://scifaro.com/en/abs/yet-another-graph-partitioning-problem-is-np-hard-1403.55442014-03-24 https://scifaro.com/en/abs/bejeweled-candy-crush-and-other-match-three-games-are-np-hard-1403.58302014-03-25 https://scifaro.com/en/abs/partitioning-a-graph-into-disjoint-cliques-and-a-triangle-free-graph-1403.59612015-01-06 https://scifaro.com/en/abs/the-connectivity-of-boolean-satisfiability-no-constants-and-quantified-variants-1403.61652015-10-26 https://scifaro.com/en/abs/a-theory-of-complexity-condition-and-roundoff-1403.62412014-06-09 https://scifaro.com/en/abs/finding-shortest-paths-between-graph-colourings-1403.63472014-10-30 https://scifaro.com/en/abs/havannah-and-twixt-are-pspace-complete-1403.65182014-03-27 https://scifaro.com/en/abs/the-matching-polytope-does-not-admit-fully-polynomial-size-relaxation-schemes-1403.67102016-10-26 https://scifaro.com/en/abs/maximum-quadratic-assignment-problem-reduction-from-maximum-label-cover-and-lp-based-approximation-algorithm-1403.77212014-04-01 https://scifaro.com/en/abs/recent-advances-on-the-log-rank-conjecture-in-communication-complexity-1403.81062014-04-01 https://scifaro.com/en/abs/ray-tracing-computing-the-incomputable-1404.00752014-04-02 https://scifaro.com/en/abs/effective-dimension-in-some-general-metric-spaces-1404.00772017-05-16 https://scifaro.com/en/abs/minimum-bisection-is-np-hard-on-unit-disk-graphs-1404.01172017-04-28 https://scifaro.com/en/abs/the-complexity-of-bounded-length-graph-recoloring-1404.03372014-04-17 https://scifaro.com/en/abs/two-structural-results-for-low-degree-polynomials-and-applications-1404.06542014-04-03 https://scifaro.com/en/abs/binary-pattern-tile-set-synthesis-is-np-hard-1404.09672014-04-04 https://scifaro.com/en/abs/a-polylogarithmic-prg-for-degree-2-threshold-functions-in-the-gaussian-setting-1404.11032014-04-07 https://scifaro.com/en/abs/exact-quantum-algorithms-have-advantage-for-almost-all-boolean-functions-1404.16842014-09-30 https://scifaro.com/en/abs/tighter-fourier-transform-complexity-tradeoffs-1404.17412015-04-16 https://scifaro.com/en/abs/on-the-power-of-homogeneous-depth-4-arithmetic-circuits-1404.19502014-04-09 https://scifaro.com/en/abs/computing-minimum-tile-sets-to-self-assemble-colors-patterns-1404.29622014-04-14 https://scifaro.com/en/abs/further-hardness-results-on-rainbow-and-strong-rainbow-connectivity-1404.30822016-02-18 https://scifaro.com/en/abs/minimal-output-unstable-configurations-in-chemical-reaction-networks-and-deciders-1404.31662015-06-16 https://scifaro.com/en/abs/on-simplex-pivoting-rules-and-complexity-theory-1404.33202014-04-15 https://scifaro.com/en/abs/on-the-sum-of-the-l1-influences-of-bounded-functions-1404.33962015-03-31 https://scifaro.com/en/abs/on-the-hardness-of-the-decoding-and-the-minimum-distance-problems-for-rank-codes-1404.34822014-04-15 https://scifaro.com/en/abs/diameter-constrained-reliability-computational-complexity-in-terms-of-the-diameter-and-number-of-terminals-1404.36842014-04-15 https://scifaro.com/en/abs/shortest-reconfiguration-paths-in-the-solution-space-of-boolean-formulas-1404.38012014-05-28 https://scifaro.com/en/abs/circuit-complexity-proof-complexity-and-polynomial-identity-testing-1404.38202014-04-16 https://scifaro.com/en/abs/the-complexity-of-counting-edge-colorings-and-a-dichotomy-for-some-higher-domain-holant-problems-1404.40202014-04-16 https://scifaro.com/en/abs/a-characterization-of-eventually-periodicity-1404.44162014-04-18 https://scifaro.com/en/abs/set-families-with-low-pairwise-intersection-1404.46222014-04-18 https://scifaro.com/en/abs/approximation-for-the-path-complexity-of-binary-search-tree-1404.46922014-04-21 https://scifaro.com/en/abs/factors-of-sparse-polynomials-are-sparse-1404.48342014-08-10 https://scifaro.com/en/abs/polynomials-modulo-composite-numbers-ax-katz-type-theorems-for-the-structure-of-their-solution-sets-1404.48522014-08-19 https://scifaro.com/en/abs/a-note-on-the-relation-between-xor-and-selective-xor-lemmas-1404.51692019-08-16 https://scifaro.com/en/abs/critique-of-j-kim-s-p-is-not-equal-to-np-by-modus-tollens-1404.53522014-04-29 https://scifaro.com/en/abs/a-note-on-np-hardness-of-preemptive-mean-flow-time-scheduling-for-parallel-machines-1404.54242014-04-23 https://scifaro.com/en/abs/on-the-satisfiability-of-quantum-circuits-of-small-treewidth-1404.55652016-02-09 https://scifaro.com/en/abs/deepening-the-relationship-between-sefe-and-c-planarity-1404.61752014-04-25 https://scifaro.com/en/abs/computable-real-function-f-such-that-f-is-not-polynomial-time-computable-on-0-1-1404.70532014-04-29 https://scifaro.com/en/abs/depth-lower-bounds-against-circuits-with-sparse-orientation-1404.74432015-02-04 https://scifaro.com/en/abs/reconfiguration-in-bounded-bandwidth-and-treedepth-1405.08472014-05-06 https://scifaro.com/en/abs/unique-games-on-the-hypercube-1405.13742014-05-07 https://scifaro.com/en/abs/debates-with-small-transparent-quantum-verifiers-1405.16552015-07-13 https://scifaro.com/en/abs/a-strongly-polynomial-reduction-for-linear-programs-over-grids-1405.18272015-01-27 https://scifaro.com/en/abs/reconfiguration-over-tree-decompositions-1405.24472014-09-30 https://scifaro.com/en/abs/aspects-of-statistical-physics-in-computational-complexity-1405.35582014-05-15 https://scifaro.com/en/abs/and-compression-of-np-complete-problems-streamlined-proof-and-minor-observations-1405.44722018-04-24 https://scifaro.com/en/abs/understanding-model-counting-for-beta-acyclic-cnf-formulas-1405.60432014-05-26 https://scifaro.com/en/abs/pseudorandomness-and-fourier-growth-bounds-for-width-3-branching-programs-1405.70282014-05-28 https://scifaro.com/en/abs/optimal-query-complexity-for-estimating-the-trace-of-a-matrix-1405.71122014-05-29 https://scifaro.com/en/abs/on-computation-with-probabilities-modulo-k-1405.73812014-12-24 https://scifaro.com/en/abs/on-total-communication-complexity-of-collapsing-protocols-for-pointer-jumping-problem-1405.75962014-05-30 https://scifaro.com/en/abs/very-narrow-quantum-obdds-and-width-hierarchies-for-classical-obdds-1405.78492016-11-25 https://scifaro.com/en/abs/size-of-sets-with-small-sensitivity-a-generalization-of-simon-s-lemma-1406.00732016-06-08 https://scifaro.com/en/abs/computing-rank-of-finite-algebraic-structures-with-limited-nondeterminism-1406.08792020-05-21 https://scifaro.com/en/abs/on-the-communication-complexity-of-finding-an-approximate-stable-marriage-1406.12732014-10-10 https://scifaro.com/en/abs/deciding-the-on-line-chromatic-number-of-a-graph-with-pre-coloring-is-pspace-complete-1406.16232014-06-09 https://scifaro.com/en/abs/lower-bounds-for-tropical-circuits-and-dynamic-programs-1406.30652018-05-30 https://scifaro.com/en/abs/relating-the-time-complexity-of-optimization-problems-in-light-of-the-exponential-time-hypothesis-1406.32472014-06-13 https://scifaro.com/en/abs/the-parameterized-complexity-of-k-biclique-1406.37002019-06-11 https://scifaro.com/en/abs/fourier-spectra-of-measures-associated-with-algorithmically-random-brownian-motion-1406.37152015-07-01 https://scifaro.com/en/abs/beautiful-structures-an-appreciation-of-the-contributions-of-alan-selman-1406.41062014-06-18 https://scifaro.com/en/abs/the-number-system-hidden-inside-the-boolean-satisfiability-problem-1406.44262018-01-25 https://scifaro.com/en/abs/unraveling-simplicity-in-elementary-cellular-automata-1406.53062014-06-23 https://scifaro.com/en/abs/on-the-complexity-of-trial-and-error-for-constraint-satisfaction-problems-1406.53362017-08-17 https://scifaro.com/en/abs/computational-complexity-of-certifying-restricted-isometry-property-1406.57912014-06-24 https://scifaro.com/en/abs/a-lower-bound-for-boolean-satisfiability-on-turing-machines-1406.59702014-06-24 https://scifaro.com/en/abs/a-lower-bound-of-2-n-conditional-branches-for-boolean-satisfiability-on-post-machines-1406.63532014-06-25 https://scifaro.com/en/abs/a-finer-reduction-of-constraint-problems-to-digraphs-1406.64132017-01-11 https://scifaro.com/en/abs/a-framework-for-good-sat-translations-with-applications-to-cnf-representations-of-xor-constraints-1406.73982014-08-06 https://scifaro.com/en/abs/hitting-sets-for-roabp-and-sum-of-set-multilinear-circuits-1406.75352014-07-01 https://scifaro.com/en/abs/reductions-to-the-set-of-random-strings-the-resource-bounded-case-1406.76582015-07-01 https://scifaro.com/en/abs/no-small-nondeterministic-read-once-branching-programs-for-cnfs-of-bounded-treewidth-1407.04912014-07-03 https://scifaro.com/en/abs/narrowing-the-complexity-gap-for-colouring-c-s-p-t-free-graphs-1407.14802014-07-08 https://scifaro.com/en/abs/a-survey-on-the-computational-complexity-of-colouring-graphs-with-forbidden-subgraphs-1407.14822016-02-16 https://scifaro.com/en/abs/the-polyhedron-hitting-problem-1407.18892014-10-14 https://scifaro.com/en/abs/on-termination-of-integer-linear-loops-1407.18912014-10-14 https://scifaro.com/en/abs/lower-bounds-on-the-critical-density-in-the-hard-disk-model-via-optimized-metrics-1407.19302014-07-09 https://scifaro.com/en/abs/achieving-new-upper-bounds-for-the-hypergraph-duality-problem-through-logic-1407.29122019-03-22 https://scifaro.com/en/abs/complexity-of-counting-subgraphs-only-the-boundedness-of-the-vertex-cover-number-counts-1407.29292014-07-11 https://scifaro.com/en/abs/even-faster-integer-multiplication-1407.33602014-07-15 https://scifaro.com/en/abs/faster-polynomial-multiplication-over-finite-fields-1407.33612014-07-15 https://scifaro.com/en/abs/list-decoding-reed-muller-codes-over-small-fields-1407.34332014-07-18 https://scifaro.com/en/abs/sub-linear-upper-bounds-on-fourier-dimension-of-boolean-functions-in-terms-of-fourier-sparsity-1407.35002014-07-15 https://scifaro.com/en/abs/some-upper-and-lower-bounds-on-psd-rank-1407.43082014-07-17 https://scifaro.com/en/abs/on-relative-or-complexity-of-boolean-matrices-and-their-complements-1407.46262014-07-18 https://scifaro.com/en/abs/on-the-communication-complexity-of-linear-algebraic-problems-in-the-message-passing-model-1407.47552014-07-18 https://scifaro.com/en/abs/into-the-square-on-the-complexity-of-quadratic-time-solvable-problems-1407.49722014-07-21 https://scifaro.com/en/abs/on-the-tractability-of-some-natural-packing-covering-and-partitioning-problems-1407.49992014-07-21 https://scifaro.com/en/abs/a-sane-proof-that-colk-le-col3-1407.51282016-01-29 https://scifaro.com/en/abs/hellinger-volume-and-number-on-the-forehead-communication-complexity-1407.54252014-07-22 https://scifaro.com/en/abs/multiplicative-complexity-of-vector-valued-boolean-functions-1407.61692018-02-23 https://scifaro.com/en/abs/2-server-pir-with-sub-polynomial-communication-1407.66922014-07-25 https://scifaro.com/en/abs/chip-firing-games-on-eulerian-digraphs-and-np-hardness-of-computing-the-rank-of-a-divisor-on-a-graph-1407.69582015-12-22 https://scifaro.com/en/abs/dmvp-foremost-waypoint-coverage-of-time-varying-graphs-1407.72792014-07-29 https://scifaro.com/en/abs/from-quantum-query-complexity-to-state-complexity-1407.73422014-11-26 https://scifaro.com/en/abs/vertex-2-coloring-without-monochromatic-cycles-1407.74232014-07-29 https://scifaro.com/en/abs/on-multiply-exponential-write-once-turing-machines-1407.75922014-10-30 https://scifaro.com/en/abs/counting-4-times-4-matrix-partitions-of-graphs-1407.77992016-06-30 https://scifaro.com/en/abs/optimal-hub-labeling-is-np-complete-1407.83732014-08-01 https://scifaro.com/en/abs/reducing-uniformity-in-khot-saket-hypergraph-coloring-hardness-reductions-1408.02622014-12-12 https://scifaro.com/en/abs/the-value-of-help-bits-in-randomized-and-average-case-complexity-1408.04992017-01-12 https://scifaro.com/en/abs/pre-reduction-graph-products-hardnesses-of-properly-learning-dfas-and-approximating-edp-on-dags-1408.08282014-08-06 https://scifaro.com/en/abs/a-trichotomy-in-the-complexity-of-counting-answers-to-conjunctive-queries-1408.08902015-01-22 https://scifaro.com/en/abs/a-special-role-of-boolean-quadratic-polytopes-among-other-combinatorial-polytopes-1408.09482018-04-18 https://scifaro.com/en/abs/on-optimal-approximability-results-for-computing-the-strong-metric-dimension-1408.13902018-08-20 https://scifaro.com/en/abs/fp-linspace-computability-of-riemann-zeta-function-in-ko-friedman-model-1408.23622014-11-18 https://scifaro.com/en/abs/notes-on-space-complexity-of-integration-of-computable-real-functions-in-ko-friedman-model-1408.23642014-11-18 https://scifaro.com/en/abs/computing-with-coloured-tangles-1408.26852015-07-23 https://scifaro.com/en/abs/homomorphism-reconfiguration-via-homotopy-1408.28122017-03-28 https://scifaro.com/en/abs/sat-for-pedestrians-1408.32862014-08-15 https://scifaro.com/en/abs/faster-fpt-algorithm-for-graph-isomorphism-parameterized-by-eigenvalue-multiplicity-1408.35102014-08-18 https://scifaro.com/en/abs/the-game-about-squares-is-np-hard-1408.36452014-08-21 https://scifaro.com/en/abs/conservative-constraint-satisfaction-re-revisited-1408.36902014-08-19 https://scifaro.com/en/abs/on-the-tractability-of-un-satisfiability-1408.52822020-04-08 https://scifaro.com/en/abs/heat-and-noise-on-cubes-and-spheres-the-sensitivity-of-randomly-rotated-polynomial-threshold-functions-1408.54252014-08-26 https://scifaro.com/en/abs/on-symmetries-of-the-strassen-algorithm-1408.62732014-08-28 https://scifaro.com/en/abs/tension-bounds-for-information-complexity-1408.62852014-08-28 https://scifaro.com/en/abs/2048-is-pspace-hard-but-sometimes-easy-1408.63152014-08-28 https://scifaro.com/en/abs/a-constructive-proof-presenting-languages-in-sigma-2-p-that-cannot-be-decided-by-circuit-families-of-size-n-k-1408.63342014-09-18 https://scifaro.com/en/abs/locally-constrained-homomorphisms-on-graphs-of-bounded-treewidth-and-bounded-degree-1408.66762015-10-07 https://scifaro.com/en/abs/polynomial-solvability-of-np-complete-problems-1409.03752018-08-27 https://scifaro.com/en/abs/computational-complexity-of-solving-polynomial-differential-equations-over-unbounded-domains-1409.04512017-01-18 https://scifaro.com/en/abs/new-algorithms-and-hard-instances-for-non-commutative-computation-1409.07422015-08-11 https://scifaro.com/en/abs/kolmogorov-complexity-and-the-geometry-of-brownian-motion-1409.10602019-02-20 https://scifaro.com/en/abs/a-parameterized-study-of-maximum-generalized-pattern-matching-problems-1409.23982014-09-09 https://scifaro.com/en/abs/narrow-proofs-may-be-maximally-long-1409.27312014-09-10 https://scifaro.com/en/abs/from-small-space-to-small-width-in-resolution-1409.29782014-09-11 https://scifaro.com/en/abs/square-grid-points-coveraged-by-connected-sources-with-coverage-radius-of-one-on-a-two-dimensional-grid-1409.33192014-09-16 https://scifaro.com/en/abs/hardness-of-parameter-estimation-in-graphical-models-1409.38362014-09-22 https://scifaro.com/en/abs/on-stability-property-of-probability-laws-with-respect-to-small-violations-of-algorithmic-randomness-1409.38652014-09-16 https://scifaro.com/en/abs/the-corruption-bound-log-rank-and-communication-complexity-1409.40352017-09-25 https://scifaro.com/en/abs/algorithmic-complexity-for-psychology-a-user-friendly-implementation-of-the-coding-theorem-method-1409.40802015-02-23 https://scifaro.com/en/abs/the-complexity-of-approximating-complex-valued-ising-and-tutte-partition-functions-1409.56272017-01-24 https://scifaro.com/en/abs/a-direct-proof-for-lovett-s-bound-on-the-communication-complexity-of-low-rank-matrices-1409.63662014-09-24 https://scifaro.com/en/abs/polynomial-kernels-and-user-reductions-for-the-workflow-satisfiability-problem-1409.72612014-09-26 https://scifaro.com/en/abs/parameterized-analogues-of-probabilistic-computation-1409.77902014-09-30 https://scifaro.com/en/abs/the-odds-of-staying-on-budget-1409.82282015-04-22 https://scifaro.com/en/abs/about-accuracy-of-the-solution-of-np-complete-tasks-1409.82542014-09-30 https://scifaro.com/en/abs/model-counting-for-formulas-of-bounded-clique-width-1409.84642014-10-01 https://scifaro.com/en/abs/the-minimum-feasible-tileset-problem-1409.85242017-10-26 https://scifaro.com/en/abs/on-the-computational-complexity-of-mapreduce-1410.02452015-10-07 https://scifaro.com/en/abs/constructive-relationships-between-algebraic-thickness-and-normality-1410.13182015-09-22 https://scifaro.com/en/abs/squares-of-3-sun-free-split-graphs-1410.20752014-10-13 https://scifaro.com/en/abs/satisfying-ternary-permutation-constraints-by-multiple-linear-orders-or-phylogenetic-trees-1410.23712014-10-10 https://scifaro.com/en/abs/on-circuit-complexity-of-parity-and-majority-functions-in-antichain-basis-1410.24562014-10-10 https://scifaro.com/en/abs/mutual-dimension-1410.41352014-10-16 https://scifaro.com/en/abs/lp-sdp-hierarchy-lower-bounds-for-decoding-random-ldpc-codes-1410.42412014-10-17 https://scifaro.com/en/abs/gowers-norm-function-limits-and-parameter-estimation-1410.50532015-03-27 https://scifaro.com/en/abs/hardness-of-peeling-with-stashes-1410.51692016-06-03 https://scifaro.com/en/abs/structural-parameterizations-of-the-mixed-chinese-postman-problem-1410.51912015-01-27 https://scifaro.com/en/abs/proof-complexity-modulo-the-polynomial-hierarchy-understanding-alternation-as-a-source-of-hardness-1410.53692016-02-19 https://scifaro.com/en/abs/on-computational-complexity-of-length-embeddability-of-graphs-1410.55552014-10-22 https://scifaro.com/en/abs/zig-zag-numberlink-is-np-complete-1410.58452014-10-23 https://scifaro.com/en/abs/nuclear-norm-of-higher-order-tensors-1410.60722016-05-19 https://scifaro.com/en/abs/permutation-reconstruction-from-differences-1410.63962014-10-28 https://scifaro.com/en/abs/computing-an-evolutionary-ordering-is-hard-1410.66632014-10-27 https://scifaro.com/en/abs/complexity-of-lp-in-terms-of-the-face-lattice-1410.70822018-04-18 https://scifaro.com/en/abs/a-new-perspective-on-the-windows-scheduling-problem-1410.72372014-10-28 https://scifaro.com/en/abs/deterministic-extractors-for-additive-sources-1410.72532014-10-28 https://scifaro.com/en/abs/improved-bound-on-the-worst-case-complexity-of-policy-iteration-1410.75832014-10-29 https://scifaro.com/en/abs/binary-determinantal-complexity-1410.82022017-04-11 https://scifaro.com/en/abs/ac-feasibility-on-tree-networks-is-np-hard-1410.82532014-10-31 https://scifaro.com/en/abs/learning-circuits-with-few-negations-1410.84202014-10-31 https://scifaro.com/en/abs/affine-reductions-for-lps-and-sdps-1410.88162016-01-20 https://scifaro.com/en/abs/on-kernelization-and-approximation-for-the-vector-connectivity-problem-1410.88192015-06-24 https://scifaro.com/en/abs/on-the-read-once-property-of-branching-programs-and-cnfs-of-bounded-treewidth-1411.02642015-07-28 https://scifaro.com/en/abs/ph-pspace-1411.06282022-11-03 https://scifaro.com/en/abs/np-hardness-of-hypercube-2-segmentation-1411.08212014-11-05 https://scifaro.com/en/abs/space-proof-complexity-for-random-3-cnfs-via-a-2-epsilon-hall-s-theorem-1411.16192014-11-07 https://scifaro.com/en/abs/a-strongly-exponential-separation-of-dnnfs-from-cnf-formulas-1411.19952015-02-20 https://scifaro.com/en/abs/on-characterizing-the-data-access-complexity-of-programs-1411.22862014-11-11 https://scifaro.com/en/abs/the-selfish-algorithm-1411.23782014-11-11 https://scifaro.com/en/abs/easy-hard-transition-in-k-sat-1411.29012014-11-12 https://scifaro.com/en/abs/computational-complexity-of-functions-1411.30102018-12-03 https://scifaro.com/en/abs/a-linear-time-algorithm-for-the-orbit-problem-over-cyclic-groups-1411.31642015-11-17 https://scifaro.com/en/abs/tighter-relations-between-sensitivity-and-other-complexity-measures-1411.34192014-11-14 https://scifaro.com/en/abs/derandomized-graph-product-results-using-the-low-degree-long-code-1411.35172020-05-08 https://scifaro.com/en/abs/communication-with-imperfectly-shared-randomness-1411.36032024-01-24 https://scifaro.com/en/abs/query-complexity-of-sampling-and-small-geometric-partitions-1411.37992019-02-20 https://scifaro.com/en/abs/the-complexity-of-dc-switching-problems-1411.43692014-11-18 https://scifaro.com/en/abs/pseudorandomness-for-concentration-bounds-and-signed-majorities-1411.45842014-11-18 https://scifaro.com/en/abs/settling-the-complexity-of-arrow-debreu-markets-under-leontief-and-plc-utilities-using-the-classes-fixp-and-exists-r-1411.50602020-05-22 https://scifaro.com/en/abs/fast-matrix-multiplication-limitations-of-the-laser-method-1411.54142021-10-05 https://scifaro.com/en/abs/the-complexity-of-some-regex-crossword-problems-1411.54372014-12-01 https://scifaro.com/en/abs/trackmania-is-np-complete-1411.57652014-11-24 https://scifaro.com/en/abs/pspace-completeness-of-bloxorz-and-of-games-with-2-buttons-1411.59512014-11-24 https://scifaro.com/en/abs/quantum-invariants-of-3-manifolds-and-np-vs-p-1411.60492017-03-21 https://scifaro.com/en/abs/almost-optimal-pseudorandom-generators-for-spherical-caps-1411.62992015-03-30 https://scifaro.com/en/abs/lower-bounds-on-the-size-of-semidefinite-programming-relaxations-1411.63172014-11-25 https://scifaro.com/en/abs/complexity-of-secure-sets-1411.65492017-07-11 https://scifaro.com/en/abs/the-square-root-rank-of-the-correlation-polytope-is-exponential-1411.67122014-11-26 https://scifaro.com/en/abs/approximately-counting-locally-optimal-structures-1411.68292016-04-20 https://scifaro.com/en/abs/deterministic-identity-testing-for-sum-of-read-once-oblivious-arithmetic-branching-programs-1411.73412015-05-19 https://scifaro.com/en/abs/dimension-expanders-via-rank-condensers-1411.74552014-12-01 https://scifaro.com/en/abs/subexponential-size-hitting-sets-for-bounded-depth-multilinear-formulas-1411.74922014-12-01 https://scifaro.com/en/abs/derandomizing-isolation-lemma-for-k-3-3-free-and-k-5-free-bipartite-graphs-1411.76142014-12-01 https://scifaro.com/en/abs/magic-coins-are-useful-for-small-space-quantum-machines-1411.76472014-12-01 https://scifaro.com/en/abs/a-characterization-of-hard-to-cover-csps-1411.77472021-01-05 https://scifaro.com/en/abs/edit-distance-cannot-be-computed-in-strongly-subquadratic-time-unless-seth-is-false-1412.03482017-08-17 https://scifaro.com/en/abs/an-algorithmic-separating-hyperplane-theorem-and-its-applications-1412.03562016-11-28 https://scifaro.com/en/abs/dichotomy-theorems-for-homomorphism-polynomials-of-graph-classes-1412.04232014-12-02 https://scifaro.com/en/abs/braid-is-undecidable-1412.07842014-12-03 https://scifaro.com/en/abs/on-the-induced-matching-problem-in-hamiltonian-bipartite-graphs-1412.08642014-12-08 https://scifaro.com/en/abs/tree-like-resolution-complexity-of-two-planar-problems-1412.11242014-12-04 https://scifaro.com/en/abs/it-s-not-easy-being-three-the-approximability-of-three-dimensional-stable-matching-problems-1412.11302014-12-04 https://scifaro.com/en/abs/sat-is-a-problem-with-exponential-complexity-measured-by-negentropy-1412.12292015-09-22 https://scifaro.com/en/abs/new-geometric-representations-and-domination-problems-on-tolerance-and-multitolerance-graphs-1412.15432016-05-17 https://scifaro.com/en/abs/weighted-polynomial-approximations-limits-for-learning-and-pseudorandomness-1412.24572014-12-09 https://scifaro.com/en/abs/bounded-treewidth-and-space-efficient-linear-algebra-1412.24702014-12-09 https://scifaro.com/en/abs/homonym-population-protocols-or-providing-a-small-space-of-computation-using-a-few-identifiers-1412.24972019-02-21 https://scifaro.com/en/abs/scheduling-with-two-non-unit-task-lengths-is-np-complete-1412.30952017-11-01 https://scifaro.com/en/abs/computational-complexity-of-competitive-diffusion-on-un-weighted-graphs-1412.33342014-12-11 https://scifaro.com/en/abs/on-ddos-attack-related-minimum-cut-problems-1412.33592015-04-20 https://scifaro.com/en/abs/uniformity-is-weaker-than-semi-uniformity-for-some-membrane-systems-1412.33772014-12-11 https://scifaro.com/en/abs/tight-hardness-of-the-non-commutative-grothendieck-problem-1412.44132022-02-22 https://scifaro.com/en/abs/nonclassical-polynomials-as-a-barrier-to-polynomial-lower-bounds-1412.47192014-12-16 https://scifaro.com/en/abs/variable-selection-is-hard-1412.48322014-12-17 https://scifaro.com/en/abs/new-bounds-for-the-garden-hose-model-1412.49042014-12-17 https://scifaro.com/en/abs/a-self-tester-for-linear-functions-over-the-integers-with-an-elementary-proof-of-correctness-1412.54842015-06-24 https://scifaro.com/en/abs/new-algorithms-and-lower-bounds-for-monotonicity-testing-1412.56552014-12-19 https://scifaro.com/en/abs/boolean-function-monotonicity-testing-requires-almost-n-1-2-non-adaptive-queries-1412.56572014-12-19 https://scifaro.com/en/abs/on-families-of-anticommuting-matrices-1412.58932014-12-19 https://scifaro.com/en/abs/the-simplified-weighted-sum-function-and-its-average-sensitivity-1412.62682014-12-22 https://scifaro.com/en/abs/deterministic-randomness-extraction-from-generalized-and-distributed-santha-vazirani-sources-1412.66412014-12-23 https://scifaro.com/en/abs/instruction-sequence-size-complexity-of-parity-1412.67872016-12-30 https://scifaro.com/en/abs/on-the-lattice-smoothing-parameter-problem-1412.79792014-12-30 https://scifaro.com/en/abs/characterizing-propositional-proofs-as-non-commutative-formulas-1412.87462015-09-14 https://scifaro.com/en/abs/on-the-complexity-of-finite-valued-functions-1501.002652015-01-05 https://scifaro.com/en/abs/computational-feasibility-of-clustering-under-clusterability-assumptions-1501.004372015-01-05 https://scifaro.com/en/abs/on-the-complexity-of-noncommutative-polynomial-factorization-1501.006712015-01-06 https://scifaro.com/en/abs/sum-of-squares-lower-bounds-from-pairwise-independence-1501.007342015-03-30 https://scifaro.com/en/abs/on-sharing-memoization-and-polynomial-time-long-version-1501.008942015-01-06 https://scifaro.com/en/abs/combinatorial-optimization-algorithms-via-polymorphisms-1501.015982015-01-08 https://scifaro.com/en/abs/on-the-complexity-of-sorted-neighborhood-1501.016962015-01-09 https://scifaro.com/en/abs/what-is-np-interpretation-of-a-chinese-paradox-white-horse-is-not-horse-1501.019062015-01-09 https://scifaro.com/en/abs/what-is-cook-s-theorem-1501.019102015-01-09 https://scifaro.com/en/abs/efficient-computation-by-three-counter-machines-1501.022122015-01-12 https://scifaro.com/en/abs/on-the-complexity-of-slide-and-merge-games-1501.038372015-01-19 https://scifaro.com/en/abs/the-dead-cryptographers-society-problem-1501.038722018-12-27 https://scifaro.com/en/abs/from-complexity-to-algebra-and-back-digraph-classes-collapsibility-and-the-pgp-1501.045582015-05-13 https://scifaro.com/en/abs/permanent-versus-determinant-not-via-saturations-1501.055282017-03-01 https://scifaro.com/en/abs/a-reconfigurations-analogue-of-brooks-theorem-and-its-consequences-1501.058002015-01-26 https://scifaro.com/en/abs/infinite-communication-complexity-1501.058142015-01-26 https://scifaro.com/en/abs/the-parity-hamiltonian-cycle-problem-1501.063232016-07-11 https://scifaro.com/en/abs/solitaire-chess-is-np-complete-1501.063982015-01-27 https://scifaro.com/en/abs/the-complexity-of-the-kth-largest-subset-problem-and-related-problems-1501.067292015-10-01 https://scifaro.com/en/abs/quadratic-time-hardness-of-lcs-and-other-sequence-similarity-measures-1501.070532015-02-02 https://scifaro.com/en/abs/counting-homomorphisms-to-square-free-graphs-modulo-2-1501.075392015-08-27 https://scifaro.com/en/abs/on-restricting-no-junta-boolean-function-and-degree-lower-bounds-by-polynomial-method-1502.003572015-02-05 https://scifaro.com/en/abs/quadratic-conditional-lower-bounds-for-string-problems-and-dynamic-time-warping-1502.010632015-04-06 https://scifaro.com/en/abs/graph-isomorphism-color-refinement-and-compactness-1502.012552015-05-05 https://scifaro.com/en/abs/approximately-counting-h-colourings-is-bis-hard-1502.013352016-05-30 https://scifaro.com/en/abs/unary-probabilistic-and-quantum-automata-on-promise-problems-1502.014622015-03-12 https://scifaro.com/en/abs/lower-bounds-for-monotone-counting-circuits-1502.018652018-05-30 https://scifaro.com/en/abs/simultaneous-time-space-upper-bounds-for-certain-problems-in-planar-graphs-1502.021352015-02-10 https://scifaro.com/en/abs/the-hardness-of-approximation-of-euclidean-k-means-1502.033162015-02-12 https://scifaro.com/en/abs/necessary-conditions-for-tractability-of-valued-csps-1502.034822015-12-23 https://scifaro.com/en/abs/evaluating-matrix-circuits-1502.035402015-02-13 https://scifaro.com/en/abs/variable-and-value-elimination-in-binary-constraint-satisfaction-via-forbidden-patterns-1502.037962015-06-11 https://scifaro.com/en/abs/a-note-on-semi-algebraic-proofs-and-gaussian-elimination-over-prime-fields-1502.039742015-02-16 https://scifaro.com/en/abs/width-hierarchy-for-k-obdd-of-small-width-1502.042262024-04-05 https://scifaro.com/en/abs/on-topological-lower-bounds-for-algebraic-computation-trees-1502.043412015-08-18 https://scifaro.com/en/abs/parallel-identity-testing-for-skew-circuits-with-big-powers-and-applications-1502.045452015-02-17 https://scifaro.com/en/abs/lower-bound-for-general-circuits-computing-clique-function-1502.046502015-02-23 https://scifaro.com/en/abs/reconfiguration-on-sparse-graphs-1502.048032015-02-18 https://scifaro.com/en/abs/a-galois-connection-for-weighted-relational-clones-of-infinite-size-1502.050862016-05-31 https://scifaro.com/en/abs/sherali-adams-relaxations-for-valued-csps-1502.053012015-11-24 https://scifaro.com/en/abs/extended-formulation-for-csp-that-is-compact-for-instances-of-bounded-treewidth-1502.053612015-04-29 https://scifaro.com/en/abs/greatest-fixed-points-of-probabilistic-min-max-polynomial-equations-and-reachability-for-branching-markov-decision-processes-1502.055332016-04-08 https://scifaro.com/en/abs/limitations-of-algebraic-approaches-to-graph-isomorphism-testing-1502.059122015-02-23 https://scifaro.com/en/abs/improved-sum-of-squares-lower-bounds-for-hidden-clique-and-hidden-submatrix-problems-1502.065902015-02-24 https://scifaro.com/en/abs/minimal-distance-of-propositional-models-1502.067612022-10-13 https://scifaro.com/en/abs/identifying-an-honest-rm-exp-rm-np-oracle-among-many-1502.072582015-04-08 https://scifaro.com/en/abs/the-complexity-of-general-valued-csps-1502.073272017-02-14 https://scifaro.com/en/abs/sat-problem-and-statistical-distance-1502.075452015-10-06 https://scifaro.com/en/abs/the-phase-transition-in-random-regular-exact-cover-1502.075912015-03-05 https://scifaro.com/en/abs/multinational-war-is-hard-1503.001412015-03-11 https://scifaro.com/en/abs/parameter-compilation-1503.002602015-03-03 https://scifaro.com/en/abs/comparator-circuits-over-finite-bounded-posets-1503.002752017-07-20 https://scifaro.com/en/abs/a-sampling-technique-of-proving-lower-bounds-for-noisy-computations-1503.003212015-03-03 https://scifaro.com/en/abs/no-small-linear-program-approximates-vertex-cover-within-a-factor-2-epsilon-1503.007532015-11-30 https://scifaro.com/en/abs/space-proof-complexity-for-random-3-cnfs-1503.016132015-04-03 https://scifaro.com/en/abs/three-source-extractors-for-polylogarithmic-min-entropy-1503.022862015-03-10 https://scifaro.com/en/abs/the-complexity-of-computing-the-minimum-rank-of-a-sign-pattern-matrix-1503.044862015-05-18 https://scifaro.com/en/abs/sum-of-squares-lower-bounds-for-planted-clique-1503.064472015-03-24 https://scifaro.com/en/abs/dual-polynomials-for-collision-and-element-distinctness-1503.072612015-03-27 https://scifaro.com/en/abs/the-complexity-of-phylogeny-constraint-satisfaction-problems-1503.073102017-08-15 https://scifaro.com/en/abs/sensitivity-versus-certificate-complexity-of-boolean-functions-1503.076912015-06-09 https://scifaro.com/en/abs/log-concavity-and-lower-bounds-for-arithmetic-circuits-1503.077052017-01-17 https://scifaro.com/en/abs/on-solving-systems-of-diagonal-polynomial-equations-over-finite-fields-1503.090162016-06-09 https://scifaro.com/en/abs/bi-polynomial-rank-and-determinantal-complexity-1504.001512015-04-02 https://scifaro.com/en/abs/understanding-sat-is-in-p-1504.003372016-09-19 https://scifaro.com/en/abs/refuting-unique-game-conjecture-1504.004422015-11-10 https://scifaro.com/en/abs/efficient-indexing-of-necklaces-and-irreducible-polynomials-over-finite-fields-1504.005722015-04-03 https://scifaro.com/en/abs/trading-query-complexity-for-sample-based-testing-and-multi-testing-scalability-1504.006952015-04-06 https://scifaro.com/en/abs/the-matching-problem-has-no-small-symmetric-sdp-1504.007032016-12-01 https://scifaro.com/en/abs/the-complexity-of-computation-in-bit-streams-1504.008342015-04-06 https://scifaro.com/en/abs/technical-notes-on-complexity-of-the-satisfiability-problem-1504.010922015-04-07 https://scifaro.com/en/abs/heuristic-algorithms-for-obtaining-polynomial-threshold-functions-with-low-densities-1504.011672015-04-07 https://scifaro.com/en/abs/separating-decision-tree-complexity-from-subcube-partition-complexity-1504.013392016-05-20 https://scifaro.com/en/abs/if-the-current-clique-algorithms-are-optimal-so-is-valiant-s-parser-1504.014312015-11-06 https://scifaro.com/en/abs/tight-size-degree-bounds-for-sums-of-squares-proofs-1504.016562015-04-08 https://scifaro.com/en/abs/can-almost-everybody-be-almost-happy-pcp-for-ppad-and-the-inapproximability-of-nash-1504.024112025-09-08 https://scifaro.com/en/abs/an-average-case-depth-hierarchy-theorem-for-boolean-circuits-1504.033982015-04-15 https://scifaro.com/en/abs/sparse-multivariate-polynomial-interpolation-in-the-basis-of-schubert-polynomials-1504.038562018-05-16 https://scifaro.com/en/abs/2-log-n-1-10-o-1-hardness-for-hypergraph-coloring-1504.039232015-10-15 https://scifaro.com/en/abs/constraint-satisfaction-problems-around-skolem-arithmetic-1504.041812015-04-17 https://scifaro.com/en/abs/pseudorandomness-for-read-once-constant-depth-circuits-1504.046752015-09-21 https://scifaro.com/en/abs/communication-with-contextual-uncertainty-1504.048132015-07-21 https://scifaro.com/en/abs/on-minimal-free-resolutions-of-sub-permanents-and-other-ideals-arising-in-complexity-theory-1504.051712017-12-05 https://scifaro.com/en/abs/on-the-complexity-of-computing-prime-tables-1504.052402015-04-22 https://scifaro.com/en/abs/on-fortification-of-projection-games-1504.055562015-05-26 https://scifaro.com/en/abs/high-rate-locally-correctable-and-locally-testable-codes-with-sub-polynomial-query-complexity-1504.056532015-04-23 https://scifaro.com/en/abs/maximum-pagenumber-k-subgraph-is-np-complete-1504.059082015-04-24 https://scifaro.com/en/abs/sums-of-products-of-polynomials-in-few-variables-lower-bounds-and-polynomial-identity-testing-1504.062132015-04-24 https://scifaro.com/en/abs/the-range-of-topological-effects-on-communication-1504.066022015-04-27 https://scifaro.com/en/abs/lower-bounds-for-the-size-of-nondeterministic-circuits-1504.067312015-04-28 https://scifaro.com/en/abs/information-complexity-and-the-quest-for-interactive-compression-a-survey-1504.068302015-04-28 https://scifaro.com/en/abs/a-refutation-of-the-clique-based-p-np-proofs-of-laplante-and-tamta-pande-dhami-1504.068902015-04-28 https://scifaro.com/en/abs/effectiveness-of-structural-restrictions-for-hybrid-csps-1504.070672015-10-27 https://scifaro.com/en/abs/polynomial-factorization-over-finite-fields-by-computing-euler-poincare-characteristics-of-drinfeld-modules-1504.076972016-07-12 https://scifaro.com/en/abs/parameterized-algorithms-for-deletion-to-r-l-graphs-1504.081202015-05-05 https://scifaro.com/en/abs/eth-hardness-for-densest-k-subgraph-with-perfect-completeness-1504.083522015-05-01 https://scifaro.com/en/abs/rational-proofs-with-multiple-provers-1504.083612017-11-15 https://scifaro.com/en/abs/transforming-np-to-p-an-approach-to-solve-np-complete-problems-1505.000582015-05-04 https://scifaro.com/en/abs/finding-the-median-obliviously-with-bounded-space-1505.000902015-05-04 https://scifaro.com/en/abs/universality-and-almost-decidability-1505.013402015-05-07 https://scifaro.com/en/abs/a-generalized-method-for-proving-polynomial-calculus-degree-lower-bounds-1505.013582015-05-07 https://scifaro.com/en/abs/a-lower-bound-for-the-determinantal-complexity-of-a-hypersurface-1505.022052015-05-12 https://scifaro.com/en/abs/on-asymptotic-gate-complexity-and-depth-of-reversible-circuits-with-additional-memory-1505.023722016-03-22 https://scifaro.com/en/abs/a-holant-dichotomy-is-the-fkt-algorithm-universal-1505.029932015-05-13 https://scifaro.com/en/abs/near-optimal-bounds-on-bounded-round-quantum-communication-complexity-of-disjointness-1505.031102015-05-13 https://scifaro.com/en/abs/musings-on-generic-case-complexity-1505.032182015-05-14 https://scifaro.com/en/abs/beating-the-random-assignment-on-constraint-satisfaction-problems-of-bounded-degree-1505.034242015-08-12 https://scifaro.com/en/abs/robust-biomolecular-finite-automata-1505.039312018-12-27 https://scifaro.com/en/abs/threes-fives-1024-and-2048-are-hard-1505.042742015-05-19 https://scifaro.com/en/abs/how-to-refute-a-random-csp-1505.043832015-07-28 https://scifaro.com/en/abs/average-case-complexity-of-a-branch-and-bound-algorithm-for-maximum-independent-set-under-the-mathcal-g-n-p-random-model-1505.049692015-05-20 https://scifaro.com/en/abs/koszul-young-flattenings-and-symmetric-border-rank-of-the-determinant-1505.050792015-11-16 https://scifaro.com/en/abs/complexity-theoretic-limitations-on-learning-halfspaces-1505.058002016-03-15 https://scifaro.com/en/abs/incremental-complexity-of-a-bi-objective-hypergraph-transversal-problem-1505.060252015-05-25 https://scifaro.com/en/abs/the-complexity-of-approximately-counting-in-2-spin-systems-on-k-uniform-bounded-degree-hypergraphs-1505.061462016-06-21 https://scifaro.com/en/abs/polynomially-low-error-pcps-with-polyloglog-n-queries-via-modular-composition-1505.063622018-10-09 https://scifaro.com/en/abs/every-super-polynomial-proof-in-purely-implicational-minimal-logic-has-a-polynomially-sized-proof-in-classical-implicational-propositional-logic-1505.065062015-08-14 https://scifaro.com/en/abs/complexity-analysis-of-precedence-terminating-infinite-graph-rewrite-systems-1505.071632015-05-28 https://scifaro.com/en/abs/combinatorial-game-complexity-an-introduction-with-poset-games-1505.074162015-06-26 https://scifaro.com/en/abs/on-the-computational-complexity-of-evolution-1506.000952015-06-16 https://scifaro.com/en/abs/communication-complexity-of-permutation-invariant-functions-1506.002732015-06-02 https://scifaro.com/en/abs/constraint-satisfaction-and-semilinear-expansions-of-addition-over-the-rationals-and-the-reals-1506.004792015-06-02 https://scifaro.com/en/abs/on-slepian-wolf-theorem-with-interaction-1506.006172015-09-09 https://scifaro.com/en/abs/dependent-random-graphs-and-multiparty-pointer-jumping-1506.010832015-06-04 https://scifaro.com/en/abs/impossibility-theorems-and-the-universal-algebraic-toolkit-1506.013152015-06-04 https://scifaro.com/en/abs/polynomial-fixed-parameter-algorithms-a-case-study-for-longest-path-on-interval-graphs-1506.016522021-01-06 https://scifaro.com/en/abs/polynomial-time-algorithm-for-isomorphism-of-graphs-with-clique-width-at-most-three-1506.016952016-04-29 https://scifaro.com/en/abs/on-approximating-tree-spanners-that-are-breadth-first-search-trees-1506.022432016-04-19 https://scifaro.com/en/abs/np-hardness-of-sortedness-constraints-1506.024422015-06-09 https://scifaro.com/en/abs/parity-decision-tree-complexity-and-4-party-communication-complexity-of-xor-functions-are-polynomially-equivalent-1506.029362015-06-30 https://scifaro.com/en/abs/tropically-convex-constraint-satisfaction-1506.041842017-03-23 https://scifaro.com/en/abs/pseudorandomness-via-the-discrete-fourier-transform-1506.043502015-11-19 https://scifaro.com/en/abs/separations-in-query-complexity-based-on-pointer-functions-1506.047192015-10-27 https://scifaro.com/en/abs/the-complexity-of-the-path-following-solutions-of-two-dimensional-sperner-brouwer-functions-1506.048822015-06-17 https://scifaro.com/en/abs/all-permutations-supersequence-is-conp-complete-1506.050792015-07-10 https://scifaro.com/en/abs/the-computational-complexity-of-calculating-partition-functions-of-optimal-medians-with-hamming-distance-1506.061072017-01-17 https://scifaro.com/en/abs/inapproximability-of-h-transversal-packing-1506.063022015-06-23 https://scifaro.com/en/abs/towards-better-separation-between-deterministic-and-randomized-query-complexity-1506.063992015-06-25 https://scifaro.com/en/abs/an-o-n-0-4732-upper-bound-on-the-complexity-of-the-gks-communication-game-1506.064562015-06-23 https://scifaro.com/en/abs/hybrid-vcsps-with-crisp-and-conservative-valued-templates-1506.065402017-08-29 https://scifaro.com/en/abs/complexity-of-a-tetris-variant-1506.072042015-06-25 https://scifaro.com/en/abs/algorithmic-aspects-of-upper-domination-1506.072602015-06-25 https://scifaro.com/en/abs/discrete-gaussian-sampling-reduces-to-cvp-and-svp-1506.074902019-01-28 https://scifaro.com/en/abs/a-structural-approach-to-kernels-for-ilps-treewidth-and-total-unimodularity-1506.077292015-06-26 https://scifaro.com/en/abs/maximum-weighted-independent-sets-with-a-budget-1506.077732015-07-21 https://scifaro.com/en/abs/canonizing-graphs-of-bounded-tree-width-in-logspace-1506.078102015-06-26 https://scifaro.com/en/abs/general-caching-is-hard-even-with-small-pages-1506.079052015-06-29 https://scifaro.com/en/abs/a-super-grover-separation-between-randomized-and-quantum-query-complexities-1506.081062015-06-29 https://scifaro.com/en/abs/on-the-h-free-extension-complexity-of-the-tsp-1506.083112015-11-17 https://scifaro.com/en/abs/bust-a-move-puzzle-bobble-is-np-complete-1506.084092015-07-10 https://scifaro.com/en/abs/on-the-communication-complexity-of-distributed-clustering-1507.000262017-02-03 https://scifaro.com/en/abs/an-exponential-lower-bound-for-homogeneous-depth-5-circuits-over-finite-fields-1507.001772015-07-02 https://scifaro.com/en/abs/apx-hardness-of-maximizing-nash-social-welfare-with-indivisible-items-1507.011592015-07-07 https://scifaro.com/en/abs/a-reduction-from-valued-csp-to-min-cost-homomorphism-problem-for-digraphs-1507.017762015-07-08 https://scifaro.com/en/abs/towards-tight-lower-bounds-for-scheduling-problems-1507.019062015-07-08 https://scifaro.com/en/abs/lower-bounds-by-birkhoff-interpolation-1507.020152015-07-09 https://scifaro.com/en/abs/an-nl-complete-puzzle-1507.027232015-07-13 https://scifaro.com/en/abs/on-vanishing-of-kronecker-coefficients-1507.029552017-08-02 https://scifaro.com/en/abs/the-complexity-of-computing-the-optimal-composition-of-differential-privacy-1507.031132016-06-01 https://scifaro.com/en/abs/efficient-quantum-algorithms-for-gapped-group-testing-and-junta-testing-1507.031262015-07-15 https://scifaro.com/en/abs/on-the-polytope-escape-problem-for-continuous-linear-dynamical-systems-1507.031662017-02-14 https://scifaro.com/en/abs/polynomial-kernels-for-weighted-problems-1507.034392015-07-14 https://scifaro.com/en/abs/sub-exponential-approximation-schemes-for-csps-from-dense-to-almost-sparse-1507.043912015-07-17 https://scifaro.com/en/abs/incidence-geometries-and-the-pass-complexity-of-semi-streaming-set-cover-1507.046452015-08-11 https://scifaro.com/en/abs/the-complexity-of-switching-and-facts-maximum-potential-flow-problems-1507.048202015-07-20 https://scifaro.com/en/abs/a-polynomial-time-bounded-error-quantum-algorithm-for-boolean-satisfiability-1507.050612015-07-28 https://scifaro.com/en/abs/sos-and-planted-clique-tight-analysis-of-mpw-moments-at-all-degrees-and-an-optimal-lower-bound-at-degree-four-1507.052302015-07-21 https://scifaro.com/en/abs/computability-and-complexity-of-categorical-structures-1507.053052018-10-01 https://scifaro.com/en/abs/dual-normal-logic-programs-the-forgotten-class-1507.053882015-07-21 https://scifaro.com/en/abs/the-power-of-quantum-fourier-sampling-1507.055922015-07-21 https://scifaro.com/en/abs/on-the-gi-completeness-of-a-sorting-networks-isomorphism-1507.058412016-01-20 https://scifaro.com/en/abs/all-colors-shortest-path-problem-1507.068652015-07-27 https://scifaro.com/en/abs/testing-consumer-rationality-using-perfect-graphs-and-oriented-discs-1507.075812015-10-29 https://scifaro.com/en/abs/a-classification-of-connected-f-factor-problems-inside-np-1507.078562015-07-29 https://scifaro.com/en/abs/the-complexity-of-some-combinatorial-puzzles-1507.086902015-08-03 https://scifaro.com/en/abs/on-a-logical-model-of-combinatorial-problems-1508.000942016-03-02 https://scifaro.com/en/abs/noncommutative-valiant-s-classes-structure-and-complete-problems-1508.003952015-08-04 https://scifaro.com/en/abs/symmetries-of-matrix-multiplication-algorithms-i-1508.011102015-08-06 https://scifaro.com/en/abs/improved-constructions-of-two-source-extractors-1508.011152015-08-06 https://scifaro.com/en/abs/on-generating-the-ring-of-matrix-semi-invariants-1508.015542015-08-10 https://scifaro.com/en/abs/lower-bound-for-the-unique-games-problem-1508.015862015-08-10 https://scifaro.com/en/abs/on-percolation-and-np-hardness-1508.020712015-08-11 https://scifaro.com/en/abs/fourier-sparsity-of-gf-2-polynomials-1508.021582015-08-11 https://scifaro.com/en/abs/smooth-boolean-functions-are-easy-efficient-algorithms-for-low-sensitivity-functions-1508.024202015-08-12 https://scifaro.com/en/abs/addition-is-exponentially-harder-than-counting-for-shallow-monotone-circuits-1508.030612015-08-14 https://scifaro.com/en/abs/computing-spectra-on-the-solvability-complexity-index-hierarchy-and-towers-of-algorithms-1508.032802020-06-16 https://scifaro.com/en/abs/reachability-problems-for-continuous-chemical-reaction-networks-1508.041252015-09-04 https://scifaro.com/en/abs/fishing-out-winners-from-vote-streams-1508.045222015-09-08 https://scifaro.com/en/abs/the-backtracking-survey-propagation-algorithm-for-solving-random-k-sat-problems-1508.051172018-12-19 https://scifaro.com/en/abs/correlation-in-hard-distributions-in-communication-complexity-1508.051892015-08-25 https://scifaro.com/en/abs/lower-bounds-for-the-parameterized-complexity-of-minimum-fill-in-and-other-completion-problems-1508.052822015-10-16 https://scifaro.com/en/abs/tight-space-noise-tradeoffs-in-computing-the-ergodic-measure-1508.053722015-08-24 https://scifaro.com/en/abs/when-six-gates-are-not-enough-1508.057372016-08-08 https://scifaro.com/en/abs/n-permutability-and-linear-datalog-implies-symmetric-datalog-1508.057662023-06-22 https://scifaro.com/en/abs/on-the-role-of-shared-randomness-in-simultaneous-communication-1508.063952015-08-27 https://scifaro.com/en/abs/on-the-expressive-power-of-read-once-determinants-1508.065112015-08-27 https://scifaro.com/en/abs/the-depth-restricted-rectilinear-steiner-arborescence-problem-is-np-complete-1508.067922015-08-28 https://scifaro.com/en/abs/the-maximum-time-of-2-neighbour-bootstrap-percolation-in-grid-graphs-and-some-parameterized-results-1508.068472015-08-28 https://scifaro.com/en/abs/the-maximum-time-of-2-neighbor-bootstrap-percolation-complexity-results-1508.068742015-08-31 https://scifaro.com/en/abs/the-average-sensitivity-of-bounded-depth-formulas-1508.076772015-09-01 https://scifaro.com/en/abs/explicit-resilient-functions-matching-ajtai-linial-1509.000922016-04-19 https://scifaro.com/en/abs/parameterized-complexity-of-graph-constraint-logic-1509.026832015-09-10 https://scifaro.com/en/abs/the-complexity-of-counting-locally-maximal-satisfying-assignments-of-boolean-csps-1509.035432016-05-17 https://scifaro.com/en/abs/efficient-enumeration-of-solutions-produced-by-closure-operations-1509.056232015-09-22 https://scifaro.com/en/abs/the-shortest-path-problem-with-edge-information-reuse-is-np-complete-1509.056372016-07-18 https://scifaro.com/en/abs/metric-1-median-selection-query-complexity-vs-approximation-ratio-1509.056622015-09-21 https://scifaro.com/en/abs/on-space-efficiency-of-algorithms-working-on-structural-decompositions-of-graphs-1509.058962016-05-13 https://scifaro.com/en/abs/communication-complexity-for-algorithm-designers-1509.062572015-09-22 https://scifaro.com/en/abs/quantum-query-complexity-of-subgraph-isomorphism-and-homomorphism-1509.063612015-09-23 https://scifaro.com/en/abs/fast-parallel-fixed-parameter-algorithms-via-color-coding-1509.069842015-09-24 https://scifaro.com/en/abs/sparsification-upper-and-lower-bounds-for-graph-problems-and-not-all-equal-sat-1509.074372015-09-25 https://scifaro.com/en/abs/near-optimal-small-depth-lower-bounds-for-small-distance-connectivity-1509.074762015-09-25 https://scifaro.com/en/abs/fractional-coverings-greedy-coverings-and-rectifier-networks-1509.075882016-05-20 https://scifaro.com/en/abs/practical-algorithms-for-linear-boolean-width-1509.076872015-09-28 https://scifaro.com/en/abs/on-exact-counting-and-quasi-quantum-complexity-1509.077892015-09-28 https://scifaro.com/en/abs/often-harder-than-in-the-constructive-case-destructive-bribery-in-cp-nets-1509.086282015-09-30 https://scifaro.com/en/abs/polynomial-space-randomness-in-analysis-1509.088252016-04-27 https://scifaro.com/en/abs/quadratic-polynomials-of-small-modulus-cannot-represent-or-1509.088962015-11-13 https://scifaro.com/en/abs/making-problems-tractable-on-big-data-via-preprocessing-with-polylog-size-output-1510.002292015-10-02 https://scifaro.com/en/abs/on-the-sensitivity-of-k-uniform-hypergraph-properties-1510.003542017-09-26 https://scifaro.com/en/abs/a-note-on-graphs-with-2-bends-1510.006842015-10-05 https://scifaro.com/en/abs/on-the-hardest-problem-formulations-for-the-0-1-lasserre-hierarchy-1510.018912015-10-08 https://scifaro.com/en/abs/classical-and-quantum-algorithms-for-the-boolean-satisfiability-problem-1510.026822016-02-22 https://scifaro.com/en/abs/on-oblivious-branching-programs-with-bounded-repetition-that-cannot-efficiently-compute-cnfs-of-bounded-treewidth-1510.029512015-10-13 https://scifaro.com/en/abs/topological-lower-bounds-for-arithmetic-networks-1510.033872016-07-14 https://scifaro.com/en/abs/graph-editing-problems-with-extended-regularity-constraints-1510.034822017-03-06 https://scifaro.com/en/abs/counting-euler-tours-in-undirected-bounded-treewidth-graphs-1510.040352015-12-15 https://scifaro.com/en/abs/a-lower-bound-for-the-dispersion-on-the-torus-1510.046172019-08-15 https://scifaro.com/en/abs/subtree-isomorphism-revisited-1510.046222015-10-16 https://scifaro.com/en/abs/how-the-structure-of-precedence-constraints-may-change-the-complexity-class-of-scheduling-problems-1510.048332017-01-25 https://scifaro.com/en/abs/using-duality-in-circuit-complexity-1510.048492015-10-19 https://scifaro.com/en/abs/integrality-gaps-and-approximation-algorithms-for-dispersers-and-bipartite-expanders-1510.051372015-10-20 https://scifaro.com/en/abs/two-types-of-branching-programs-with-bounded-repetition-that-cannot-efficiently-compute-monotone-3-cnfs-1510.054862016-05-17 https://scifaro.com/en/abs/connectivity-of-boolean-satisfiability-1510.067002015-10-23 https://scifaro.com/en/abs/space-complexity-of-list-h-coloring-revisited-the-case-of-oriented-trees-1510.071242015-10-27 https://scifaro.com/en/abs/recognizing-union-find-trees-is-np-complete-1510.074622017-01-06 https://scifaro.com/en/abs/graph-properties-in-node-query-setting-effect-of-breaking-symmetry-1510.082672015-10-29 https://scifaro.com/en/abs/quantum-oracle-classification-the-case-of-group-structure-1510.083522015-10-29 https://scifaro.com/en/abs/monotone-projection-lower-bounds-from-extended-formulation-lower-bounds-1510.084172018-06-11 https://scifaro.com/en/abs/effect-of-gromov-hyperbolicity-parameter-on-cuts-and-expansions-in-graphs-and-some-algorithmic-implications-1510.087792018-08-20 https://scifaro.com/en/abs/approximation-via-correlation-decay-when-strong-spatial-mixing-fails-1510.091932019-02-04 https://scifaro.com/en/abs/the-constant-inapproximability-of-the-parameterized-dominating-set-problem-1511.000752015-11-17 https://scifaro.com/en/abs/group-isomorphism-with-fixed-subnormal-chains-1511.001512015-11-03 https://scifaro.com/en/abs/algorithmic-information-plane-kakeya-sets-and-conditional-dimension-1511.004422016-12-02 https://scifaro.com/en/abs/basis-collapse-for-holographic-algorithms-over-all-domain-sizes-1511.007782015-11-04 https://scifaro.com/en/abs/sat-as-a-game-1511.008132015-11-04 https://scifaro.com/en/abs/undirected-cat-and-mouse-is-p-complete-1511.009842015-11-04 https://scifaro.com/en/abs/equality-revisited-1511.012112022-04-05 https://scifaro.com/en/abs/base-collapse-of-holographic-algorithms-1511.012302015-11-05 https://scifaro.com/en/abs/low-rank-approximation-of-binary-matrices-column-subset-selection-and-generalizations-1511.016992017-04-21 https://scifaro.com/en/abs/some-lower-bound-results-for-set-multilinear-arithmetic-computations-1511.023082015-11-10 https://scifaro.com/en/abs/parameterizing-the-permanent-genus-apices-minors-evaluation-mod-2-k-1511.023212015-11-10 https://scifaro.com/en/abs/the-periodic-joint-replenishment-problem-is-strongly-np-hard-1511.024542015-11-10 https://scifaro.com/en/abs/block-interpolation-a-framework-for-tight-exponential-time-counting-complexity-1511.029102017-05-09 https://scifaro.com/en/abs/membership-in-moment-polytopes-is-in-np-and-conp-1511.036752017-06-27 https://scifaro.com/en/abs/operator-scaling-theory-and-applications-1511.037302019-01-25 https://scifaro.com/en/abs/hardness-of-rna-folding-problem-with-four-symbols-1511.047312018-03-23 https://scifaro.com/en/abs/an-extended-coding-theorem-with-application-to-quantum-complexities-1511.050062021-01-25 https://scifaro.com/en/abs/depth-highness-and-dnr-degrees-1511.050272023-06-22 https://scifaro.com/en/abs/a-polynomial-lower-bound-for-testing-monotonicity-1511.050532015-11-17 https://scifaro.com/en/abs/a-note-on-almost-perfect-probabilistically-checkable-proofs-of-proximity-1511.051782015-11-18 https://scifaro.com/en/abs/counting-ones-without-broadword-operations-1511.052102016-01-19 https://scifaro.com/en/abs/complexity-and-approximability-of-parameterized-max-csps-1511.055462018-04-24 https://scifaro.com/en/abs/simulating-branching-programs-with-edit-distance-and-friends-or-a-polylog-shaved-is-a-lower-bound-made-1511.060222015-11-20 https://scifaro.com/en/abs/decentralization-of-a-machine-some-definitions-1511.063842015-11-23 https://scifaro.com/en/abs/near-optimal-ugc-hardness-of-approximating-max-k-csp-r-1511.065582015-11-23 https://scifaro.com/en/abs/which-regular-expression-patterns-are-hard-to-match-1511.070702016-09-28 https://scifaro.com/en/abs/a-reduction-of-the-logspace-shortest-path-problem-to-biconnected-graphs-1511.071002015-11-24 https://scifaro.com/en/abs/identity-testing-and-lower-bounds-for-read-k-oblivious-algebraic-branching-programs-1511.071362015-11-24 https://scifaro.com/en/abs/parity-separation-a-scientifically-proven-method-for-permanent-weight-loss-1511.074802015-11-25 https://scifaro.com/en/abs/decoding-reed-muller-codes-over-product-sets-1511.074882015-11-25 https://scifaro.com/en/abs/lower-bounds-for-constant-query-affine-invariant-lccs-and-ltcs-1511.075582015-11-25 https://scifaro.com/en/abs/on-the-computational-complexity-of-limit-cycles-in-dynamical-systems-1511.076052015-11-25 https://scifaro.com/en/abs/a-communication-game-related-to-the-sensitivity-conjecture-1511.077292015-11-25 https://scifaro.com/en/abs/super-linear-gate-and-super-quadratic-wire-lower-bounds-for-depth-two-and-depth-three-threshold-circuits-1511.078602018-02-01 https://scifaro.com/en/abs/r-enyi-information-complexity-and-an-information-theoretic-characterization-of-the-partition-bound-1511.079492016-06-29 https://scifaro.com/en/abs/permanent-versus-determinant-obstructions-and-kronecker-coefficients-1511.081132016-05-10 https://scifaro.com/en/abs/graph-isomorphism-and-circuit-size-1511.081892018-04-03 https://scifaro.com/en/abs/on-the-hardness-of-learning-sparse-parities-1511.082702015-11-30 https://scifaro.com/en/abs/parameterized-extension-complexity-of-independent-set-and-related-problems-1511.088412017-03-08 https://scifaro.com/en/abs/some-bounds-on-communication-complexity-of-gap-hamming-distance-1511.088542015-12-02 https://scifaro.com/en/abs/fractals-for-kernelization-lower-bounds-1512.003332017-12-27 https://scifaro.com/en/abs/almost-quadratic-gap-between-partition-complexity-and-query-communication-complexity-1512.006612015-12-03 https://scifaro.com/en/abs/robustly-solvable-constraint-satisfaction-problems-1512.011572015-12-04 https://scifaro.com/en/abs/nearly-optimal-separations-between-communication-or-query-complexity-and-partitions-1512.012102016-05-24 https://scifaro.com/en/abs/partition-bound-is-quadratically-tight-for-product-distributions-1512.019682020-05-08 https://scifaro.com/en/abs/crossing-number-is-hard-for-kernelization-1512.023792016-02-19 https://scifaro.com/en/abs/new-deterministic-algorithms-for-solving-parity-games-1512.032462015-12-12 https://scifaro.com/en/abs/constructive-noncommutative-rank-computation-is-in-deterministic-polynomial-time-1512.035312018-02-06 https://scifaro.com/en/abs/limitations-of-sum-of-products-of-read-once-polynomials-1512.036072015-12-14 https://scifaro.com/en/abs/rectangular-kronecker-coefficients-and-plethysms-in-geometric-complexity-theory-1512.037982017-08-14 https://scifaro.com/en/abs/search-to-decision-reductions-for-lattice-problems-with-approximation-factors-slightly-greater-than-one-1512.041382019-01-28 https://scifaro.com/en/abs/read-once-polynomials-how-many-summands-suffice-1512.043862015-12-15 https://scifaro.com/en/abs/strong-reductions-for-extended-formulations-1512.049322018-10-23 https://scifaro.com/en/abs/extension-of-cellular-automata-by-introducing-an-algorithm-of-recursive-estimation-of-neighbors-1512.051992015-12-22 https://scifaro.com/en/abs/algorithmic-aspects-of-branched-coverings-1512.059482017-06-20 https://scifaro.com/en/abs/advice-complexity-of-the-online-induced-subgraph-problem-1512.059962015-12-21 https://scifaro.com/en/abs/inside-the-clustering-window-for-random-linear-equations-1512.066572017-02-03 https://scifaro.com/en/abs/closing-the-gap-between-short-and-long-xors-for-model-counting-1512.088632016-09-12 https://scifaro.com/en/abs/counting-independent-terms-in-big-oh-notation-1512.093632017-11-13 https://scifaro.com/en/abs/asymptotic-intrinsic-universality-and-reprogrammability-by-behavioural-emulation-1601.003352016-01-14 https://scifaro.com/en/abs/motivating-time-inconsistent-agents-a-computational-approach-1601.004792016-01-05 https://scifaro.com/en/abs/spectral-and-modular-analysis-of-p-problems-1601.006912016-01-11 https://scifaro.com/en/abs/uniform-circuit-and-logarithmic-space-approximations-of-refined-combinatorial-optimization-problems-1601.011182016-01-07 https://scifaro.com/en/abs/on-computing-tree-and-path-decompositions-with-metric-constraints-on-the-bags-1601.019582016-01-11 https://scifaro.com/en/abs/on-the-sum-of-squares-degree-of-symmetric-quadratic-functions-1601.023112016-03-09 https://scifaro.com/en/abs/minimum-average-delay-of-routing-trees-1601.026972016-01-13 https://scifaro.com/en/abs/p-vs-np-1601.036192025-05-09 https://scifaro.com/en/abs/complexity-analysis-of-2-heterogeneous-minimum-spanning-forest-problem-1601.041252016-01-19 https://scifaro.com/en/abs/strong-eth-breaks-with-merlin-and-arthur-short-non-interactive-proofs-of-batch-evaluation-1601.047432016-01-20 https://scifaro.com/en/abs/solutions-to-the-problem-of-k-sat-k-col-phase-transition-location-1601.047942016-01-20 https://scifaro.com/en/abs/fixed-parameter-approximability-of-boolean-mincsps-1601.049352018-05-09 https://scifaro.com/en/abs/on-the-complexity-of-bounded-time-and-precision-reachability-for-piecewise-affine-systems-1601.053532017-01-18 https://scifaro.com/en/abs/polynomial-time-corresponds-to-solutions-of-polynomial-ordinary-differential-equations-of-polynomial-length-1601.053602017-01-18 https://scifaro.com/en/abs/autoreducibility-of-np-complete-sets-1601.054942016-01-22 https://scifaro.com/en/abs/computing-with-polynomial-ordinary-differential-equations-1601.056832017-01-18 https://scifaro.com/en/abs/bipartite-perfect-matching-is-in-quasi-nc-1601.063192018-07-16 https://scifaro.com/en/abs/identity-testing-for-constant-width-and-any-order-read-once-oblivious-arithmetic-branching-programs-1601.080312018-07-11 https://scifaro.com/en/abs/interval-linear-algebra-and-computational-complexity-1602.003492016-02-02 https://scifaro.com/en/abs/a-short-note-on-improved-logic-circuits-in-a-hexagonal-minesweeper-1602.003982016-02-02 https://scifaro.com/en/abs/on-the-functions-generated-by-the-general-purpose-analog-computer-1602.005462018-01-23 https://scifaro.com/en/abs/the-minimum-shared-edges-problem-on-planar-graphs-1602.013852016-02-04 https://scifaro.com/en/abs/randomness-extraction-in-ac0-and-with-small-locality-1602.015302018-06-12 https://scifaro.com/en/abs/the-parameterized-complexity-of-the-minimum-shared-edges-problem-1602.017392016-02-05 https://scifaro.com/en/abs/a-short-note-on-merlin-arthur-protocols-for-subset-sum-1602.018192016-02-05 https://scifaro.com/en/abs/a-note-on-the-complexity-of-computing-the-number-of-reachable-vertices-in-a-digraph-1602.021292016-02-08 https://scifaro.com/en/abs/a-finitely-presented-group-whose-word-problem-has-sampleable-hard-instances-1602.024322016-02-09 https://scifaro.com/en/abs/a-logspace-solution-to-the-word-and-conjugacy-problem-of-generalized-baumslag-solitar-groups-1602.024452016-03-01 https://scifaro.com/en/abs/efficient-reassembling-of-graphs-part-2-the-balanced-case-1602.028632016-02-10 https://scifaro.com/en/abs/complete-problems-of-propositional-logic-for-the-exponential-hierarchy-1602.030502016-05-30 https://scifaro.com/en/abs/even-delta-matroids-and-the-complexity-of-planar-boolean-csps-1602.031242018-06-15 https://scifaro.com/en/abs/polynomial-depth-highness-and-lowness-for-e-1602.033322019-10-16 https://scifaro.com/en/abs/a-complexity-trichotomy-for-approximately-counting-list-h-colourings-1602.039852017-01-06 https://scifaro.com/en/abs/circuit-evaluation-for-finite-semirings-1602.045602016-09-27 https://scifaro.com/en/abs/on-alternation-and-the-union-theorem-1602.047812016-06-06 https://scifaro.com/en/abs/constructive-patterns-of-logical-truth-1602.049552016-07-12 https://scifaro.com/en/abs/entangled-simultaneity-versus-classical-interactivity-in-communication-complexity-1602.050592022-04-05 https://scifaro.com/en/abs/approximation-and-hardness-for-token-swapping-1602.051502017-07-28 https://scifaro.com/en/abs/order-to-chaos-transition-in-the-hardness-of-random-boolean-satisfiability-problems-1602.051522016-04-21 https://scifaro.com/en/abs/the-computational-complexity-of-the-frobenius-problem-1602.056572016-11-16 https://scifaro.com/en/abs/pspace-complete-two-color-placement-games-1602.060122016-02-22 https://scifaro.com/en/abs/tribes-is-hard-in-the-message-passing-model-1602.060792016-02-22 https://scifaro.com/en/abs/checking-dynamic-consistency-of-conditional-hyper-temporal-networks-via-mean-payoff-games-hardness-and-pseudo-singly-exponential-time-algorithm-1602.062602017-04-18 https://scifaro.com/en/abs/on-planar-valued-csps-1602.063232017-04-12 https://scifaro.com/en/abs/computing-halting-probabilities-from-other-halting-probabilities-1602.063952016-10-04 https://scifaro.com/en/abs/sensitivity-conjecture-and-log-rank-conjecture-for-functions-with-small-alternating-numbers-1602.066272016-04-08 https://scifaro.com/en/abs/lower-bound-for-the-complexity-of-the-boolean-satisfiability-problem-1602.068672016-04-15 https://scifaro.com/en/abs/lower-bounds-on-the-redundancy-in-computations-from-random-oracles-via-betting-strategies-with-restricted-wagers-1602.071132017-06-13 https://scifaro.com/en/abs/hamiltonian-paths-in-c-shaped-grid-graphs-1602.074072016-02-25 https://scifaro.com/en/abs/noisy-population-recovery-in-polynomial-time-1602.076162016-02-25 https://scifaro.com/en/abs/probe-machine-1602.077962016-03-01 https://scifaro.com/en/abs/minimum-cost-homomorphisms-with-constrained-costs-1602.078272016-08-23 https://scifaro.com/en/abs/zero-suppressed-computation-a-new-computation-inspired-by-zdds-1602.080342016-02-26 https://scifaro.com/en/abs/an-exponential-separation-between-randomized-and-deterministic-complexity-in-the-local-model-1602.081662016-04-07 https://scifaro.com/en/abs/approximation-hardness-of-shortest-common-superstring-variants-1602.086482016-03-01 https://scifaro.com/en/abs/the-parameterized-space-complexity-of-embedding-along-a-path-1602.090222017-01-09 https://scifaro.com/en/abs/a-complexity-dichotomy-for-poset-constraint-satisfaction-1603.000822016-09-27 https://scifaro.com/en/abs/on-the-hardness-of-switching-to-a-small-number-of-edges-1603.002542016-03-02 https://scifaro.com/en/abs/trainyard-is-np-hard-1603.009282016-03-04 https://scifaro.com/en/abs/generation-ranking-and-unranking-of-ordered-trees-with-degree-bounds-1603.009772016-08-22 https://scifaro.com/en/abs/on-the-complexity-of-detecting-constrained-negative-cost-cycles-1603.019252017-05-23 https://scifaro.com/en/abs/on-the-implicit-graph-conjecture-1603.019772018-02-02 https://scifaro.com/en/abs/on-the-limitations-of-analysing-worst-case-dynamic-energy-of-processing-1603.025802018-02-22 https://scifaro.com/en/abs/sums-of-read-once-formulas-how-many-summands-suffice-1603.026052016-03-09 https://scifaro.com/en/abs/computational-complexity-of-exterior-products-and-multi-particle-amplitudes-of-non-interacting-fermions-in-entangled-states-1603.027242017-08-08 https://scifaro.com/en/abs/projective-cofactor-decompositions-of-boolean-functions-and-the-satisfiability-problem-1603.045692017-05-09 https://scifaro.com/en/abs/some-complete-and-intermediate-polynomials-in-algebraic-complexity-theory-1603.046062016-03-16 https://scifaro.com/en/abs/on-the-effect-of-randomness-on-planted-3-coloring-models-1603.051832016-03-17 https://scifaro.com/en/abs/holographic-algorithm-with-matchgates-is-universal-for-planar-csp-over-boolean-domain-1603.070462016-03-24 https://scifaro.com/en/abs/nonnegative-rank-vs-binary-rank-1603.077792016-03-28 https://scifaro.com/en/abs/extension-complexity-of-formal-languages-1603.077862019-08-29 https://scifaro.com/en/abs/monotone-3-sat-4-is-np-complete-1603.078812016-03-28 https://scifaro.com/en/abs/a-note-on-the-computational-complexity-of-unsmoothened-vertex-attack-tolerance-1603.084302016-03-29 https://scifaro.com/en/abs/shortest-path-and-maximum-flow-problems-in-planar-flow-networks-with-additive-gains-and-losses-1603.089972016-03-31 https://scifaro.com/en/abs/mutual-dimension-and-random-sequences-1603.093902016-04-01 https://scifaro.com/en/abs/a-model-theoretic-characterization-of-constant-depth-arithmetic-circuits-1603.095312020-05-08 https://scifaro.com/en/abs/differences-of-halting-probabilities-1604.002162017-05-22 https://scifaro.com/en/abs/polarity-and-monopolarity-of-3-colourable-comparability-graphs-1604.009052016-04-06 https://scifaro.com/en/abs/asking-the-metaquestions-in-constraint-tractability-1604.009322017-01-09 https://scifaro.com/en/abs/an-axiomatic-and-an-average-case-analysis-of-algorithms-and-heuristics-for-metric-properties-of-graphs-1604.014452017-01-17 https://scifaro.com/en/abs/non-deterministic-branching-programs-with-logarithmic-repetition-cannot-efficiently-compute-small-monotone-cnfs-1604.015602016-04-08 https://scifaro.com/en/abs/two-level-lot-sizing-with-inventory-bounds-1604.022782018-02-05 https://scifaro.com/en/abs/the-complexity-of-computing-almost-unitary-matrices-with-eps-copies-of-the-fourier-transform-1604.025572019-04-18 https://scifaro.com/en/abs/high-dimensional-random-walks-and-colorful-expansion-1604.029472016-09-15 https://scifaro.com/en/abs/a-nearly-tight-sum-of-squares-lower-bound-for-the-planted-clique-problem-1604.030842016-04-13 https://scifaro.com/en/abs/separating-sets-of-strings-by-finding-matching-patterns-is-almost-always-hard-1604.032432016-12-20 https://scifaro.com/en/abs/the-existence-of-the-tau-one-way-functions-class-as-a-proof-that-p-np-1604.037582016-10-18 https://scifaro.com/en/abs/scalefree-hardness-of-average-case-euclidean-tsp-approximation-1604.045492019-08-02 https://scifaro.com/en/abs/complexity-dichotomies-for-unweighted-scoring-rules-1604.052642016-04-19 https://scifaro.com/en/abs/acyclic-constraint-logic-and-games-1604.054872016-04-20 https://scifaro.com/en/abs/pebbling-meets-coloring-reversible-pebble-game-on-trees-1604.055102016-04-20 https://scifaro.com/en/abs/on-planar-variants-of-the-monotone-satisfiability-problem-with-bounded-variable-appearances-1604.055882016-04-20 https://scifaro.com/en/abs/online-chromatic-number-is-pspace-complete-1604.059402017-06-27 https://scifaro.com/en/abs/no-occurrence-obstructions-in-geometric-complexity-theory-1604.064312018-09-18 https://scifaro.com/en/abs/descriptive-complexity-of-textrm-ac-0-functions-1604.066172020-05-08 https://scifaro.com/en/abs/extension-complexity-of-independent-set-polytopes-1604.070622016-04-26 https://scifaro.com/en/abs/the-dichotomy-for-conservative-constraint-satisfaction-is-polynomially-decidable-1604.070632016-06-21 https://scifaro.com/en/abs/characterization-and-lower-bounds-for-branching-program-size-using-projective-dimension-1604.072002020-01-10 https://scifaro.com/en/abs/degree-and-sensitivity-tails-of-two-distributions-1604.074322016-04-27 https://scifaro.com/en/abs/the-complexity-of-rummikub-problems-1604.075532016-04-27 https://scifaro.com/en/abs/assessing-the-computational-complexity-of-multi-layer-subgraph-detection-1604.077242019-10-23 https://scifaro.com/en/abs/the-systematic-normal-form-of-lattices-1604.078002016-04-27 https://scifaro.com/en/abs/the-power-of-arc-consistency-for-csps-defined-by-partially-ordered-forbidden-patterns-1604.079812023-06-22 https://scifaro.com/en/abs/on-polynomial-approximations-to-ac-0-1604.081212020-01-01 https://scifaro.com/en/abs/optimal-pattern-matching-algorithms-1604.084372016-05-03 https://scifaro.com/en/abs/polynomial-time-kernel-reductions-1604.085582016-04-29 https://scifaro.com/en/abs/complexity-hierarchies-and-higher-order-cons-free-rewriting-1604.089362016-05-02 https://scifaro.com/en/abs/weaker-consistency-notions-for-all-the-csps-of-bounded-width-1605.005652016-07-15 https://scifaro.com/en/abs/sum-of-squares-certificates-for-maxima-of-random-tensors-on-the-sphere-1605.009032017-06-20 https://scifaro.com/en/abs/on-entropic-convergence-of-algorithms-in-terms-of-domain-partitions-1605.015192016-05-06 https://scifaro.com/en/abs/two-sided-quantum-amplitude-amplification-and-exact-error-algorithms-1605.018282016-05-09 https://scifaro.com/en/abs/the-complexity-of-simulation-and-matrix-multiplication-1605.021562016-08-31 https://scifaro.com/en/abs/boundaries-of-vp-and-vnp-1605.028152016-05-11 https://scifaro.com/en/abs/tight-sum-of-squares-lower-bounds-for-binary-polynomial-optimization-problems-1605.030192016-05-11 https://scifaro.com/en/abs/this-house-proves-that-debating-is-harder-than-soccer-1605.030632016-05-11 https://scifaro.com/en/abs/on-exponential-lower-bounds-for-polytopes-in-combinatorial-optimization-by-fiorini-et-al-2015-a-refutation-for-models-with-disjoint-sets-of-descriptive-variables-1605.032432016-10-21 https://scifaro.com/en/abs/arrival-a-zero-player-graph-game-in-np-cap-conp-1605.035462017-06-26 https://scifaro.com/en/abs/functional-lower-bounds-for-arithmetic-circuits-and-connections-to-boolean-circuit-complexity-1605.042072016-05-16 https://scifaro.com/en/abs/on-the-complexity-of-connection-games-1605.047152016-05-17 https://scifaro.com/en/abs/how-hard-is-it-to-verify-flat-affine-counter-systems-with-the-finite-monoid-property-1605.058362016-05-20 https://scifaro.com/en/abs/random-numbers-as-probabilities-of-machine-behaviour-1605.058382017-06-13 https://scifaro.com/en/abs/keeping-your-distance-is-hard-1605.068012019-02-12 https://scifaro.com/en/abs/nonnegative-matrix-factorization-requires-irrationality-1605.068482017-03-24 https://scifaro.com/en/abs/low-sensitivity-functions-from-unambiguous-certificates-1605.070842017-11-17 https://scifaro.com/en/abs/a-handle-is-enough-for-a-hard-game-of-pull-1605.089512018-01-01 https://scifaro.com/en/abs/randomized-query-complexity-of-sabotaged-and-composed-functions-1605.090712016-12-06 https://scifaro.com/en/abs/randomized-polynomial-time-identity-testing-for-noncommutative-circuits-1606.005962016-06-07 https://scifaro.com/en/abs/generic-case-completeness-1606.011722016-06-06 https://scifaro.com/en/abs/walking-on-the-edge-and-cosystolic-expansion-1606.018442016-06-07 https://scifaro.com/en/abs/the-power-of-sherali-adams-relaxations-for-general-valued-csps-1606.025772017-07-25 https://scifaro.com/en/abs/optimal-sparsification-for-some-binary-csps-using-low-degree-polynomials-1606.032332019-07-01 https://scifaro.com/en/abs/on-the-complexity-of-probabilistic-trials-for-hidden-satisfiability-problems-1606.035852016-06-14 https://scifaro.com/en/abs/adaptivity-vs-postselection-1606.040162016-10-17 https://scifaro.com/en/abs/the-chasm-at-depth-four-and-tensor-rank-old-results-new-insights-1606.042002017-08-02 https://scifaro.com/en/abs/on-degeneration-of-tensors-and-algebras-1606.042532016-08-25 https://scifaro.com/en/abs/the-parameterized-complexity-of-fixing-number-and-vertex-individualization-in-graphs-1606.043832016-06-15 https://scifaro.com/en/abs/settling-the-complexity-of-computing-approximate-two-player-nash-equilibria-1606.045502016-08-31 https://scifaro.com/en/abs/algebraic-problems-equivalent-to-beating-exponent-3-2-for-polynomial-factorization-over-finite-fields-1606.045922016-06-16 https://scifaro.com/en/abs/trading-determinism-for-time-in-space-bounded-computations-1606.046492016-06-16 https://scifaro.com/en/abs/proof-complexity-lower-bounds-from-algebraic-circuit-complexity-1606.050502016-06-17 https://scifaro.com/en/abs/the-pattern-basis-approach-to-circuit-complexity-1606.053312016-06-17 https://scifaro.com/en/abs/fine-grained-dichotomies-for-the-tutte-plane-and-boolean-csp-1606.065812016-06-22 https://scifaro.com/en/abs/the-information-content-of-systems-in-general-physical-theories-1606.068012016-06-23 https://scifaro.com/en/abs/physical-computation-p-poly-and-p-log-1606.068032016-06-23 https://scifaro.com/en/abs/multi-party-protocols-information-complexity-and-privacy-1606.068722018-12-18 https://scifaro.com/en/abs/optimal-redundancy-in-computations-from-random-oracles-1606.079102017-06-13 https://scifaro.com/en/abs/some-lower-bounds-in-parameterized-rm-ac-0-1606.080142016-06-28 https://scifaro.com/en/abs/minimum-fill-in-inapproximability-and-almost-tight-lower-bounds-1606.081412016-06-28 https://scifaro.com/en/abs/the-parameterized-complexity-of-finding-secluded-solutions-to-some-classical-optimization-problems-on-graphs-1606.090002019-11-14 https://scifaro.com/en/abs/a-linear-lower-bound-for-incrementing-a-space-optimal-integer-representation-in-the-bit-probe-model-1607.002422017-02-16 https://scifaro.com/en/abs/lower-bounds-for-alternating-online-state-complexity-1607.002592016-11-10 https://scifaro.com/en/abs/algebraic-proof-complexity-progress-frontiers-and-challenges-1607.004432016-07-05 https://scifaro.com/en/abs/width-depth-and-space-1607.009452016-08-09 https://scifaro.com/en/abs/on-the-computational-complexities-of-three-privacy-measures-for-large-networks-under-active-attack-1607.014382016-07-07 https://scifaro.com/en/abs/the-zero-error-randomized-query-complexity-of-the-pointer-function-1607.016842016-07-07 https://scifaro.com/en/abs/single-player-and-two-player-buttons-scissors-games-1607.018262016-07-08 https://scifaro.com/en/abs/strengthening-hardness-results-to-3-connected-planar-graphs-1607.023462016-07-11 https://scifaro.com/en/abs/a-birthday-repetition-theorem-and-complexity-of-approximating-dense-csps-1607.029862016-07-12 https://scifaro.com/en/abs/on-the-algebraic-representation-of-one-tape-deterministic-turing-machine-1607.038102016-07-14 https://scifaro.com/en/abs/computational-complexity-of-arranging-music-1607.042202016-07-15 https://scifaro.com/en/abs/improving-viterbi-is-hard-better-runtimes-imply-faster-clique-algorithms-1607.042292016-11-04 https://scifaro.com/en/abs/linear-diophantine-equations-group-csps-and-graph-isomorphism-1607.042872016-07-18 https://scifaro.com/en/abs/the-minrank-of-random-graphs-1607.048422017-02-17 https://scifaro.com/en/abs/improved-hardness-for-cut-interdiction-and-firefighter-problems-1607.051332016-07-19 https://scifaro.com/en/abs/on-the-sensitivity-conjecture-for-disjunctive-normal-forms-1607.051892016-12-08 https://scifaro.com/en/abs/reconstruction-algorithms-for-sums-of-affine-powers-1607.054202017-10-25 https://scifaro.com/en/abs/on-the-complexity-of-partial-derivatives-1607.054942017-06-01 https://scifaro.com/en/abs/an-fptas-for-the-volume-of-a-cal-v-polytope-it-is-hard-to-compute-the-volume-of-the-intersection-of-two-cross-polytopes-1607.061732016-07-22 https://scifaro.com/en/abs/the-complexity-of-drawing-graphs-on-few-lines-and-few-planes-1607.064442024-03-04 https://scifaro.com/en/abs/algorithmic-and-optimization-aspects-of-brascamp-lieb-inequalities-via-operator-scaling-1607.067112018-04-16 https://scifaro.com/en/abs/a-no-go-theorem-for-derandomized-parallel-repetition-beyond-feige-kilian-1607.071302016-07-26 https://scifaro.com/en/abs/quantum-advantage-on-information-leakage-for-equality-1607.075162016-07-27 https://scifaro.com/en/abs/complexity-of-token-swapping-and-its-variants-1607.076762018-01-08 https://scifaro.com/en/abs/a-note-on-approximation-schemes-for-a-subclass-of-subset-selection-problems-and-a-faster-fptas-for-the-minimum-knapsack-problem-1607.079502016-07-28 https://scifaro.com/en/abs/the-descriptive-complexity-of-subgraph-isomorphism-without-numerics-1607.080672017-09-12 https://scifaro.com/en/abs/algorithmic-statistics-forty-years-later-1607.080772017-03-08 https://scifaro.com/en/abs/computing-exponentially-faster-implementing-a-nondeterministic-universal-turing-machine-using-dna-1607.080782016-08-02 https://scifaro.com/en/abs/counting-matchings-with-k-unmatched-vertices-in-planar-graphs-1607.081922016-07-28 https://scifaro.com/en/abs/improved-non-malleable-extractors-non-malleable-codes-and-independent-source-extractors-1608.001272016-08-02 https://scifaro.com/en/abs/computational-complexity-of-solving-polynomial-differential-equations-over-unbounded-domains-with-non-rational-coefficients-1608.001352016-08-02 https://scifaro.com/en/abs/uncountable-classical-and-quantum-complexity-classes-1608.004172016-08-02 https://scifaro.com/en/abs/from-weak-to-strong-lp-gaps-for-all-csps-1608.004972016-08-02 https://scifaro.com/en/abs/kobayashi-compressibility-1608.006922017-02-28 https://scifaro.com/en/abs/the-real-nonnegative-inverse-eigenvalue-problem-is-np-hard-1608.009312017-02-14 https://scifaro.com/en/abs/solving-laplacian-systems-in-logarithmic-space-1608.014262016-08-05 https://scifaro.com/en/abs/nondeterminism-and-an-abstract-formulation-of-ne-v-c-iporuk-s-lower-bound-method-1608.019322019-12-04 https://scifaro.com/en/abs/pointed-computations-and-martin-l-of-randomness-1608.020812017-03-03 https://scifaro.com/en/abs/tight-network-topology-dependent-bounds-on-rounds-of-communication-1608.033132016-11-02 https://scifaro.com/en/abs/optimal-polynomial-time-estimators-a-bayesian-notion-of-approximation-algorithm-1608.041122025-06-27 https://scifaro.com/en/abs/bounded-turing-reductions-and-data-processing-inequalities-for-sequences-1608.047642016-08-18 https://scifaro.com/en/abs/on-semiring-complexity-of-schur-polynomials-1608.050432018-05-22 https://scifaro.com/en/abs/binary-constraint-satisfaction-problems-defined-by-excluded-topological-minors-1608.053582019-06-28 https://scifaro.com/en/abs/on-the-sensitivity-complexity-of-k-uniform-hypergraph-properties-1608.067242016-08-25 https://scifaro.com/en/abs/a-2n-2-log-n-1-lower-bound-for-the-border-rank-of-matrix-multiplication-1608.074862016-08-29 https://scifaro.com/en/abs/p-and-oplus-p-completeness-of-counting-roots-of-a-sparse-polynomial-1608.075642016-08-29 https://scifaro.com/en/abs/roughly-polynomial-time-a-concept-of-tractability-covering-all-known-natural-np-complete-problems-1608.086792016-09-01 https://scifaro.com/en/abs/subset-sum-problems-with-digraph-constraints-1609.010782016-09-06 https://scifaro.com/en/abs/quantum-one-way-permutation-over-the-finite-field-of-two-elements-1609.015412017-05-01 https://scifaro.com/en/abs/on-the-existence-of-weak-one-way-functions-1609.015752023-07-19 https://scifaro.com/en/abs/on-the-power-of-statistical-zero-knowledge-1609.028882017-05-10 https://scifaro.com/en/abs/paraunitary-matrices-entropy-algebraic-condition-number-and-fourier-computation-1609.032782018-11-09 https://scifaro.com/en/abs/did-the-train-reach-its-destination-the-complexity-of-finding-a-witness-1609.038402017-01-09 https://scifaro.com/en/abs/polymorphisms-and-circuit-complexity-1609.042742017-05-10 https://scifaro.com/en/abs/a-tighter-relation-between-sensitivity-and-certificate-complexity-1609.043422016-09-15 https://scifaro.com/en/abs/minimum-eccentricity-shortest-path-problem-an-approximation-algorithm-and-relation-with-the-k-laminarity-problem-1609.045932016-09-16 https://scifaro.com/en/abs/steiner-network-problems-on-temporal-graphs-1609.049182017-09-04 https://scifaro.com/en/abs/lower-bounds-for-sensitivity-of-graph-properties-1609.053202016-09-20 https://scifaro.com/en/abs/frameworks-for-solving-turing-kernel-lower-bound-problem-and-finding-natural-candidate-problems-in-np-intermediate-1609.054722016-11-22 https://scifaro.com/en/abs/a-3-cnf-sat-descriptor-algebra-and-the-solution-of-the-p-np-conjecture-1609.057092020-01-06 https://scifaro.com/en/abs/on-the-relative-power-of-reduction-notions-in-arithmetic-circuit-complexity-1609.059422016-09-21 https://scifaro.com/en/abs/list-approximation-for-increasing-kolmogorov-complexity-1609.059842017-02-07 https://scifaro.com/en/abs/outlaw-distributions-and-locally-decodable-codes-1609.063552017-06-28 https://scifaro.com/en/abs/global-versus-local-computations-fast-computing-with-identifiers-1609.065082017-05-30 https://scifaro.com/en/abs/the-complexity-of-the-numerical-semigroup-gap-counting-problem-1609.065152017-01-05 https://scifaro.com/en/abs/improving-and-extending-the-testing-of-distributions-for-shape-restricted-properties-1609.067362016-09-23 https://scifaro.com/en/abs/streaming-communication-protocols-1609.070592016-09-23 https://scifaro.com/en/abs/an-information-based-classification-of-elementary-cellular-automata-1609.075542017-03-01 https://scifaro.com/en/abs/polynomial-time-corresponds-to-solutions-of-polynomial-ordinary-differential-equations-of-polynomial-length-journal-version-1609.080592017-05-18 https://scifaro.com/en/abs/on-the-group-and-color-isomorphism-problems-1609.082532016-09-28 https://scifaro.com/en/abs/np-vs-pspace-1609.095622016-10-03 https://scifaro.com/en/abs/a-near-quadratic-lower-bound-for-the-size-of-quantum-circuits-of-constant-treewidth-1609.096432016-10-03 https://scifaro.com/en/abs/on-the-complexity-of-the-permanent-in-various-computational-models-1610.001592016-10-04 https://scifaro.com/en/abs/dynamic-complexity-of-parity-games-with-bounded-tree-width-1610.005712016-10-04 https://scifaro.com/en/abs/towards-a-characterization-of-constant-factor-approximable-finite-valued-csps-1610.010192018-03-22 https://scifaro.com/en/abs/targeted-pseudorandom-generators-simulation-advice-generators-and-derandomizing-logspace-1610.011992017-04-11 https://scifaro.com/en/abs/computing-majority-by-constant-depth-majority-circuits-with-low-fan-in-gates-1610.026862016-10-11 https://scifaro.com/en/abs/approximating-rectangles-by-juntas-and-weakly-exponential-lower-bounds-for-lp-relaxations-of-csps-1610.027042018-01-03 https://scifaro.com/en/abs/lower-bounds-for-csp-refutation-by-sdp-hierarchies-1610.030292016-10-11 https://scifaro.com/en/abs/on-the-optimality-of-tape-merge-of-two-lists-with-similar-size-1610.032662016-10-12 https://scifaro.com/en/abs/quantum-automata-cannot-detect-biased-coins-even-in-the-limit-1610.035432016-10-13 https://scifaro.com/en/abs/qcma-hardness-of-ground-space-connectivity-for-commuting-hamiltonians-1610.035822017-07-17 https://scifaro.com/en/abs/on-probabilistic-checking-in-perfect-zero-knowledge-1610.037982016-10-13 https://scifaro.com/en/abs/on-the-computational-complexity-of-read-once-resolution-decidability-in-2cnf-formulas-1610.045232016-10-17 https://scifaro.com/en/abs/a-complexity-theory-for-hard-enumeration-problems-1610.054932017-10-25 https://scifaro.com/en/abs/np-hard-sets-are-not-sparse-unless-p-np-an-exposition-of-a-simple-proof-of-mahaney-s-theorem-with-applications-1610.058252016-10-20 https://scifaro.com/en/abs/a-noisy-influence-regularity-lemma-for-boolean-functions-1610.069502016-10-25 https://scifaro.com/en/abs/the-security-of-hardware-based-omega-n-2-cryptographic-one-way-functions-beyond-satisfiability-and-p-np-1610.071902016-10-25 https://scifaro.com/en/abs/dynamic-complexity-of-the-dyck-reachability-1610.074992017-04-18 https://scifaro.com/en/abs/a-pumping-lemma-for-non-cooperative-self-assembly-1610.079082016-10-28 https://scifaro.com/en/abs/multiplayer-parallel-repetition-for-expander-games-1610.083492020-05-08 https://scifaro.com/en/abs/the-geometry-of-rank-decompositions-of-matrix-multiplication-i-2x2-matrices-1610.083642016-10-27 https://scifaro.com/en/abs/improved-lower-bounds-for-graph-embedding-problems-1610.091302016-10-31 https://scifaro.com/en/abs/towards-asymptotically-optimal-one-to-one-pdp-algorithms-for-capacity-2-vehicles-1610.091322016-10-31 https://scifaro.com/en/abs/gap-theorems-for-robust-satisfiability-boolean-csps-and-beyond-1610.095742017-03-28 https://scifaro.com/en/abs/matrix-semigroup-freeness-problems-in-mathrm-sl-2-mathbb-z-1610.098342016-11-01 https://scifaro.com/en/abs/preserving-randomness-for-adaptive-algorithms-1611.007832018-06-14 https://scifaro.com/en/abs/geometric-complexity-theory-and-matrix-powering-1611.008272017-07-27 https://scifaro.com/en/abs/all-or-nothing-toward-a-promise-problem-dichotomy-for-constraint-problems-1611.008862017-05-02 https://scifaro.com/en/abs/online-exploration-of-rectangular-grids-1611.009342016-11-04 https://scifaro.com/en/abs/the-complexity-of-holant-problems-over-boolean-domain-with-non-negative-weights-1611.009752017-02-21 https://scifaro.com/en/abs/on-the-sum-of-linear-coefficients-of-a-boolean-valued-function-1611.010292016-11-08 https://scifaro.com/en/abs/conspiracies-between-learning-algorithms-circuit-lower-bounds-and-pseudorandomness-1611.011902016-11-07 https://scifaro.com/en/abs/tighter-hard-instances-for-ppsz-1611.012912017-09-06 https://scifaro.com/en/abs/feasible-interpolation-for-qbf-resolution-calculi-1611.013282023-06-22 https://scifaro.com/en/abs/the-polytope-collision-problem-1611.013442016-11-07 https://scifaro.com/en/abs/self-reducible-with-easy-decision-version-counting-problems-admit-additive-error-approximation-connections-to-counting-complexity-exponential-time-complexity-and-circuit-lower-bounds-1611.017062016-11-08 https://scifaro.com/en/abs/parameterized-counting-of-trees-forests-and-matroid-bases-1611.018232016-11-14 https://scifaro.com/en/abs/diminishable-parameterized-problems-and-strict-polynomial-kernelization-1611.037392017-08-28 https://scifaro.com/en/abs/finite-bases-with-respect-to-the-superposition-in-classes-of-elementary-recursive-functions-dissertation-1611.048432016-11-22 https://scifaro.com/en/abs/hardness-of-covering-alignment-phase-transition-in-post-sequence-genomics-1611.050862018-05-23 https://scifaro.com/en/abs/probabilistic-rank-and-matrix-rigidity-1611.055582018-02-01 https://scifaro.com/en/abs/kolmogorov-complexity-and-generalized-length-functions-1611.058192019-06-14 https://scifaro.com/en/abs/almost-polynomial-ratio-eth-hardness-of-approximating-densest-k-subgraph-1611.059912017-04-11 https://scifaro.com/en/abs/on-embeddings-of-ell-1-k-from-locally-decodable-codes-1611.063852016-11-23 https://scifaro.com/en/abs/a-note-on-amortized-branching-program-complexity-1611.066322017-02-23 https://scifaro.com/en/abs/trading-information-complexity-for-error-1611.066502016-11-22 https://scifaro.com/en/abs/lower-bounds-for-2-query-lccs-over-large-alphabet-1611.069802017-05-02 https://scifaro.com/en/abs/identity-testing-for-regular-noncommutative-arithmetic-circuits-1611.072352016-11-23 https://scifaro.com/en/abs/knapsack-problems-a-parameterized-point-of-view-1611.077242016-11-24 https://scifaro.com/en/abs/detecting-communities-is-hard-and-counting-them-is-even-harder-1611.083262016-11-28 https://scifaro.com/en/abs/the-communication-complexity-of-the-inevitable-intersection-problem-1611.088422022-03-30 https://scifaro.com/en/abs/the-computational-complexity-of-portal-and-other-3d-video-games-1611.103192016-12-01 https://scifaro.com/en/abs/complexity-hierarchies-and-higher-order-cons-free-term-rewriting-1611.103342023-06-22 https://scifaro.com/en/abs/bounding-the-dimension-of-points-on-a-line-1612.001432017-04-07 https://scifaro.com/en/abs/the-weight-in-enumeration-1612.006752016-12-05 https://scifaro.com/en/abs/optimality-of-correlated-sampling-strategies-1612.010412020-11-24 https://scifaro.com/en/abs/the-limits-of-sdp-relaxations-for-general-valued-csps-1612.011472018-05-28 https://scifaro.com/en/abs/matrix-multiplication-algorithms-from-group-orbits-1612.015272016-12-13 https://scifaro.com/en/abs/fractal-intersections-and-products-via-algorithmic-dimension-1612.016592021-03-02 https://scifaro.com/en/abs/complexity-of-single-swap-heuristics-for-metric-facility-location-and-related-problem-1612.017522017-01-31 https://scifaro.com/en/abs/pseudodeterministic-constructions-in-subexponential-time-1612.018172016-12-07 https://scifaro.com/en/abs/the-time-complexity-of-permutation-routing-via-matching-token-swapping-and-a-variant-1612.029482017-09-13 https://scifaro.com/en/abs/robust-multiplication-based-tests-for-reed-muller-codes-1612.030862020-01-01 https://scifaro.com/en/abs/optimal-mean-based-algorithms-for-trace-reconstruction-1612.031482016-12-12 https://scifaro.com/en/abs/the-complexity-of-tensor-rank-1612.043382024-01-11 https://scifaro.com/en/abs/implementations-and-the-independent-set-polynomial-below-the-shearer-threshold-1612.058322022-10-25 https://scifaro.com/en/abs/a-note-on-pointwise-dimensions-1612.058492017-04-06 https://scifaro.com/en/abs/the-conjugacy-problem-in-free-solvable-groups-and-wreath-product-of-abelian-groups-is-in-tc-0-1612.059542017-09-12 https://scifaro.com/en/abs/on-the-hierarchies-for-deterministic-nondeterministic-and-probabilistic-ordered-read-k-times-branching-programs-1612.060922024-04-05 https://scifaro.com/en/abs/complexity-theory-for-spaces-of-integrable-functions-1612.064192019-03-14 https://scifaro.com/en/abs/nondeterministic-unitary-obdds-1612.070152016-12-22 https://scifaro.com/en/abs/supercritical-space-width-trade-offs-for-resolution-1612.071622016-12-22 https://scifaro.com/en/abs/cube-vs-cube-low-degree-test-1612.074912016-12-23 https://scifaro.com/en/abs/complexity-of-rainbow-vertex-connectivity-problems-for-restricted-graph-classes-1612.077682016-12-23 https://scifaro.com/en/abs/an-improved-homomorphism-preservation-theorem-from-lower-bounds-in-circuit-complexity-1612.081922016-12-28 https://scifaro.com/en/abs/the-probability-of-a-computable-output-from-a-random-oracle-1612.085372017-04-28 https://scifaro.com/en/abs/even-1-times-n-edge-matching-and-jigsaw-puzzles-are-really-hard-1701.001462017-01-03 https://scifaro.com/en/abs/closed-sets-and-operators-thereon-representations-computability-and-complexity-1701.002272023-06-22 https://scifaro.com/en/abs/understanding-the-complexity-of-sat-using-knowledge-compilation-1701.014612017-01-09 https://scifaro.com/en/abs/non-interactive-simulation-of-correlated-distributions-is-decidable-1701.014852017-02-17 https://scifaro.com/en/abs/towards-an-algebraic-natural-proofs-barrier-via-polynomial-identity-testing-1701.017172017-01-09 https://scifaro.com/en/abs/on-the-complexity-of-restoring-corrupted-colorings-1701.019392017-01-10 https://scifaro.com/en/abs/semialgebraic-invariant-synthesis-for-the-kannan-lipton-orbit-problem-1701.021622017-01-10 https://scifaro.com/en/abs/surjective-h-colouring-new-hardness-results-1701.021882017-03-28 https://scifaro.com/en/abs/on-rivest-vuillemin-conjecture-for-fourteen-variables-1701.023742017-01-11 https://scifaro.com/en/abs/a-linear-algebra-formulation-for-boolean-satisfiability-testing-1701.024012018-08-20 https://scifaro.com/en/abs/dichotomy-for-digraph-homomorphism-problems-1701.024092020-08-11 https://scifaro.com/en/abs/reachability-in-augmented-interval-markov-chains-1701.029962017-01-12 https://scifaro.com/en/abs/on-the-complexity-of-l-reachability-1701.032552017-01-13 https://scifaro.com/en/abs/dimension-spectra-of-lines-1701.041082017-01-17 https://scifaro.com/en/abs/some-results-on-circuit-lower-bounds-and-derandomization-of-arthur-merlin-problems-1701.044282017-01-18 https://scifaro.com/en/abs/sum-of-squares-lower-bounds-for-refuting-any-csp-1701.045212017-01-18 https://scifaro.com/en/abs/succinct-hitting-sets-and-barriers-to-proving-algebraic-circuits-lower-bounds-1701.053282018-07-24 https://scifaro.com/en/abs/the-power-of-non-determinism-in-higher-order-implicit-complexity-1701.053822017-01-31 https://scifaro.com/en/abs/on-polynomial-approximations-over-mathbb-z-2-k-mathbb-z-1701.062682020-05-08 https://scifaro.com/en/abs/a-structured-view-on-weighted-counting-with-relations-to-counting-quantum-computation-and-applications-1701.063862019-01-11 https://scifaro.com/en/abs/existence-of-evolutionarily-stable-strategies-remains-hard-to-decide-for-a-wide-range-of-payoff-values-1701.081082017-01-30 https://scifaro.com/en/abs/thin-circulant-matrices-and-lower-bounds-on-the-complexity-of-some-boolean-operators-1701.085572017-01-31 https://scifaro.com/en/abs/the-non-cooperative-tile-assembly-model-is-not-intrinsically-universal-or-capable-of-bounded-turing-machine-simulation-1702.003532017-05-31 https://scifaro.com/en/abs/the-computer-science-and-physics-of-community-detection-landscapes-phase-transitions-and-hardness-1702.004672017-08-25 https://scifaro.com/en/abs/complexity-results-for-k-domination-and-alpha-domination-problems-and-their-variants-1702.005332017-02-03 https://scifaro.com/en/abs/irreducibility-and-r-th-root-finding-over-finite-fields-1702.005582017-02-03 https://scifaro.com/en/abs/deciding-irreducibility-indecomposability-of-feedback-shift-registers-is-np-hard-1702.014232017-02-07 https://scifaro.com/en/abs/property-testing-of-joint-distributions-using-conditional-samples-1702.014542022-08-03 https://scifaro.com/en/abs/a-tight-i-o-lower-bound-for-matrix-multiplication-1702.020172019-02-07 https://scifaro.com/en/abs/dichotomy-for-real-holant-c-problems-1702.026932017-02-10 https://scifaro.com/en/abs/complexity-classification-of-the-six-vertex-model-1702.028632017-03-31 https://scifaro.com/en/abs/improved-inapproximability-results-for-steiner-tree-via-long-code-based-reductions-1702.028822017-02-21 https://scifaro.com/en/abs/sparse-approximation-is-provably-hard-under-coherent-dictionaries-1702.028852017-02-10 https://scifaro.com/en/abs/a-variation-of-levin-search-for-all-well-defined-problems-1702.031522017-02-13 https://scifaro.com/en/abs/separation-of-ac-0-oplus-formulas-and-circuits-1702.036252017-02-14 https://scifaro.com/en/abs/optimality-condition-and-complexity-analysis-for-linearly-constrained-optimization-without-differentiability-on-the-boundary-1702.043002017-02-15 https://scifaro.com/en/abs/parameterized-algorithms-for-recognizing-monopolar-and-2-subcolorable-graphs-1702.043222018-01-08 https://scifaro.com/en/abs/the-complexity-of-boolean-surjective-general-valued-csps-1702.046792020-05-15 https://scifaro.com/en/abs/an-improved-dictatorship-test-with-perfect-completeness-1702.047482017-02-17 https://scifaro.com/en/abs/compression-complexity-1702.047792017-02-17 https://scifaro.com/en/abs/on-the-bit-complexity-of-sum-of-squares-proofs-1702.051392017-02-20 https://scifaro.com/en/abs/courcelle-s-theorem-made-dynamic-1702.051832017-02-20 https://scifaro.com/en/abs/on-algebraic-branching-programs-of-small-width-1702.053282017-05-26 https://scifaro.com/en/abs/counting-edge-injective-homomorphisms-and-matchings-on-restricted-graph-classes-1702.054472018-01-22 https://scifaro.com/en/abs/a-fixed-parameter-perspective-on-bis-1702.055432019-07-16 https://scifaro.com/en/abs/nontrivial-turmites-are-turing-universal-1702.055472017-02-21 https://scifaro.com/en/abs/computational-complexity-of-atomic-chemical-reaction-networks-1702.057042017-10-03 https://scifaro.com/en/abs/cls-new-problems-and-completeness-1702.060172017-04-10 https://scifaro.com/en/abs/linear-time-tree-containment-in-phylogenetic-networks-1702.063642017-02-22 https://scifaro.com/en/abs/when-can-graph-hyperbolicity-be-computed-in-linear-time-1702.065032017-02-22 https://scifaro.com/en/abs/parameterized-shifted-combinatorial-optimization-1702.068442021-02-25 https://scifaro.com/en/abs/beyond-talagrand-functions-new-lower-bounds-for-testing-monotonicity-and-unateness-1702.069972017-08-22 https://scifaro.com/en/abs/the-facets-of-the-bases-polytope-of-a-matroid-and-two-consequences-1702.071282017-02-24 https://scifaro.com/en/abs/small-hitting-sets-for-tiny-arithmetic-circuits-or-how-to-turn-bad-designs-into-good-1702.071802017-02-24 https://scifaro.com/en/abs/a-converse-to-banach-s-fixed-point-theorem-and-its-cls-completeness-1702.073392018-02-15 https://scifaro.com/en/abs/complexity-classification-of-the-eight-vertex-model-1702.079382017-03-31 https://scifaro.com/en/abs/general-upper-bounds-for-gate-complexity-and-depth-of-reversible-circuits-consisting-of-not-cnot-and-2-cnot-gates-1702.080452017-03-28 https://scifaro.com/en/abs/consensus-patterns-parameterized-by-input-string-length-is-w-1-hard-1702.082382017-02-28 https://scifaro.com/en/abs/tree-tribes-and-lower-bounds-for-switching-lemmas-1703.000432017-03-02 https://scifaro.com/en/abs/reordering-method-and-hierarchies-for-quantum-and-classical-ordered-binary-decision-diagrams-1703.002422024-04-02 https://scifaro.com/en/abs/simplified-algorithmic-metatheorems-beyond-mso-treewidth-and-neighborhood-diversity-1703.005442026-01-06 https://scifaro.com/en/abs/on-the-fine-grained-complexity-of-one-dimensional-dynamic-programming-1703.009412017-03-06 https://scifaro.com/en/abs/why-is-it-hard-to-beat-o-n-2-for-longest-common-weakly-increasing-subsequence-1703.011432020-04-10 https://scifaro.com/en/abs/on-the-complexity-of-enumeration-1703.019282017-07-04 https://scifaro.com/en/abs/the-minimum-shared-edges-problem-on-grid-like-graphs-1703.023322017-06-08 https://scifaro.com/en/abs/on-the-family-of-0-1-polytopes-with-np-complete-non-adjacency-relation-1703.023612018-04-18 https://scifaro.com/en/abs/random-cnfs-are-hard-for-cutting-planes-1703.024692017-03-08 https://scifaro.com/en/abs/a-dichotomy-theorem-for-nonuniform-csps-1703.030212017-04-07 https://scifaro.com/en/abs/a-note-on-the-inapproximability-of-induced-disjoint-paths-1703.043002017-03-14 https://scifaro.com/en/abs/p-np-as-minimization-of-degree-4-polynomial-integration-or-grassmann-number-problem-and-new-graph-isomorphism-problem-approaches-1703.044562022-10-25 https://scifaro.com/en/abs/verification-in-staged-tile-self-assembly-1703.045982017-03-16 https://scifaro.com/en/abs/lower-bounds-and-hierarchies-for-quantum-memoryless-communication-protocols-and-quantum-ordered-binary-decision-diagrams-with-repeated-test-1703.050152017-10-05 https://scifaro.com/en/abs/busy-beavers-and-kolmogorov-complexity-1703.051702017-03-16 https://scifaro.com/en/abs/a-nearly-optimal-lower-bound-on-the-approximate-degree-of-ac-0-1703.057842017-03-20 https://scifaro.com/en/abs/the-hardness-of-embedding-grids-and-walls-1703.064232017-03-21 https://scifaro.com/en/abs/zero-error-affine-unitary-and-probabilistic-obdds-1703.071842017-05-10 https://scifaro.com/en/abs/lifting-randomized-query-complexity-to-randomized-communication-complexity-1703.075212018-01-23 https://scifaro.com/en/abs/a-counterexample-to-the-majority-is-least-stable-conjecture-1703.076572017-03-27 https://scifaro.com/en/abs/query-to-communication-lifting-for-bpp-1703.076662017-03-23 https://scifaro.com/en/abs/quantum-communication-query-tradeoffs-1703.077682017-09-07 https://scifaro.com/en/abs/information-complexity-of-the-and-function-in-the-two-party-and-multiparty-settings-1703.078332018-07-26 https://scifaro.com/en/abs/width-hierarchies-for-quantum-and-classical-ordered-binary-decision-diagrams-with-repeated-test-1703.078912017-03-24 https://scifaro.com/en/abs/optimal-lower-bounds-for-universal-relation-samplers-and-finding-duplicates-1703.081392017-03-24 https://scifaro.com/en/abs/approximately-certifying-the-restricted-isometry-property-is-hard-1704.004682018-07-04 https://scifaro.com/en/abs/optimal-lower-bounds-for-universal-relation-and-for-samplers-and-finding-duplicates-in-streams-1704.006332017-04-04 https://scifaro.com/en/abs/the-unbounded-error-communication-complexity-of-symmetric-xor-functions-1704.007772017-04-18 https://scifaro.com/en/abs/on-resource-bounded-versions-of-the-van-lambalgen-theorem-1704.011012019-11-07 https://scifaro.com/en/abs/polynomial-running-times-for-polynomial-time-oracle-machines-1704.014052017-06-02 https://scifaro.com/en/abs/new-planar-p-time-computable-six-vertex-models-and-a-complete-complexity-classification-1704.016572021-04-14 https://scifaro.com/en/abs/a-proof-of-the-csp-dichotomy-conjecture-1704.019142020-10-05 https://scifaro.com/en/abs/the-matching-problem-in-general-graphs-is-in-quasi-nc-1704.019292018-09-14 https://scifaro.com/en/abs/promise-constraint-satisfaction-algebraic-structure-and-a-symmetric-boolean-dichotomy-1704.019372021-05-07 https://scifaro.com/en/abs/a-zero-knowledge-sumcheck-and-its-applications-1704.020862017-04-10 https://scifaro.com/en/abs/on-the-first-order-complexity-of-induced-subgraph-isomorphism-1704.022372023-06-22 https://scifaro.com/en/abs/dual-polynomials-and-communication-complexity-of-textsf-xor-functions-1704.025372017-04-11 https://scifaro.com/en/abs/on-the-fine-grained-complexity-of-empirical-risk-minimization-kernel-methods-and-neural-networks-1704.029582017-04-11 https://scifaro.com/en/abs/on-the-spectral-properties-of-symmetric-functions-1704.031762017-04-12 https://scifaro.com/en/abs/on-the-quantitative-hardness-of-cvp-1704.039282019-01-28 https://scifaro.com/en/abs/fooling-intersections-of-low-weight-halfspaces-1704.048552017-04-18 https://scifaro.com/en/abs/does-robustness-imply-tractability-a-lower-bound-for-planted-clique-in-the-semi-random-model-1704.051202018-09-06 https://scifaro.com/en/abs/computability-in-the-lattice-of-equivalence-relations-1704.055872017-04-20 https://scifaro.com/en/abs/a-technical-report-on-pls-completeness-of-single-swap-for-unweighted-metric-facility-location-and-k-means-1704.056412017-04-20 https://scifaro.com/en/abs/the-complexity-of-tree-partitioning-1704.058962017-04-21 https://scifaro.com/en/abs/subspace-designs-based-on-algebraic-function-fields-1704.059922017-04-21 https://scifaro.com/en/abs/boolean-quadric-polytopes-are-faces-of-linear-ordering-polytopes-1704.061702018-04-18 https://scifaro.com/en/abs/on-singleton-arc-consistency-for-csps-defined-by-monotone-patterns-1704.062152019-06-28 https://scifaro.com/en/abs/on-monotone-circuits-with-local-oracles-and-clique-lower-bounds-1704.062412019-12-17 https://scifaro.com/en/abs/settling-the-query-complexity-of-non-adaptive-junta-testing-1704.063142017-04-24 https://scifaro.com/en/abs/exploring-the-bounds-on-the-positive-semidefinite-rank-1704.065072017-04-24 https://scifaro.com/en/abs/simulation-theorems-via-pseudorandom-properties-1704.068072017-04-25 https://scifaro.com/en/abs/the-parameterized-complexity-of-positional-games-1704.085362017-04-28 https://scifaro.com/en/abs/a-universal-tree-balancing-theorem-1704.087052017-10-18 https://scifaro.com/en/abs/the-computational-complexity-of-the-initial-value-problem-for-the-three-body-problem-1704.087622017-09-12 https://scifaro.com/en/abs/structural-parameters-tight-bounds-and-approximation-for-k-r-center-1704.088682018-11-14 https://scifaro.com/en/abs/a-lower-bound-on-cnf-encodings-of-the-at-most-one-constraint-1704.089342021-11-16 https://scifaro.com/en/abs/efficient-identity-testing-and-polynomial-factorization-over-non-associative-free-rings-1705.001402017-07-07 https://scifaro.com/en/abs/clifford-gates-in-the-holant-framework-1705.009422017-05-03 https://scifaro.com/en/abs/the-lov-asz-theta-function-for-random-regular-graphs-and-community-detection-in-the-hard-regime-1705.011942017-08-29 https://scifaro.com/en/abs/sustaining-moore-s-law-through-inexactness-1705.014972017-05-23 https://scifaro.com/en/abs/uncountable-realtime-probabilistic-classes-1705.017732017-05-05 https://scifaro.com/en/abs/towards-a-physical-oracle-for-the-partition-problem-using-analogue-computing-1705.018262017-05-05 https://scifaro.com/en/abs/weights-at-the-bottom-matter-when-the-top-is-heavy-1705.023972017-05-09 https://scifaro.com/en/abs/hardness-results-for-structured-linear-systems-1705.029442017-09-26 https://scifaro.com/en/abs/linear-projections-of-the-vandermonde-polynomial-1705.031882017-05-10 https://scifaro.com/en/abs/a-note-on-the-power-of-non-deterministic-circuits-with-gate-restrictions-1705.032632017-05-19 https://scifaro.com/en/abs/an-exponential-lower-bound-for-individualization-refinement-algorithms-for-graph-isomorphism-1705.032832017-05-10 https://scifaro.com/en/abs/inapproximability-of-maximum-biclique-problems-minimum-k-cut-and-densest-at-least-k-subgraph-from-the-small-set-expansion-hypothesis-1705.035812017-05-11 https://scifaro.com/en/abs/a-duality-between-depth-three-formulas-and-approximation-by-depth-two-1705.035882017-05-11 https://scifaro.com/en/abs/the-complexity-of-routing-with-few-collisions-1705.036732017-05-11 https://scifaro.com/en/abs/explicit-polynomial-sequences-with-maximal-spaces-of-partial-derivatives-and-a-question-of-k-mulmuley-1705.038662019-09-24 https://scifaro.com/en/abs/flipping-out-with-many-flips-hardness-of-testing-k-monotonicity-1705.042052018-06-05 https://scifaro.com/en/abs/complexity-and-inapproximability-results-for-parallel-task-scheduling-and-strip-packing-1705.045872017-05-15 https://scifaro.com/en/abs/polynomial-time-estimates-for-sat-1705.054522017-05-17 https://scifaro.com/en/abs/the-parameterized-complexity-of-the-equidomination-problem-1705.055992017-12-14 https://scifaro.com/en/abs/being-even-slightly-shallow-makes-life-hard-1705.067962017-05-22 https://scifaro.com/en/abs/quantum-versus-classical-simultaneity-in-communication-complexity-1705.072112022-04-05 https://scifaro.com/en/abs/lower-bound-on-the-computational-complexity-of-discounted-markov-decision-problems-1705.073122017-05-24 https://scifaro.com/en/abs/inapproximability-of-vc-dimension-and-littlestone-s-dimension-1705.095172017-05-29 https://scifaro.com/en/abs/the-border-support-rank-of-two-by-two-matrix-multiplication-is-seven-1705.096522018-09-26 https://scifaro.com/en/abs/a-block-sensitivity-lower-bound-for-quantum-testing-hamming-distance-1705.097102017-05-30 https://scifaro.com/en/abs/affine-maps-between-quadratic-assignment-polytopes-and-subgraph-isomorphism-polytopes-1705.100812017-06-20 https://scifaro.com/en/abs/a-lower-bound-for-nonadaptive-one-sided-error-testing-of-unateness-of-boolean-functions-over-the-hypercube-1706.000532017-06-02 https://scifaro.com/en/abs/low-rank-matrix-approximation-in-the-infinity-norm-1706.000782019-08-06 https://scifaro.com/en/abs/a-composition-theorem-for-randomized-query-complexity-1706.003352017-06-15 https://scifaro.com/en/abs/bounds-and-approximation-results-for-scheduling-coupled-tasks-with-compatibility-constraints-1706.022002017-06-08 https://scifaro.com/en/abs/on-the-communication-complexity-of-high-dimensional-permutations-1706.022072018-11-28 https://scifaro.com/en/abs/some-complexity-and-approximation-results-for-coupled-tasks-scheduling-problem-according-to-topology-1706.022142017-06-08 https://scifaro.com/en/abs/a-note-on-multiparty-communication-complexity-and-the-hales-jewett-theorem-1706.022772018-07-03 https://scifaro.com/en/abs/constraint-satisfaction-problem-dichotomy-for-finite-templates-a-proof-via-consistency-checks-1706.034512017-12-12 https://scifaro.com/en/abs/inner-rank-and-lower-bounds-for-matrix-multiplication-1706.042252019-05-15 https://scifaro.com/en/abs/pseudo-deterministic-proofs-1706.046412017-06-16 https://scifaro.com/en/abs/adaptivity-is-exponentially-powerful-for-testing-monotonicity-of-halfspaces-1706.055562017-06-20 https://scifaro.com/en/abs/time-complexity-of-constraint-satisfaction-via-universal-algebra-1706.059022017-06-20 https://scifaro.com/en/abs/kernelization-of-constraint-satisfaction-problems-a-study-through-universal-algebra-1706.059412017-06-20 https://scifaro.com/en/abs/distributed-pcp-theorems-for-hardness-of-approximation-in-p-1706.064072017-11-02 https://scifaro.com/en/abs/approximating-the-volume-of-tropical-polytopes-is-difficult-1706.064672019-12-30 https://scifaro.com/en/abs/solving-the-rubik-s-cube-optimally-is-np-complete-1706.067082018-04-30 https://scifaro.com/en/abs/the-augmentation-property-of-binary-matrices-for-the-binary-and-boolean-rank-1706.069002017-06-22 https://scifaro.com/en/abs/on-the-complexity-and-approximation-of-the-maximum-expected-value-all-or-nothing-subset-1706.074062017-06-23 https://scifaro.com/en/abs/a-note-on-a-communication-game-1706.078902017-06-27 https://scifaro.com/en/abs/tree-residue-vertex-breaking-a-new-tool-for-proving-hardness-1706.079002018-05-04 https://scifaro.com/en/abs/counting-restricted-homomorphisms-via-m-obius-inversion-over-matroid-lattices-1706.084142017-06-27 https://scifaro.com/en/abs/distributed-compression-through-the-lens-of-algorithmic-information-theory-a-primer-1706.084682017-06-27 https://scifaro.com/en/abs/the-complexity-of-counting-surjective-homomorphisms-and-compactions-1706.087862019-06-28 https://scifaro.com/en/abs/critical-vertices-and-edges-in-h-free-graphs-1706.090432017-06-29 https://scifaro.com/en/abs/tight-euler-tours-in-uniform-hypergraphs-computational-aspects-1706.093562023-06-22 https://scifaro.com/en/abs/sample-based-high-dimensional-convexity-testing-1706.093622017-06-29 https://scifaro.com/en/abs/relativization-and-interactive-proof-systems-in-parameterized-complexity-theory-1706.093912018-07-18 https://scifaro.com/en/abs/token-jumping-in-minor-closed-classes-1706.096082017-06-30 https://scifaro.com/en/abs/on-the-relation-between-representations-and-computability-1706.096962017-06-30 https://scifaro.com/en/abs/on-sampling-edges-almost-uniformly-1706.097482017-06-30 https://scifaro.com/en/abs/mathcal-p-schemes-and-deterministic-polynomial-factoring-over-finite-fields-1706.100282017-09-26 https://scifaro.com/en/abs/hamiltonicity-is-hard-in-thin-or-polygonal-grid-graphs-but-easy-in-thin-polygonal-grid-graphs-1706.100462017-07-03 https://scifaro.com/en/abs/on-the-complexity-of-polytopes-in-li-2-1706.101142017-07-03 https://scifaro.com/en/abs/parameterized-complexity-of-csp-for-infinite-constraint-languages-1706.101532017-08-10 https://scifaro.com/en/abs/a-criterion-for-easiness-of-certain-sat-problems-1707.001182017-07-04 https://scifaro.com/en/abs/on-blockwise-symmetric-matchgate-signatures-and-higher-domain-csp-1707.003732017-07-04 https://scifaro.com/en/abs/when-the-optimum-is-also-blind-a-new-perspective-on-universal-optimization-1707.017022017-07-07 https://scifaro.com/en/abs/hardness-of-learning-noisy-halfspaces-using-polynomial-thresholds-1707.017952017-07-07 https://scifaro.com/en/abs/the-complexity-of-independent-set-reconfiguration-on-bipartite-graphs-1707.026382017-07-11 https://scifaro.com/en/abs/a-simple-proof-that-the-n-2-1-puzzle-is-hard-1707.031462018-04-30 https://scifaro.com/en/abs/fast-exact-algorithms-for-some-connectivity-problems-parametrized-by-clique-width-1707.035842018-08-21 https://scifaro.com/en/abs/defensive-alliances-in-graphs-of-bounded-treewidth-1707.042512017-07-17 https://scifaro.com/en/abs/how-hard-is-it-to-satisfy-almost-all-roommates-1707.043162018-02-21 https://scifaro.com/en/abs/a-note-on-unconditional-subexponential-time-pseudo-deterministic-algorithms-for-bpp-search-problems-1707.058082017-07-20 https://scifaro.com/en/abs/inapproximability-of-the-standard-pebble-game-and-hard-to-pebble-graphs-1707.063432018-07-16 https://scifaro.com/en/abs/a-non-commutative-algorithm-for-multiplying-5x5-matrices-using-99-multiplications-1707.068602017-12-21 https://scifaro.com/en/abs/resource-efficient-common-randomness-and-secret-key-schemes-1707.080862017-07-26 https://scifaro.com/en/abs/composition-problems-for-braids-membership-identity-and-freeness-1707.083892017-07-27 https://scifaro.com/en/abs/refuting-feder-kinne-and-rafiey-1707.094402017-08-01 https://scifaro.com/en/abs/quadratically-tight-relations-for-randomized-query-complexity-1708.008222017-08-03 https://scifaro.com/en/abs/optimal-rate-list-decoding-over-bounded-alphabets-using-algebraic-geometric-codes-1708.010702020-11-17 https://scifaro.com/en/abs/matrix-rigidity-and-the-croot-lev-pach-lemma-1708.016462017-08-08 https://scifaro.com/en/abs/unbalancing-sets-and-an-almost-quadratic-lower-bound-for-syntactically-multilinear-arithmetic-circuits-1708.020372017-11-03 https://scifaro.com/en/abs/pseudorandom-bits-for-oblivious-branching-programs-1708.020542017-08-08 https://scifaro.com/en/abs/a-simple-way-to-reduce-factorization-problems-to-sat-1708.028442020-04-29 https://scifaro.com/en/abs/on-the-approximation-method-and-the-p-versus-np-problem-1708.034862020-06-16 https://scifaro.com/en/abs/lower-bound-for-monotone-boolean-convolution-1708.035232020-01-22 https://scifaro.com/en/abs/the-generalized-vertex-cover-problem-and-some-variations-1708.037032017-08-15 https://scifaro.com/en/abs/dimension-reduction-for-polynomials-over-gaussian-space-and-applications-1708.038082017-08-15 https://scifaro.com/en/abs/from-gap-eth-to-fpt-inapproximability-clique-dominating-set-and-more-1708.042182017-08-15 https://scifaro.com/en/abs/derandomization-beyond-connectivity-undirected-laplacian-systems-in-nearly-logarithmic-space-1708.046342017-08-17 https://scifaro.com/en/abs/a-stronger-foundation-for-computer-science-and-p-np-1708.057142018-04-24 https://scifaro.com/en/abs/boolean-unateness-testing-with-widetilde-o-n-3-4-adaptive-queries-1708.057862017-08-22 https://scifaro.com/en/abs/scale-free-random-sat-instances-1708.068052023-03-14 https://scifaro.com/en/abs/plain-stopping-time-and-conditional-complexities-revisited-1708.081002017-10-04 https://scifaro.com/en/abs/on-the-induced-problem-for-fixed-template-csps-1708.082922023-11-21 https://scifaro.com/en/abs/identity-testing-and-interpolation-from-high-powers-of-polynomials-of-large-degree-over-finite-fields-1708.090952018-03-02 https://scifaro.com/en/abs/complexity-of-domination-in-triangulated-plane-graphs-1709.005962017-09-05 https://scifaro.com/en/abs/reductions-for-frequency-based-data-mining-problems-1709.009002017-09-05 https://scifaro.com/en/abs/push-pull-block-puzzles-are-hard-1709.012412017-09-06 https://scifaro.com/en/abs/string-matching-communication-circuits-and-learning-1709.020342019-02-21 https://scifaro.com/en/abs/structurally-parameterized-d-scattered-set-1709.021802018-11-13 https://scifaro.com/en/abs/complete-classification-of-generalized-santha-vazirani-sources-1709.030532017-09-12 https://scifaro.com/en/abs/quasi-polynomial-hitting-sets-for-circuits-with-restricted-parse-trees-1709.030682017-10-27 https://scifaro.com/en/abs/a-note-on-property-testing-sum-of-squares-and-multivariate-polynomial-interpolation-1709.031982017-09-12 https://scifaro.com/en/abs/lower-bounds-for-approximating-graph-parameters-via-communication-complexity-1709.042622018-01-26 https://scifaro.com/en/abs/the-orthogonal-vectors-conjecture-for-branching-programs-and-formulas-1709.052942017-09-18 https://scifaro.com/en/abs/local-decoding-and-testing-of-polynomials-over-grids-1709.060362018-12-17 https://scifaro.com/en/abs/on-the-complexity-of-robust-stable-marriage-1709.061722022-04-08 https://scifaro.com/en/abs/complexity-of-finding-perfect-bipartite-matchings-minimizing-the-number-of-intersecting-edges-1709.068052017-12-27 https://scifaro.com/en/abs/complexity-of-scheduling-charging-in-the-smart-grid-1709.074802024-03-14 https://scifaro.com/en/abs/quantified-derandomization-of-linear-threshold-circuits-1709.076352017-11-07 https://scifaro.com/en/abs/quantum-online-algorithms-with-respect-to-space-complexity-1709.084092017-09-26 https://scifaro.com/en/abs/partial-matching-width-and-its-application-to-lower-bounds-for-branching-programs-1709.088902017-09-28 https://scifaro.com/en/abs/all-classical-adversary-methods-are-equivalent-for-total-functions-1709.089852018-11-13 https://scifaro.com/en/abs/surjective-h-colouring-over-reflexive-digraphs-1709.094862017-12-29 https://scifaro.com/en/abs/finding-small-weight-isomorphisms-with-additional-constraints-is-fixed-parameter-tractable-1709.100632017-09-29 https://scifaro.com/en/abs/tight-conditional-lower-bounds-for-longest-common-increasing-subsequence-1709.100752020-04-10 https://scifaro.com/en/abs/an-improved-algorithm-for-recognizing-matroids-1709.102582019-06-20 https://scifaro.com/en/abs/the-2cnf-boolean-formula-satisfiability-problem-and-the-linear-space-hypothesis-1709.104532024-04-16 https://scifaro.com/en/abs/homomorphisms-are-indeed-a-good-basis-for-counting-three-fixed-template-dichotomy-theorems-for-the-price-of-one-1710.002342017-10-03 https://scifaro.com/en/abs/sum-of-square-proof-for-brascamp-lieb-type-inequality-1710.014582017-10-09 https://scifaro.com/en/abs/note-on-the-complexity-of-counting-surjective-homomorphisms-and-compactions-1710.017122017-10-05 https://scifaro.com/en/abs/some-facts-on-permanents-in-finite-characteristics-1710.017832020-11-04 https://scifaro.com/en/abs/model-theoretic-characterizations-of-boolean-and-arithmetic-circuit-classes-of-small-depth-1710.019342017-10-09 https://scifaro.com/en/abs/simultaneous-multiparty-communication-complexity-of-composed-functions-1710.019692018-09-19 https://scifaro.com/en/abs/the-space-complexity-of-mirror-games-1710.028982017-10-10 https://scifaro.com/en/abs/the-complexity-of-general-valued-csps-seen-from-the-other-side-1710.031482022-02-02 https://scifaro.com/en/abs/discovering-the-roots-uniform-closure-results-for-algebraic-classes-under-factoring-1710.032142017-10-10 https://scifaro.com/en/abs/stabbing-planes-1710.032192023-03-20 https://scifaro.com/en/abs/representations-and-evaluation-strategies-for-feasibly-approximable-functions-1710.037022019-10-23 https://scifaro.com/en/abs/on-the-containment-problem-for-linear-sets-1710.045332018-02-21 https://scifaro.com/en/abs/hard-and-easy-instances-of-l-tromino-tilings-1710.046402020-03-25 https://scifaro.com/en/abs/compact-formulae-in-sparse-elimination-1710.048562017-10-16 https://scifaro.com/en/abs/netrunner-mate-in-1-or-2-is-weakly-np-hard-1710.051212017-10-17 https://scifaro.com/en/abs/on-complexity-of-mutlidistance-graph-recognition-in-mathbb-r-1-1710.051402017-10-17 https://scifaro.com/en/abs/small-depth-multilinear-formula-lower-bounds-for-iterated-matrix-multiplication-with-applications-1710.054812017-10-17 https://scifaro.com/en/abs/planar-3-sat-with-a-clause-variable-cycle-1710.074762023-06-22 https://scifaro.com/en/abs/the-maximum-colorful-arborescence-problem-parameterized-by-the-structure-of-its-color-hierarchy-graph-1710.075842018-03-01 https://scifaro.com/en/abs/kernelization-lower-bounds-for-finding-constant-size-subgraphs-1710.076012018-10-23 https://scifaro.com/en/abs/conjugacy-of-one-dimensional-one-sided-cellular-automata-is-undecidable-1710.081112017-10-24 https://scifaro.com/en/abs/satisfiability-in-multi-valued-circuits-1710.081632017-10-24 https://scifaro.com/en/abs/on-the-polynomial-parity-argument-complexity-of-the-combinatorial-nullstellensatz-1710.086022017-11-15 https://scifaro.com/en/abs/nondeterministic-communication-complexity-with-help-and-graph-functions-1710.091432017-10-26 https://scifaro.com/en/abs/barriers-for-rank-methods-in-arithmetic-complexity-1710.095022017-10-27 https://scifaro.com/en/abs/quantum-versus-classical-online-streaming-algorithms-with-logarithmic-size-of-memory-1710.095952019-06-21 https://scifaro.com/en/abs/interactions-of-computational-complexity-theory-and-mathematics-1710.097802017-10-27 https://scifaro.com/en/abs/minimum-circuit-size-graph-isomorphism-and-related-problems-1710.098062017-10-27 https://scifaro.com/en/abs/on-the-list-decodability-of-random-linear-rank-metric-codes-1710.115162017-11-01 https://scifaro.com/en/abs/credimus-1711.002012019-06-04 https://scifaro.com/en/abs/inapproximability-of-the-independent-set-polynomial-in-the-complex-plane-1711.002822026-02-04 https://scifaro.com/en/abs/typically-correct-derandomization-for-small-time-and-space-1711.005652019-05-17 https://scifaro.com/en/abs/improved-lower-bounds-for-the-fourier-entropy-influence-conjecture-via-lexicographic-functions-1711.007622017-11-03 https://scifaro.com/en/abs/the-robustness-of-lwpp-and-wpp-with-an-application-to-graph-reconstruction-1711.012502018-07-09 https://scifaro.com/en/abs/on-the-complexity-of-hazard-free-circuits-1711.019042021-01-01 https://scifaro.com/en/abs/projection-theorems-using-effective-dimension-1711.021242021-11-15 https://scifaro.com/en/abs/lower-bounds-over-boolean-inputs-for-deep-neural-networks-with-relu-gates-1711.030732017-11-10 https://scifaro.com/en/abs/completely-inapproximable-monotone-and-antimonotone-parameterized-problems-1711.038862017-11-13 https://scifaro.com/en/abs/a-superpolynomial-lower-bound-for-the-size-of-non-deterministic-complement-of-an-unambiguous-automaton-1711.039932018-02-15 https://scifaro.com/en/abs/a-refutation-of-guinea-s-understanding-sat-is-in-p-1711.044122017-11-15 https://scifaro.com/en/abs/grothendieck-constant-is-norm-of-strassen-matrix-multiplication-tensor-1711.044272018-06-07 https://scifaro.com/en/abs/consensus-halving-is-ppa-complete-1711.045032017-11-15 https://scifaro.com/en/abs/a-note-on-the-complexity-of-feedback-vertex-set-parameterized-by-mim-width-1711.051572017-11-15 https://scifaro.com/en/abs/critique-of-barbosa-s-p-np-proof-1711.071322017-11-21 https://scifaro.com/en/abs/proof-complexity-meets-algebra-1711.073202018-09-26 https://scifaro.com/en/abs/xsat-of-linear-cnf-formulas-1711.074742018-01-19 https://scifaro.com/en/abs/alternating-minimization-scaling-algorithms-and-the-null-cone-problem-from-invariant-theory-1711.080392020-03-10 https://scifaro.com/en/abs/on-optimal-trees-for-irregular-gather-and-scatter-collectives-1711.087312018-11-28 https://scifaro.com/en/abs/relating-counting-complexity-to-non-uniform-probability-measures-1711.088522017-11-27 https://scifaro.com/en/abs/on-the-parallel-parameterized-complexity-of-the-graph-isomorphism-problem-1711.088852017-12-04 https://scifaro.com/en/abs/agreement-tests-on-graphs-and-hypergraphs-1711.094262020-12-14 https://scifaro.com/en/abs/sparse-juntas-on-the-biased-hypercube-1711.094282024-08-07 https://scifaro.com/en/abs/lower-bounds-for-approximating-the-matching-polytope-1711.101452017-11-29 https://scifaro.com/en/abs/computing-majority-with-low-fan-in-majority-queries-1711.101762017-11-29 https://scifaro.com/en/abs/sampling-markov-models-under-constraints-complexity-results-for-binary-equalities-and-grammar-membership-1711.104362017-11-29 https://scifaro.com/en/abs/parametrised-second-order-complexity-theory-with-applications-to-the-study-of-interval-computation-1711.105302019-06-13 https://scifaro.com/en/abs/inner-product-and-set-disjointness-beyond-logarithmically-many-parties-1711.106612017-11-30 https://scifaro.com/en/abs/on-the-parameterized-complexity-of-approximating-dominating-set-1711.110292018-04-13 https://scifaro.com/en/abs/a-note-on-time-hierarchies-for-reasonable-semantic-classes-without-advice-1711.111582022-08-17 https://scifaro.com/en/abs/sum-of-squares-lower-bounds-from-symmetry-and-a-good-story-1711.114692018-12-17 https://scifaro.com/en/abs/gap-s-eth-hardness-of-svp-1712.009422019-01-23 https://scifaro.com/en/abs/an-upper-bound-on-the-gks-game-via-max-bipartite-matching-1712.011492017-12-05 https://scifaro.com/en/abs/principle-of-conservation-of-computational-complexity-1712.011782018-01-08 https://scifaro.com/en/abs/time-space-tradeoffs-for-the-memory-game-1712.013302018-01-29 https://scifaro.com/en/abs/exact-algorithms-with-worst-case-guarantee-for-scheduling-from-theory-to-practice-1712.021032017-12-07 https://scifaro.com/en/abs/on-colouring-2p-2-h-free-and-p-5-h-free-graphs-1712.024472017-12-08 https://scifaro.com/en/abs/efficient-enumeration-of-solutions-produced-by-closure-operations-1712.037142023-06-22 https://scifaro.com/en/abs/computational-properties-of-slime-trail-1712.044962017-12-14 https://scifaro.com/en/abs/fractal-dimension-and-lower-bounds-for-geometric-problems-1712.045952017-12-14 https://scifaro.com/en/abs/alternation-sparsity-and-sensitivity-bounds-and-exponential-gaps-1712.057352019-02-12 https://scifaro.com/en/abs/on-w-1-hardness-as-evidence-for-intractability-1712.057662018-07-20 https://scifaro.com/en/abs/approximability-of-the-six-vertex-model-1712.058802017-12-19 https://scifaro.com/en/abs/further-limitations-of-the-known-approaches-for-matrix-multiplication-1712.072462017-12-21 https://scifaro.com/en/abs/uniform-diagonalization-theorem-for-complexity-classes-of-promise-problems-including-randomized-and-quantum-classes-1712.072762019-02-22 https://scifaro.com/en/abs/notes-on-complexity-of-packing-coloring-1712.083732018-05-23 https://scifaro.com/en/abs/on-tractable-query-evaluation-for-sparql-1712.089392017-12-27 https://scifaro.com/en/abs/finding-two-disjoint-simple-paths-on-two-sets-of-points-is-np-complete-1712.096192017-12-29 https://scifaro.com/en/abs/tensor-network-complexity-of-multilinear-maps-1712.096302018-11-16 https://scifaro.com/en/abs/on-low-for-speed-oracles-1712.097102017-12-29 https://scifaro.com/en/abs/on-the-decision-tree-complexity-of-string-matching-1712.097382018-06-29 https://scifaro.com/en/abs/a-pspace-construction-of-a-hitting-set-for-the-closure-of-small-algebraic-circuits-1712.099672017-12-29 https://scifaro.com/en/abs/computing-hitting-set-kernels-by-ac-0-circuits-1801.007162018-01-03 https://scifaro.com/en/abs/complexity-theory-game-theory-and-economics-the-barbados-lectures-1801.007342020-02-11 https://scifaro.com/en/abs/the-geometry-of-rank-decompositions-of-matrix-multiplication-ii-3-times-3-matrices-1801.008432018-01-04 https://scifaro.com/en/abs/circuit-complexity-of-bounded-planar-cutwidth-graph-matching-1801.009062018-01-04 https://scifaro.com/en/abs/computational-complexity-lower-bounds-of-certain-discrete-radon-transform-approximations-1801.010542018-01-04 https://scifaro.com/en/abs/on-randomized-counting-versus-randomised-decision-1801.019012018-01-09 https://scifaro.com/en/abs/on-the-randomised-query-complexity-of-composition-1801.022262022-04-05 https://scifaro.com/en/abs/an-entropy-lower-bound-for-non-malleable-extractors-1801.032002018-01-11 https://scifaro.com/en/abs/a-composition-theorem-via-conflict-complexity-1801.032852018-01-11 https://scifaro.com/en/abs/deterministic-search-for-cnf-satisfying-assignments-in-almost-polynomial-time-1801.035882018-01-12 https://scifaro.com/en/abs/improved-pseudorandom-generators-from-pseudorandom-multi-switching-lemmas-1801.035902018-01-12 https://scifaro.com/en/abs/near-optimal-approximation-algorithm-for-simultaneous-max-cut-1801.044972018-01-16 https://scifaro.com/en/abs/algorithmic-polynomials-1801.046072018-01-16 https://scifaro.com/en/abs/one-way-function-candidate-based-on-the-collatz-problem-1801.050792018-07-27 https://scifaro.com/en/abs/lower-bounds-for-combinatorial-algorithms-for-boolean-matrix-multiplication-1801.052022018-01-17 https://scifaro.com/en/abs/nonuniform-reductions-and-np-completeness-1801.058822018-01-19 https://scifaro.com/en/abs/nondeterminisic-sublinear-time-has-measure-0-in-p-1801.058842018-01-19 https://scifaro.com/en/abs/a-high-performance-analog-max-sat-solver-and-its-application-to-ramsey-numbers-1801.066202018-01-30 https://scifaro.com/en/abs/invitation-to-real-complexity-theory-algorithmic-foundations-to-reliable-numerics-with-bit-costs-1801.071082018-01-23 https://scifaro.com/en/abs/polynomial-time-random-oracles-and-separating-complexity-classes-1801.073172018-01-24 https://scifaro.com/en/abs/type-two-polynomial-time-and-restricted-lookahead-1801.074852020-10-30 https://scifaro.com/en/abs/adaptive-lower-bound-for-testing-monotonicity-on-the-line-1801.087092018-05-11 https://scifaro.com/en/abs/oracle-separations-for-quantum-statistical-zero-knowledge-1801.089672018-01-30 https://scifaro.com/en/abs/algebraic-dependencies-and-pspace-algorithms-in-approximative-complexity-1801.092752018-01-30 https://scifaro.com/en/abs/indistinguishable-binomial-decision-tree-of-3-sat-proof-of-class-p-is-a-proper-subset-of-class-np-1801.096732018-01-31 https://scifaro.com/en/abs/a-linear-complementarity-theorem-to-solve-any-satisfiability-problem-in-conjunctive-normal-form-in-polynomial-time-1801.099872018-01-31 https://scifaro.com/en/abs/on-the-complexity-of-the-cayley-semigroup-membership-problem-1802.006592018-04-17 https://scifaro.com/en/abs/optimal-data-reduction-for-graph-coloring-using-low-degree-polynomials-1802.020502018-02-07 https://scifaro.com/en/abs/tight-bounds-on-the-asymptotic-descriptive-complexity-of-subgraph-isomorphism-1802.021432018-02-08 https://scifaro.com/en/abs/on-the-hardness-of-approximate-and-exact-bichromatic-maximum-inner-product-1802.023252018-03-07 https://scifaro.com/en/abs/a-schematic-definition-of-quantum-polynomial-time-computability-1802.023362024-04-17 https://scifaro.com/en/abs/on-synthesis-of-reversible-circuits-with-small-number-of-additional-inputs-consisting-of-not-cnot-and-2-cnot-gates-1802.023462018-02-08 https://scifaro.com/en/abs/privacy-preserving-clustering-with-constraints-1802.024972018-02-19 https://scifaro.com/en/abs/the-multiphoton-boson-sampling-machine-doesn-t-beat-early-classical-computers-for-five-boson-sampling-1802.027792019-01-08 https://scifaro.com/en/abs/a-complexity-theory-for-labeling-schemes-1802.028192018-02-09 https://scifaro.com/en/abs/there-is-a-hyper-greedoid-lurking-behind-every-graphical-accessible-computational-search-problem-solvable-in-polynomial-time-p-not-np-1802.030282025-02-11 https://scifaro.com/en/abs/a-universal-algebraic-proof-of-the-complexity-dichotomy-for-monotone-monadic-snp-1802.032552020-11-26 https://scifaro.com/en/abs/recognizing-read-once-functions-from-depth-three-formulas-1802.038152018-07-10 https://scifaro.com/en/abs/from-expanders-to-hitting-distributions-and-simulation-theorems-1802.040142018-07-09 https://scifaro.com/en/abs/hardness-results-and-approximation-algorithms-for-the-minimum-dominating-tree-problem-1802.044982018-02-14 https://scifaro.com/en/abs/on-the-relative-succinctness-of-sentential-decision-diagrams-1802.045442018-02-14 https://scifaro.com/en/abs/distribution-free-junta-testing-1802.048592018-02-15 https://scifaro.com/en/abs/on-the-p-vs-np-question-a-proof-of-inequality-1802.054842018-02-16 https://scifaro.com/en/abs/assigning-times-to-minimise-reachability-in-temporal-graphs-1802.059052022-12-22 https://scifaro.com/en/abs/counting-homomorphisms-to-trees-modulo-a-prime-1802.061032018-04-24 https://scifaro.com/en/abs/a-4-approximation-algorithm-for-k-prize-collecting-steiner-tree-problems-1802.065642018-02-20 https://scifaro.com/en/abs/ensemble-computation-approach-to-the-hough-transform-1802.066192018-02-20 https://scifaro.com/en/abs/the-complexity-of-drawing-a-graph-in-a-polygonal-region-1802.066992018-09-07 https://scifaro.com/en/abs/temporal-vertex-cover-with-a-sliding-time-window-1802.071032019-08-13 https://scifaro.com/en/abs/inapproximability-of-matrix-p-rightarrow-q-norms-1802.074252018-08-10 https://scifaro.com/en/abs/non-malleable-codes-for-small-depth-circuits-1802.076732018-02-22 https://scifaro.com/en/abs/arrival-next-stop-in-cls-1802.077022018-02-22 https://scifaro.com/en/abs/the-parameterized-hardness-of-the-k-center-problem-in-transportation-networks-1802.085632020-03-03 https://scifaro.com/en/abs/limits-on-representing-boolean-functions-by-linear-combinations-of-simple-functions-thresholds-relus-and-low-degree-polynomials-1802.091212018-02-27 https://scifaro.com/en/abs/o-minimal-invariants-for-discrete-time-dynamical-systems-1802.092632020-05-13 https://scifaro.com/en/abs/role-colouring-graphs-in-hereditary-classes-1802.101802018-03-01 https://scifaro.com/en/abs/finding-steady-state-solutions-for-ode-systems-of-zero-first-and-homogeneous-second-order-chemical-reactions-is-np-hard-1803.006182018-04-11 https://scifaro.com/en/abs/fine-grained-complexity-of-analyzing-compressed-data-quantifying-improvements-over-decompress-and-solve-1803.007962018-03-05 https://scifaro.com/en/abs/clique-based-lower-bounds-for-parsing-tree-adjoining-grammars-1803.008042018-03-05 https://scifaro.com/en/abs/temporal-graph-classes-a-view-through-temporal-separators-1803.008822020-10-12 https://scifaro.com/en/abs/hardness-of-approximate-nearest-neighbor-search-1803.009042018-03-05 https://scifaro.com/en/abs/multivariate-fine-grained-complexity-of-longest-common-subsequence-1803.009382018-03-05 https://scifaro.com/en/abs/symmetry-and-algorithmic-complexity-of-polyominoes-and-polyhedral-graphs-1803.021862018-03-07 https://scifaro.com/en/abs/testing-the-complexity-of-a-valued-csp-language-1803.022892019-04-23 https://scifaro.com/en/abs/good-distance-lattices-from-high-dimensional-expanders-1803.028492018-03-09 https://scifaro.com/en/abs/generalized-distance-domination-problems-and-their-complexity-on-graphs-of-bounded-mim-width-1803.035142018-07-12 https://scifaro.com/en/abs/a-theory-of-np-completeness-and-ill-conditioning-for-approximate-real-computations-1803.036002020-05-05 https://scifaro.com/en/abs/computational-complexity-of-generalized-push-fight-1803.037082018-03-13 https://scifaro.com/en/abs/reproducibility-and-pseudo-determinism-in-log-space-1803.040252018-03-14 https://scifaro.com/en/abs/dedekind-zeta-zeroes-and-faster-complex-dimension-computation-1803.041042018-03-13 https://scifaro.com/en/abs/luby-veli-v-c-kovi-c-wigderson-revisited-improved-correlation-bounds-and-pseudorandom-generators-for-depth-two-circuits-1803.045532018-03-14 https://scifaro.com/en/abs/greedy-can-beat-pure-dynamic-programming-1803.053802019-11-21 https://scifaro.com/en/abs/computational-complexity-of-the-avalanche-problem-on-one-dimensional-kadanoff-sandpiles-1803.054982018-03-16 https://scifaro.com/en/abs/approximating-max-cut-under-graph-mso-constraints-1803.057182018-10-19 https://scifaro.com/en/abs/some-closure-results-for-polynomial-factorization-and-applications-1803.059332018-03-19 https://scifaro.com/en/abs/computational-topology-and-the-unique-games-conjecture-1803.068002018-03-20 https://scifaro.com/en/abs/parameterized-complexity-of-fair-vertex-evaluation-problems-1803.068782020-06-11 https://scifaro.com/en/abs/sub-exponential-upper-bound-for-xsat-of-some-cnf-classes-1803.073762018-03-21 https://scifaro.com/en/abs/a-modification-of-the-csp-algorithm-for-infinite-languages-1803.074652019-03-07 https://scifaro.com/en/abs/parameterized-intractability-of-even-set-and-shortest-vector-problem-from-gap-eth-1803.097172018-03-28 https://scifaro.com/en/abs/an-efficient-method-to-transform-sat-problems-to-binary-integer-linear-programming-problem-1803.099632018-03-28 https://scifaro.com/en/abs/real-time-computability-of-real-numbers-by-chemical-reaction-networks-1803.102672018-03-29 https://scifaro.com/en/abs/non-interlaced-sat-is-in-p-1803.105742019-03-26 https://scifaro.com/en/abs/capturing-polynomial-time-using-modular-decomposition-1803.111342023-06-22 https://scifaro.com/en/abs/complexity-of-the-cnf-satisfiability-problem-1804.024782018-07-23 https://scifaro.com/en/abs/a-near-optimal-depth-hierarchy-theorem-for-small-depth-multilinear-circuits-1804.025202018-04-10 https://scifaro.com/en/abs/symmetric-circuits-for-rank-logic-1804.029392020-08-20 https://scifaro.com/en/abs/on-top-fan-in-vs-formal-degree-for-depth-3-arithmetic-circuits-1804.033032018-04-11 https://scifaro.com/en/abs/end-of-potential-line-1804.034502018-04-19 https://scifaro.com/en/abs/non-malleable-extractors-and-non-malleable-codes-partially-optimal-constructions-1804.040052018-04-12 https://scifaro.com/en/abs/boolean-approximate-counting-csps-with-weak-conservativity-and-implications-for-ferromagnetic-two-spin-1804.049932020-01-17 https://scifaro.com/en/abs/the-graph-exploration-problem-with-advice-1804.066752018-04-23 https://scifaro.com/en/abs/quantum-lov-asz-local-lemma-shearer-s-bound-is-tight-1804.070552024-09-30 https://scifaro.com/en/abs/finer-tight-bounds-for-coloring-on-clique-width-1804.079752018-04-24 https://scifaro.com/en/abs/boolean-functions-on-high-dimensional-expanders-1804.081552024-01-18 https://scifaro.com/en/abs/torus-polynomials-an-algebraic-approach-to-acc-lower-bounds-1804.081762019-03-04 https://scifaro.com/en/abs/small-set-expansion-in-shortcode-graph-and-the-2-to-2-conjecture-1804.086622018-04-25 https://scifaro.com/en/abs/lower-bounds-for-special-cases-of-syntactic-multilinear-abps-1804.088102018-04-25 https://scifaro.com/en/abs/polynomial-kernels-for-hitting-forbidden-minors-under-structural-parameterizations-1804.088852018-04-25 https://scifaro.com/en/abs/tighter-connections-between-formula-sat-and-shaving-logs-1804.089782018-05-01 https://scifaro.com/en/abs/on-multilinear-forms-bias-correlation-and-tensor-rank-1804.091242018-04-26 https://scifaro.com/en/abs/a-more-fine-grained-complexity-analysis-of-finding-the-most-vital-edges-for-undirected-shortest-paths-1804.091552018-04-25 https://scifaro.com/en/abs/post-selected-classical-query-complexity-1804.100102018-05-15 https://scifaro.com/en/abs/who-witnesses-the-witness-finding-witnesses-in-the-witness-is-hard-and-sometimes-impossible-1804.101932019-02-12 https://scifaro.com/en/abs/partial-complementation-of-graphs-1804.109202020-06-11 https://scifaro.com/en/abs/fundamentals-of-parameterized-complexity-revisited-1804.110892019-11-19 https://scifaro.com/en/abs/a-complexity-dichotomy-for-matching-cut-in-bipartite-graphs-of-fixed-diameter-1804.111022018-10-29 https://scifaro.com/en/abs/universality-in-freezing-cellular-automata-1805.000592018-05-02 https://scifaro.com/en/abs/lower-bounds-for-tolerant-junta-and-unateness-testing-via-rejection-sampling-of-graphs-1805.010742018-05-04 https://scifaro.com/en/abs/two-theorems-about-the-p-versus-np-problem-1805.017552018-05-09 https://scifaro.com/en/abs/faster-algorithms-for-counting-subgraphs-in-sparse-graphs-1805.020892020-09-01 https://scifaro.com/en/abs/on-restricted-disjunctive-temporal-problems-faster-algorithms-and-tractability-frontier-1805.021832018-08-07 https://scifaro.com/en/abs/fine-grained-complexity-meets-ip-pspace-1805.023512022-12-12 https://scifaro.com/en/abs/computational-complexity-of-space-bounded-real-numbers-1805.025722018-05-08 https://scifaro.com/en/abs/the-computational-complexity-of-finding-hamiltonian-cycles-in-grid-graphs-of-semiregular-tessellations-1805.031922018-05-09 https://scifaro.com/en/abs/eth-hardness-of-approximating-2-csps-and-directed-steiner-network-1805.038672018-05-11 https://scifaro.com/en/abs/reconfiguration-of-satisfying-assignments-and-subset-sums-easy-to-find-hard-to-connect-1805.040552020-01-17 https://scifaro.com/en/abs/the-temporal-explorer-who-returns-to-the-base-1805.047132018-05-15 https://scifaro.com/en/abs/an-indexing-for-quadratic-residues-modulo-n-and-a-non-uniform-efficient-decoding-algorithm-1805.047312018-11-26 https://scifaro.com/en/abs/a-survey-on-analog-models-of-computation-1805.057292018-05-16 https://scifaro.com/en/abs/near-optimal-communication-lower-bounds-for-approximate-nash-equilibria-1805.063872018-05-17 https://scifaro.com/en/abs/a-note-on-polynomial-identity-testing-for-depth-3-circuits-1805.066922018-05-22 https://scifaro.com/en/abs/more-consequences-of-falsifying-seth-and-the-orthogonal-vectors-conjecture-1805.085542018-05-23 https://scifaro.com/en/abs/complexity-of-stability-in-trading-networks-1805.087582025-10-03 https://scifaro.com/en/abs/on-the-computational-complexity-of-model-checking-for-dynamic-epistemic-logic-with-s5-models-1805.098802020-09-21 https://scifaro.com/en/abs/measuring-congruence-on-high-dimensional-time-series-1805.106972018-06-04 https://scifaro.com/en/abs/toward-super-polynomial-size-lower-bounds-for-depth-two-threshold-circuits-1805.106982018-05-29 https://scifaro.com/en/abs/quantum-generalizations-of-the-polynomial-hierarchy-with-applications-to-qma-2-1805.111392023-12-29 https://scifaro.com/en/abs/the-complexity-of-splitting-necklaces-and-bisecting-ham-sandwiches-1805.125592018-11-06 https://scifaro.com/en/abs/the-real-tau-conjecture-is-true-on-average-1806.004172021-07-30 https://scifaro.com/en/abs/k-medoids-and-p-median-clustering-are-solvable-in-polynomial-time-for-a-2d-pareto-front-1806.020982020-05-22 https://scifaro.com/en/abs/structural-rounding-approximation-algorithms-for-graphs-near-an-algorithmically-tractable-class-1806.027712018-12-11 https://scifaro.com/en/abs/acyclic-orientations-with-degree-constraints-1806.034262018-06-13 https://scifaro.com/en/abs/an-overview-of-some-semantic-and-syntactic-complexity-classes-1806.035012018-06-12 https://scifaro.com/en/abs/computational-complexity-of-motion-planning-of-a-robot-through-simple-gadgets-1806.035392018-06-13 https://scifaro.com/en/abs/on-the-fourier-entropy-influence-conjecture-for-extremal-classes-1806.036462019-01-25 https://scifaro.com/en/abs/towards-completely-characterizing-the-complexity-of-boolean-nets-synthesis-1806.037032018-11-16 https://scifaro.com/en/abs/on-the-hardness-of-satisfiability-with-bounded-occurrences-in-the-polynomial-time-hierarchy-1806.040802018-06-12 https://scifaro.com/en/abs/tensor-based-hardness-of-the-shortest-vector-problem-to-within-almost-polynomial-factors-1806.040872018-06-12 https://scifaro.com/en/abs/pseudorandom-generators-for-width-3-branching-programs-1806.042562018-06-13 https://scifaro.com/en/abs/losing-at-checkers-is-hard-1806.056572018-06-15 https://scifaro.com/en/abs/arithmetic-circuits-with-locally-low-algebraic-rank-1806.060972018-06-19 https://scifaro.com/en/abs/average-case-lower-bounds-and-satisfiability-algorithms-for-small-threshold-circuits-1806.062902018-06-19 https://scifaro.com/en/abs/reducibility-and-computational-lower-bounds-for-problems-with-planted-sparse-structure-1806.075082019-11-19 https://scifaro.com/en/abs/effective-divergence-analysis-for-linear-recurrence-sequences-1806.077402021-11-22 https://scifaro.com/en/abs/resolution-with-counting-dag-like-lower-bounds-and-different-moduli-1806.093832019-11-19 https://scifaro.com/en/abs/sum-of-squares-meets-nash-optimal-lower-bounds-for-finding-any-equilibrium-1806.094262018-06-26 https://scifaro.com/en/abs/is-your-function-low-dimensional-1806.100572018-11-05 https://scifaro.com/en/abs/computing-the-metric-dimension-by-decomposing-graphs-into-extended-biconnected-components-1806.103892018-06-28 https://scifaro.com/en/abs/lower-bounds-for-dynamic-programming-on-planar-graphs-of-bounded-cutwidth-1806.105132018-06-28 https://scifaro.com/en/abs/the-complexity-of-approximately-counting-retractions-1807.005902020-06-04 https://scifaro.com/en/abs/a-note-on-degree-vs-gap-of-min-rep-label-cover-and-improved-inapproximability-for-connectivity-problems-1807.009362018-07-04 https://scifaro.com/en/abs/the-complexity-of-disjunctive-linear-diophantine-constraints-1807.009852018-07-04 https://scifaro.com/en/abs/quantum-random-self-modifiable-computation-1807.013692024-06-21 https://scifaro.com/en/abs/counting-induced-subgraphs-a-topological-approach-to-w-1-hardness-1807.019202018-07-06 https://scifaro.com/en/abs/computing-kernels-in-parallel-lower-and-upper-bounds-1807.036042018-07-11 https://scifaro.com/en/abs/orbits-of-monomials-and-factorization-into-products-of-linear-forms-1807.036632018-07-11 https://scifaro.com/en/abs/knowledge-compilation-width-and-quantification-1807.042632018-07-12 https://scifaro.com/en/abs/on-the-approximation-resistance-of-balanced-linear-threshold-functions-1807.044212018-12-14 https://scifaro.com/en/abs/computational-complexity-of-games-and-puzzles-1807.047242018-07-13 https://scifaro.com/en/abs/probabilistic-verification-of-all-languages-1807.047352018-07-13 https://scifaro.com/en/abs/postselecting-probabilistic-finite-state-recognizers-and-verifiers-1807.051692018-07-16 https://scifaro.com/en/abs/an-algorithmic-blend-of-lps-and-ring-equations-for-promise-csps-1807.051942018-07-16 https://scifaro.com/en/abs/fast-witness-counting-1807.057772018-07-17 https://scifaro.com/en/abs/near-optimal-bootstrapping-of-hitting-sets-for-algebraic-models-1807.063232024-12-09 https://scifaro.com/en/abs/expressing-linear-orders-requires-exponential-size-dnnfs-1807.063972019-05-31 https://scifaro.com/en/abs/on-computing-centroids-according-to-the-p-norms-of-hamming-distance-vectors-1807.064692019-06-28 https://scifaro.com/en/abs/maximum-likelihood-network-reconstruction-for-sis-processes-is-np-hard-1807.086302018-07-24 https://scifaro.com/en/abs/a-note-on-clustering-aggregation-for-binary-clusterings-1807.089492023-11-10 https://scifaro.com/en/abs/proceedings-of-the-9th-international-workshop-on-physics-and-computation-1807.105632018-07-30 https://scifaro.com/en/abs/team-diagonalization-1807.109832018-07-31 https://scifaro.com/en/abs/parameterized-orientable-deletion-1807.115182020-01-28 https://scifaro.com/en/abs/list-decoding-with-double-samplers-1808.004252022-11-24 https://scifaro.com/en/abs/revisiting-the-simulation-of-quantum-turing-machines-by-quantum-circuits-1808.017012019-09-11 https://scifaro.com/en/abs/on-the-computational-complexity-of-length-and-neighborhood-constrained-path-problems-1808.023592019-05-28 https://scifaro.com/en/abs/positive-1-in-3-sat-admits-a-non-trivial-kernel-1808.028212020-11-02 https://scifaro.com/en/abs/fooling-polytopes-1808.040352018-08-14 https://scifaro.com/en/abs/algorithmic-no-cloning-theorem-1808.042132021-01-12 https://scifaro.com/en/abs/pseudorandom-generators-for-read-once-branching-programs-in-any-order-1808.062652018-08-21 https://scifaro.com/en/abs/ppp-completeness-with-connections-to-cryptography-1808.064072018-08-21 https://scifaro.com/en/abs/near-log-convexity-of-measured-heat-in-discrete-time-and-consequences-1808.067172018-08-22 https://scifaro.com/en/abs/stable-divisorial-gonality-is-in-np-1808.069212018-08-22 https://scifaro.com/en/abs/new-bounds-for-energy-complexity-of-boolean-functions-1808.071992020-09-17 https://scifaro.com/en/abs/solving-partition-problems-almost-always-requires-pushing-many-vertices-around-1808.087722019-08-27 https://scifaro.com/en/abs/fair-redistricting-is-hard-1808.089052018-08-28 https://scifaro.com/en/abs/undecidable-word-problem-in-subshift-automorphism-groups-1808.091942018-09-05 https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-median-closed-semilinear-constraints-1808.100682018-10-30 https://scifaro.com/en/abs/recognizing-generating-subgraphs-in-graphs-without-cycles-of-lengths-6-and-7-1808.101372018-08-31 https://scifaro.com/en/abs/sensitivity-affine-transforms-and-quantum-communication-complexity-1808.101912020-09-15 https://scifaro.com/en/abs/a-class-of-orders-with-linear-time-sorting-algorithm-1809.009542019-01-01 https://scifaro.com/en/abs/computing-optimal-discrete-readout-weights-in-reservoir-computing-is-np-hard-1809.010212019-08-27 https://scifaro.com/en/abs/reasoning-in-bayesian-opinion-exchange-networks-is-pspace-hard-1809.010772018-09-05 https://scifaro.com/en/abs/a-note-on-the-tight-example-in-on-the-randomised-query-complexity-of-composition-1809.011182019-11-12 https://scifaro.com/en/abs/min-a-cyclic-feedback-vertex-sets-and-min-ones-monotone-3-sat-1809.019982018-09-07 https://scifaro.com/en/abs/smoothed-efficient-algorithms-and-reductions-for-network-coordination-games-1809.022802019-02-27 https://scifaro.com/en/abs/complexity-of-mldp-1809.026562018-09-11 https://scifaro.com/en/abs/resolution-and-the-binary-encoding-of-combinatorial-principles-1809.028432018-09-20 https://scifaro.com/en/abs/computational-aspects-of-optimal-strategic-network-diffusion-1809.031412020-01-31 https://scifaro.com/en/abs/a-fixed-depth-size-hierarchy-theorem-for-ac-0-oplus-via-the-coin-problem-1809.040922019-02-21 https://scifaro.com/en/abs/the-curse-and-blessing-of-not-all-equal-in-k-satisfiability-1809.043122019-06-27 https://scifaro.com/en/abs/a-simple-elementary-proof-of-p-np-based-on-the-relational-model-of-e-f-codd-1809.045192018-10-23 https://scifaro.com/en/abs/a-sat-algorithm-for-small-constant-depth-circuits-with-ptf-gates-1809.059322018-09-18 https://scifaro.com/en/abs/equivalence-between-pathbreadth-and-strong-pathbreadth-1809.060412018-09-18 https://scifaro.com/en/abs/best-case-and-worst-case-sparsifiability-of-boolean-csps-1809.061712018-09-18 https://scifaro.com/en/abs/constructing-hard-examples-for-graph-isomorphism-1809.081542019-03-19 https://scifaro.com/en/abs/optimizing-a-generalized-gini-index-in-stable-marriage-problems-np-hardness-approximation-and-a-polynomial-time-special-case-1809.084532018-09-25 https://scifaro.com/en/abs/graph-pattern-polynomials-1809.088582018-09-25 https://scifaro.com/en/abs/optimality-of-linear-sketching-under-modular-updates-1809.090632018-09-25 https://scifaro.com/en/abs/subexponential-algorithms-for-variants-of-homomorphism-problem-in-string-graphs-1809.093452019-06-24 https://scifaro.com/en/abs/correlation-clustering-generalized-1809.094932018-09-26 https://scifaro.com/en/abs/improved-bounds-on-fourier-entropy-and-min-entropy-1809.098192021-09-20 https://scifaro.com/en/abs/trading-information-complexity-for-error-ii-the-case-of-a-large-error-and-external-information-complexity-1809.102192019-10-29 https://scifaro.com/en/abs/spanoids-an-abstraction-of-spanning-structures-and-a-barrier-for-lccs-1809.103722018-11-22 https://scifaro.com/en/abs/reoptimization-of-parameterized-problems-1809.105782019-07-31 https://scifaro.com/en/abs/complexity-of-training-relu-neural-network-1809.107872020-11-05 https://scifaro.com/en/abs/minimum-link-rectilinear-covering-tour-is-np-hard-in-r-4-1810.005292018-10-02 https://scifaro.com/en/abs/solving-3sat-by-reduction-to-testing-for-odd-hole-1810.008752018-10-03 https://scifaro.com/en/abs/graph-isomorphism-by-conversion-to-chordal-6-3-graphs-1810.008762018-10-03 https://scifaro.com/en/abs/approximating-the-existential-theory-of-the-reals-1810.013932020-03-24 https://scifaro.com/en/abs/polynomial-time-recognition-of-4-steiner-powers-1810.023042019-02-05 https://scifaro.com/en/abs/on-block-sensitivity-and-fractional-block-sensitivity-1810.023932018-10-08 https://scifaro.com/en/abs/on-the-inner-product-predicate-and-a-generalization-of-matching-vector-families-1810.023962018-10-08 https://scifaro.com/en/abs/improved-inapproximability-of-rainbow-coloring-1810.027842018-11-06 https://scifaro.com/en/abs/stochastic-chemical-reaction-networks-for-robustly-approximating-arbitrary-probability-distributions-1810.028542019-10-01 https://scifaro.com/en/abs/problem-solving-at-the-edge-of-chaos-entropy-puzzles-and-the-sudoku-freezing-transition-1810.037422018-10-10 https://scifaro.com/en/abs/on-the-relationship-between-energy-complexity-and-other-boolean-function-measures-1810.038112019-04-29 https://scifaro.com/en/abs/on-the-distance-identifying-set-meta-problem-and-applications-to-the-complexity-of-identifying-problems-on-graphs-1810.038682018-10-10 https://scifaro.com/en/abs/enumerating-models-of-dnf-faster-breaking-the-dependency-on-the-formula-size-1810.040062024-08-27 https://scifaro.com/en/abs/uniform-csp-parameterized-by-solution-size-is-in-w-1-1810.041902019-05-01 https://scifaro.com/en/abs/the-computational-complexity-of-training-relu-s-1810.042072018-10-17 https://scifaro.com/en/abs/on-the-complexity-of-solution-extension-of-optimization-problems-1810.045532018-10-11 https://scifaro.com/en/abs/extension-of-vertex-cover-and-independent-set-in-some-classes-of-graphs-and-generalizations-1810.046292018-10-12 https://scifaro.com/en/abs/algorithm-for-mathcal-b-partitions-parameterized-complexity-of-the-matrix-determinant-and-permanent-1810.046702018-10-12 https://scifaro.com/en/abs/investigating-the-power-of-circuits-with-mod-6-gates-1810.056032018-10-15 https://scifaro.com/en/abs/semitotal-domination-new-hardness-results-and-a-polynomial-time-algorithm-for-graphs-of-bounded-mim-width-1810.068722018-10-17 https://scifaro.com/en/abs/complexity-of-computing-the-anti-ramsey-numbers-for-paths-1810.080042020-07-06 https://scifaro.com/en/abs/parity-decision-tree-complexity-is-greater-than-granularity-1810.086682018-10-29 https://scifaro.com/en/abs/limits-on-all-known-and-some-unknown-approaches-to-matrix-multiplication-1810.086712018-10-23 https://scifaro.com/en/abs/conflict-complexity-is-lower-bounded-by-block-sensitivity-1810.088732020-05-12 https://scifaro.com/en/abs/art-gallery-problem-with-rook-and-queen-vision-1810.109612018-11-21 https://scifaro.com/en/abs/finding-dissimilar-explanations-in-bayesian-networks-complexity-results-1810.113912018-12-12 https://scifaro.com/en/abs/minimum-reload-cost-graph-factors-1810.117002019-02-07 https://scifaro.com/en/abs/holant-clones-and-the-approximability-of-conservative-holant-problems-1811.008172023-04-25 https://scifaro.com/en/abs/algebraic-approach-to-promise-constraint-satisfaction-1811.009702021-07-19 https://scifaro.com/en/abs/some-results-on-the-circuit-complexity-of-bounded-width-circuits-and-nondeterministic-circuits-1811.013472019-04-15 https://scifaro.com/en/abs/size-degree-trade-offs-for-sums-of-squares-and-positivstellensatz-proofs-1811.013512019-02-21 https://scifaro.com/en/abs/probabilistic-parameterized-polynomial-time-1811.016512018-11-06 https://scifaro.com/en/abs/on-the-maximum-distance-sublattice-problem-and-closest-vector-problem-1811.030192024-10-02 https://scifaro.com/en/abs/approximability-of-the-eight-vertex-model-1811.031262018-11-09 https://scifaro.com/en/abs/unique-end-of-potential-line-1811.038412018-11-12 https://scifaro.com/en/abs/the-layer-complexity-of-arthur-merlin-like-communication-1811.040102022-04-05 https://scifaro.com/en/abs/uniform-integral-and-feasible-proofs-for-the-determinant-identities-1811.043132018-11-13 https://scifaro.com/en/abs/streaming-hardness-of-unique-games-1811.046072020-11-13 https://scifaro.com/en/abs/compliance-in-real-time-multiset-rewriting-models-1811.048262018-11-13 https://scifaro.com/en/abs/circuit-depth-reductions-1811.048282020-12-09 https://scifaro.com/en/abs/parametric-shortest-paths-in-planar-graphs-1811.051152019-06-20 https://scifaro.com/en/abs/state-complexity-characterizations-of-parameterized-degree-bounded-graph-connectivity-sub-linear-space-computation-and-the-linear-space-hypothesis-1811.063362020-01-20 https://scifaro.com/en/abs/unifying-lower-bounds-for-algebraic-machines-semantically-1811.067872024-10-18 https://scifaro.com/en/abs/algorithmic-complexity-in-computational-biology-basics-challenges-and-limitations-1811.073122021-07-29 https://scifaro.com/en/abs/the-problematic-nature-of-potentially-polynomial-time-algorithms-solving-the-subset-sum-problem-1811.074012018-11-20 https://scifaro.com/en/abs/classical-algorithms-from-quantum-and-arthur-merlin-communication-protocols-1811.075152018-11-20 https://scifaro.com/en/abs/visibility-extension-via-reflective-edges-to-an-exact-quantity-1811.076492018-11-20 https://scifaro.com/en/abs/tight-approximation-ratio-for-minimum-maximal-matching-1811.085062018-11-22 https://scifaro.com/en/abs/a-composition-theorem-for-randomized-query-complexity-via-max-conflict-complexity-1811.107522018-11-28 https://scifaro.com/en/abs/the-complexity-of-matrix-multiplication-developments-since-2014-extended-abstract-of-2018-oberwolfach-complexity-meeting-plenary-lecture-1811.116672018-11-29 https://scifaro.com/en/abs/sum-of-squares-bounds-for-the-ordering-principle-1812.011632020-07-31 https://scifaro.com/en/abs/target-set-selection-parameterized-by-vertex-cover-and-more-1812.014822021-05-18 https://scifaro.com/en/abs/on-the-probabilistic-degree-of-or-over-the-reals-1812.019822022-11-24 https://scifaro.com/en/abs/on-the-complexity-landscape-of-connected-f-factor-problems-1812.020372018-12-06 https://scifaro.com/en/abs/consistency-for-0-1-programming-1812.022152018-12-07 https://scifaro.com/en/abs/on-the-enumeration-and-counting-of-bicriteria-temporal-paths-1812.025072020-07-10 https://scifaro.com/en/abs/toward-a-general-theory-of-motion-planning-complexity-characterizing-which-gadgets-make-games-hard-1812.035922020-01-15 https://scifaro.com/en/abs/output-oblivious-stochastic-chemical-reaction-networks-1812.044012022-08-31 https://scifaro.com/en/abs/the-complexity-of-factors-of-multivariate-polynomials-1812.068282018-12-18 https://scifaro.com/en/abs/barriers-for-fast-matrix-multiplication-from-irreversibility-1812.069522022-03-08 https://scifaro.com/en/abs/the-computational-complexity-of-angry-birds-1812.077932020-01-17 https://scifaro.com/en/abs/limits-on-the-universal-method-for-matrix-multiplication-1812.087312019-05-02 https://scifaro.com/en/abs/sub-exponential-complexity-of-regular-linear-cnf-formulas-1812.091102018-12-24 https://scifaro.com/en/abs/complexity-of-partitioning-hypergraphs-1812.092062018-12-27 https://scifaro.com/en/abs/quantum-query-complexity-of-symmetric-oracle-problems-1812.094282021-03-10 https://scifaro.com/en/abs/constructing-faithful-homomorphisms-over-fields-of-finite-characteristic-1812.102492022-12-14 https://scifaro.com/en/abs/choosability-in-bounded-sequential-list-coloring-1812.116852019-01-01 https://scifaro.com/en/abs/complexity-of-linear-operators-1812.117722019-01-07 https://scifaro.com/en/abs/algorithmically-efficient-syntactic-characterization-of-possibility-domains-1901.001382019-09-04 https://scifaro.com/en/abs/cluster-editing-with-vertex-splitting-1901.001562023-11-03 https://scifaro.com/en/abs/near-optimal-lower-bounds-on-the-threshold-degree-and-sign-rank-of-ac-0-1901.009882019-01-07 https://scifaro.com/en/abs/a-new-approach-to-multi-party-peer-to-peer-communication-complexity-1901.011782020-10-01 https://scifaro.com/en/abs/on-np-completeness-of-the-cell-formation-problem-1901.027782019-01-10 https://scifaro.com/en/abs/on-the-descriptive-complexity-of-color-coding-1901.033642019-01-14 https://scifaro.com/en/abs/longest-common-subsequence-on-weighted-sequences-1901.040682020-07-21 https://scifaro.com/en/abs/lower-bounds-for-multilinear-bounded-order-abps-1901.043772019-01-15 https://scifaro.com/en/abs/on-geometric-complexity-theory-multiplicity-obstructions-are-stronger-than-occurrence-obstructions-1901.045762019-01-16 https://scifaro.com/en/abs/on-the-complexity-of-exact-pattern-matching-in-graphs-binary-strings-and-bounded-degree-1901.052642020-06-04 https://scifaro.com/en/abs/supportive-oracles-for-parameterized-polynomial-time-sub-linear-space-computations-in-relation-to-l-nl-and-p-1901.058542019-01-18 https://scifaro.com/en/abs/lower-bounds-for-linear-decision-lists-1901.059112019-01-18 https://scifaro.com/en/abs/towards-a-general-direct-product-testing-theorem-1901.062202019-01-21 https://scifaro.com/en/abs/efficiently-factoring-polynomials-modulo-p-4-1901.066282019-02-27 https://scifaro.com/en/abs/deterministic-constructions-of-high-dimensional-sets-with-small-dispersion-1901.067022024-12-20 https://scifaro.com/en/abs/reachability-problem-in-non-uniform-cellular-automata-1901.082462019-01-25 https://scifaro.com/en/abs/deterministic-2-dimensional-temperature-1-tile-assembly-systems-cannot-compute-1901.085752019-01-25 https://scifaro.com/en/abs/subspace-arrangements-graph-rigidity-and-derandomization-through-submodular-optimization-1901.094232019-01-29 https://scifaro.com/en/abs/parameterized-complexity-of-safe-set-1901.094342019-02-01 https://scifaro.com/en/abs/the-semialgebraic-orbit-problem-1901.110232019-02-01 https://scifaro.com/en/abs/reachability-in-high-treewidth-graphs-1901.112852019-02-06 https://scifaro.com/en/abs/on-solving-reachability-in-grid-digraphs-using-a-psuedoseparator-1902.004882025-01-03 https://scifaro.com/en/abs/computational-complexity-of-queries-based-on-itemsets-1902.006332019-02-05 https://scifaro.com/en/abs/some-remarks-on-real-time-turing-machines-1902.009752019-02-05 https://scifaro.com/en/abs/the-hardest-halfspace-1902.017652019-02-06 https://scifaro.com/en/abs/on-the-hardness-and-inapproximability-of-recognizing-wheeler-graphs-1902.019602019-02-27 https://scifaro.com/en/abs/non-cooperatively-assembling-large-structures-a-2d-pumping-lemma-cannot-be-as-powerful-as-its-1d-counterpart-1902.022532021-07-19 https://scifaro.com/en/abs/mathsf-qma-lower-bounds-for-approximate-counting-1902.023982019-02-08 https://scifaro.com/en/abs/fourier-bounds-and-pseudorandom-generators-for-product-tests-1902.024282019-02-08 https://scifaro.com/en/abs/on-modeling-hard-combinatorial-optimization-problems-as-linear-programs-refutations-of-the-unconditional-impossibility-claims-1902.035492019-02-12 https://scifaro.com/en/abs/on-the-complexity-of-exact-pattern-matching-in-graphs-determinism-and-zig-zag-matching-1902.035602019-02-12 https://scifaro.com/en/abs/a-simple-gap-producing-reduction-for-the-parameterized-set-cover-problem-1902.037022019-04-29 https://scifaro.com/en/abs/solving-qsat-in-sublinear-depth-1902.038792019-02-13 https://scifaro.com/en/abs/a-turing-machine-simulation-by-p-systems-without-charges-1902.038832020-08-05 https://scifaro.com/en/abs/equivalent-polyadic-decompositions-of-matrix-multiplication-tensors-1902.039502022-04-15 https://scifaro.com/en/abs/csps-with-global-modular-constraints-algorithms-and-hardness-via-polynomial-representations-1902.047402019-02-14 https://scifaro.com/en/abs/new-results-on-directed-edge-dominating-set-1902.049192023-06-22 https://scifaro.com/en/abs/counting-answers-to-existential-questions-1902.049602019-04-30 https://scifaro.com/en/abs/reconstructing-trees-from-traces-1902.051012020-09-22 https://scifaro.com/en/abs/complexity-theoretic-aspects-of-expanding-cellular-automata-1902.054872021-02-05 https://scifaro.com/en/abs/parameterized-fine-grained-reductions-1902.055292019-02-15 https://scifaro.com/en/abs/beating-treewidth-for-average-case-subgraph-isomorphism-1902.063802020-11-04 https://scifaro.com/en/abs/information-theoretic-lower-bounds-for-quantum-sorting-1902.064732019-02-19 https://scifaro.com/en/abs/error-reduction-of-quantum-algorithms-1902.068522019-07-24 https://scifaro.com/en/abs/towards-optimal-depth-reductions-for-syntactically-multilinear-circuits-1902.070632019-02-20 https://scifaro.com/en/abs/pit-for-depth-4-circuits-and-sylvester-gallai-conjecture-for-polynomials-1902.072012019-02-20 https://scifaro.com/en/abs/continuous-ordinary-differential-equations-and-transfinite-computations-1902.072452020-01-22 https://scifaro.com/en/abs/optimal-average-case-reductions-to-sparse-pca-from-weak-assumptions-to-strong-hardness-1902.073802019-02-21 https://scifaro.com/en/abs/the-weak-call-by-value-lambda-calculus-is-reasonable-for-both-time-and-space-1902.075152022-12-09 https://scifaro.com/en/abs/the-hairy-ball-problem-is-ppad-complete-1902.076572022-09-12 https://scifaro.com/en/abs/the-arboricity-captures-the-complexity-of-sampling-edges-1902.080862019-02-22 https://scifaro.com/en/abs/the-power-of-self-reducibility-selectivity-information-and-approximation-1902.082992019-03-18 https://scifaro.com/en/abs/slightly-superexponential-parameterized-problems-1902.087232019-02-26 https://scifaro.com/en/abs/characterizing-pspace-with-shallow-non-confluent-p-systems-1902.095232020-08-05 https://scifaro.com/en/abs/on-reachability-problems-for-low-dimensional-matrix-semigroups-1902.095972019-04-30 https://scifaro.com/en/abs/a-hierarchy-of-polynomial-kernels-1902.110062019-03-01 https://scifaro.com/en/abs/interpretation-of-ndtm-in-the-definition-of-np-1903.003552019-03-04 https://scifaro.com/en/abs/sign-rank-can-increase-under-intersection-1903.005442019-03-05 https://scifaro.com/en/abs/strongly-exponential-separation-between-monotone-vp-and-monotone-vnp-1903.016302020-08-03 https://scifaro.com/en/abs/reducing-the-domination-number-of-graphs-via-edge-contractions-1903.018002019-03-06 https://scifaro.com/en/abs/proving-the-np-completeness-of-optimal-moral-graph-triangulation-1903.022012019-03-07 https://scifaro.com/en/abs/closure-of-vp-under-taking-factors-a-short-and-simple-proof-1903.023662019-04-22 https://scifaro.com/en/abs/computing-exact-solutions-of-consensus-halving-and-the-borsuk-ulam-theorem-1903.031012021-02-11 https://scifaro.com/en/abs/how-fast-can-we-reach-a-target-vertex-in-stochastic-temporal-graphs-1903.036362019-03-12 https://scifaro.com/en/abs/knowledge-compilation-languages-as-proof-systems-1903.040392019-03-12 https://scifaro.com/en/abs/2-club-is-np-hard-for-distance-to-2-club-cluster-graphs-1903.054252019-03-14 https://scifaro.com/en/abs/like-patterns-and-complexity-1903.061952019-03-18 https://scifaro.com/en/abs/deterministic-approximation-of-random-walks-in-small-space-1903.063612019-11-26 https://scifaro.com/en/abs/proportionally-dense-subgraph-of-maximum-size-complexity-and-approximation-1903.065792020-06-11 https://scifaro.com/en/abs/token-swapping-on-trees-1903.069812023-06-22 https://scifaro.com/en/abs/how-hard-is-robust-mean-estimation-1903.078702019-06-05 https://scifaro.com/en/abs/polynomial-analogue-of-gandhi-s-fixed-point-theorem-1903.081092021-06-18 https://scifaro.com/en/abs/the-average-case-complexity-of-counting-cliques-in-erdos-renyi-hypergraphs-1903.082472021-07-23 https://scifaro.com/en/abs/almost-tight-lower-bounds-for-hard-cutting-problems-in-embedded-graphs-1903.086032021-02-18 https://scifaro.com/en/abs/faster-random-k-cnf-satisfiability-1903.106182019-03-27 https://scifaro.com/en/abs/treewidth-and-counting-projected-answer-sets-1903.113162019-03-28 https://scifaro.com/en/abs/fourier-entropy-influence-conjecture-for-random-linear-threshold-functions-1903.116352019-03-29 https://scifaro.com/en/abs/complete-disjoint-conp-pairs-but-no-complete-total-polynomial-search-problems-relative-to-an-oracle-1903.118602019-11-21 https://scifaro.com/en/abs/deep-fri-sampling-outside-the-box-improves-soundness-1903.122432019-04-01 https://scifaro.com/en/abs/stabilizer-circuits-quadratic-forms-and-computing-matrix-rank-1904.001012019-04-09 https://scifaro.com/en/abs/a-note-on-hardness-frameworks-and-computational-complexity-of-xiangqi-and-janggi-1904.002002019-04-02 https://scifaro.com/en/abs/simplified-inpproximability-of-hypergraph-coloring-via-t-agreeing-families-1904.011632019-04-03 https://scifaro.com/en/abs/lower-bounds-for-matrix-factorization-1904.011822019-04-03 https://scifaro.com/en/abs/beyond-csp-a-dichotomy-for-counting-weighted-eulerian-orientations-with-ars-1904.023622021-04-13 https://scifaro.com/en/abs/automating-resolution-is-np-hard-1904.029912019-09-10 https://scifaro.com/en/abs/the-complexity-of-3-colouring-h-colourable-graphs-1904.032142020-06-25 https://scifaro.com/en/abs/semi-countable-sets-and-their-application-to-search-problems-1904.036362019-04-09 https://scifaro.com/en/abs/graph-pattern-detection-hardness-for-all-induced-patterns-and-faster-non-induced-cycles-1904.037412019-04-09 https://scifaro.com/en/abs/junta-correlation-is-testable-1904.042162019-04-09 https://scifaro.com/en/abs/more-barriers-for-rank-methods-via-a-numeric-to-symbolic-transfer-1904.042992019-04-10 https://scifaro.com/en/abs/the-complexity-of-definability-by-open-first-order-formulas-1904.046372019-04-10 https://scifaro.com/en/abs/parallels-between-phase-transitions-and-circuit-complexity-1904.054832019-12-10 https://scifaro.com/en/abs/p-optimal-proof-systems-for-each-np-complete-set-but-no-complete-disjoint-np-pairs-relative-to-an-oracle-1904.061752020-01-10 https://scifaro.com/en/abs/from-hall-s-marriage-theorem-to-boolean-satisfiability-and-back-1904.072182019-05-09 https://scifaro.com/en/abs/fast-commutative-matrix-algorithm-1904.076832020-07-28 https://scifaro.com/en/abs/extractors-for-small-zero-fixing-sources-1904.079492019-12-18 https://scifaro.com/en/abs/approximating-cumulative-pebbling-cost-is-unique-games-hard-1904.080782019-11-19 https://scifaro.com/en/abs/a-lower-bound-for-relaxed-locally-decodable-codes-1904.081122019-04-26 https://scifaro.com/en/abs/samplers-and-extractors-for-unbounded-functions-1904.083912019-09-19 https://scifaro.com/en/abs/a-conditional-lower-bound-on-graph-connectivity-in-mapreduce-1904.089542019-04-22 https://scifaro.com/en/abs/counting-induced-subgraphs-an-algebraic-approach-to-w-1-hardness-1904.104792019-04-25 https://scifaro.com/en/abs/counting-perfect-matchings-and-the-eight-vertex-model-1904.104932019-04-25 https://scifaro.com/en/abs/efficient-black-box-identity-testing-over-free-group-algebra-1904.123372019-04-30 https://scifaro.com/en/abs/dichotomy-for-symmetric-boolean-pcsps-1904.124242019-04-30 https://scifaro.com/en/abs/a-complete-classification-of-the-complexity-and-rewritability-of-ontology-mediated-queries-based-on-the-description-logic-el-1904.125332019-05-02 https://scifaro.com/en/abs/direct-sum-testing-the-general-case-1904.127472019-10-11 https://scifaro.com/en/abs/query-to-communication-lifting-using-low-discrepancy-gadgets-1904.130562021-10-06 https://scifaro.com/en/abs/case-study-of-the-proof-of-cook-s-theorem-interpretation-of-a-w-1904.131912019-05-01 https://scifaro.com/en/abs/a-note-on-computational-complexity-of-dou-shou-qi-1904.132052019-05-01 https://scifaro.com/en/abs/derandomization-from-algebraic-hardness-1905.000912020-06-29 https://scifaro.com/en/abs/on-a-conditional-inequality-in-kolmogorov-complexity-and-its-applications-in-communication-complexity-1905.001642019-05-02 https://scifaro.com/en/abs/parameterized-complexity-of-conflict-free-graph-coloring-1905.003052019-05-02 https://scifaro.com/en/abs/incorporating-weisfeiler-leman-into-algorithms-for-group-isomorphism-1905.025182019-05-08 https://scifaro.com/en/abs/space-bounded-church-turing-thesis-and-computational-tractability-of-closed-systems-1905.036102019-05-15 https://scifaro.com/en/abs/elimination-distances-blocking-sets-and-kernels-for-vertex-cover-1905.036312019-05-10 https://scifaro.com/en/abs/complexity-of-fall-coloring-for-restricted-graph-classes-1905.046952019-05-14 https://scifaro.com/en/abs/on-affine-reachability-problems-1905.051142020-07-03 https://scifaro.com/en/abs/graph-width-measures-for-cnf-encodings-with-auxiliary-variables-1905.052902020-01-23 https://scifaro.com/en/abs/on-a-certain-np-complete-problem-1905.061042023-11-07 https://scifaro.com/en/abs/parameterized-inapproximability-of-exact-cover-and-nearest-codeword-1905.065032019-05-21 https://scifaro.com/en/abs/separating-k-player-from-t-player-one-way-communication-with-applications-to-data-streams-1905.071352021-12-01 https://scifaro.com/en/abs/lasserre-integrality-gaps-for-graph-spanners-and-related-problems-1905.074682019-05-21 https://scifaro.com/en/abs/subcubic-equivalences-between-graph-centrality-measures-and-complementary-problems-1905.081272019-05-21 https://scifaro.com/en/abs/shortest-path-preserving-rounding-1905.086212019-05-22 https://scifaro.com/en/abs/the-computational-complexity-of-understanding-network-decisions-1905.091632019-06-19 https://scifaro.com/en/abs/computational-cost-for-determining-an-approximate-global-minimum-using-the-selection-and-crossover-algorithm-1905.100172019-05-27 https://scifaro.com/en/abs/counting-homomorphisms-modulo-a-prime-number-1905.106822019-05-28 https://scifaro.com/en/abs/on-the-monotone-complexity-of-the-shift-operator-1905.107472020-07-01 https://scifaro.com/en/abs/regular-resolution-for-cnfs-with-almost-bounded-one-sided-treewidth-1905.108672022-09-01 https://scifaro.com/en/abs/average-bias-and-polynomial-sources-1905.116122019-05-31 https://scifaro.com/en/abs/resolution-lower-bounds-for-refutation-statements-1905.123722019-05-30 https://scifaro.com/en/abs/consistency-of-circuit-lower-bounds-with-bounded-theories-1905.129352023-06-22 https://scifaro.com/en/abs/approximate-degree-secret-sharing-and-concentration-phenomena-1906.003262019-06-04 https://scifaro.com/en/abs/multistage-vertex-cover-1906.006592020-07-02 https://scifaro.com/en/abs/parameterised-complexity-of-abduction-in-schaefer-s-framework-1906.007032019-09-18 https://scifaro.com/en/abs/correlation-decay-and-partition-function-zeros-algorithms-and-phase-transitions-1906.012282022-08-05 https://scifaro.com/en/abs/on-the-distribution-of-runners-on-a-circle-1906.025112020-04-07 https://scifaro.com/en/abs/the-packed-interval-covering-problem-is-np-complete-1906.036762019-06-11 https://scifaro.com/en/abs/coin-theorems-and-the-fourier-expansion-1906.037432020-09-01 https://scifaro.com/en/abs/the-demand-query-model-for-bipartite-matching-1906.042132019-06-12 https://scifaro.com/en/abs/approximating-the-orthogonality-dimension-of-graphs-and-hypergraphs-1906.050052019-06-13 https://scifaro.com/en/abs/structural-parameterization-for-graph-deletion-problems-over-data-streams-1906.054582019-10-03 https://scifaro.com/en/abs/querying-a-matrix-through-matrix-vector-products-1906.057362019-11-11 https://scifaro.com/en/abs/running-time-analysis-of-the-1-1-ea-for-robust-linear-optimization-1906.068732022-12-07 https://scifaro.com/en/abs/on-the-strength-of-uniqueness-quantification-in-primitive-positive-formulas-1906.070312019-06-18 https://scifaro.com/en/abs/efficiently-sampling-and-estimating-from-substructures-using-linear-algebraic-queries-1906.073982022-02-22 https://scifaro.com/en/abs/fine-grained-complexity-of-the-graph-homomorphism-problem-for-bounded-treewidth-graphs-1906.083712020-02-20 https://scifaro.com/en/abs/computer-simulation-model-theory-p-np-is-not-provable-1906.098732019-06-25 https://scifaro.com/en/abs/finding-optimal-solutions-with-neighborly-help-1906.100782019-06-26 https://scifaro.com/en/abs/approximating-unitary-preparations-of-orthogonal-black-box-states-1906.104952019-06-26 https://scifaro.com/en/abs/is-it-easier-to-prove-theorems-that-are-guaranteed-to-be-true-1906.108372020-04-20 https://scifaro.com/en/abs/the-complexity-of-tiling-problems-1907.001022019-08-22 https://scifaro.com/en/abs/on-asymmetric-unification-for-the-theory-of-xor-with-a-homomorphism-1907.002272019-07-02 https://scifaro.com/en/abs/qcsp-monsters-and-the-demise-of-the-chen-conjecture-1907.002392022-07-28 https://scifaro.com/en/abs/isomorphism-problems-for-tensors-groups-and-cubic-forms-completeness-and-reductions-1907.003092025-06-18 https://scifaro.com/en/abs/the-directed-2-linkage-problem-with-length-constraints-1907.008172019-07-02 https://scifaro.com/en/abs/improved-hardness-for-h-colourings-of-g-colourable-graphs-1907.008722022-07-05 https://scifaro.com/en/abs/on-the-conditional-complexity-of-sets-of-strings-1907.010182021-02-09 https://scifaro.com/en/abs/efficient-circuit-simulation-in-mapreduce-1907.016242019-12-30 https://scifaro.com/en/abs/hardness-of-bichromatic-closest-pair-with-jaccard-similarity-1907.022512019-07-05 https://scifaro.com/en/abs/the-complexity-of-approximately-counting-retractions-to-square-free-graphs-1907.023192021-07-20 https://scifaro.com/en/abs/fixed-parameter-tractability-of-counting-small-minimum-s-t-cuts-1907.023532019-07-08 https://scifaro.com/en/abs/vector-colorings-of-random-ramanujan-and-large-girth-irregular-graphs-1907.025392019-07-08 https://scifaro.com/en/abs/identifiability-of-graphs-with-small-color-classes-by-the-weisfeiler-leman-algorithm-1907.028922020-03-18 https://scifaro.com/en/abs/oracle-separations-between-quantum-and-non-interactive-zero-knowledge-classes-1907.032052019-07-09 https://scifaro.com/en/abs/inapproximability-results-for-scheduling-with-interval-and-resource-restrictions-1907.035262019-07-09 https://scifaro.com/en/abs/a-formal-axiomatization-of-computation-1907.035332020-01-22 https://scifaro.com/en/abs/counting-and-finding-homomorphisms-is-universal-for-parameterized-complexity-theory-1907.038502021-08-04 https://scifaro.com/en/abs/global-cardinality-constraints-make-approximating-some-max-2-csps-harder-1907.041652019-09-19 https://scifaro.com/en/abs/interactive-verifiable-polynomial-evaluation-1907.043022019-07-10 https://scifaro.com/en/abs/on-the-approximability-of-presidential-type-predicates-1907.044512020-04-28 https://scifaro.com/en/abs/santha-vazirani-sources-deterministic-condensers-and-very-strong-extractors-1907.046402022-04-05 https://scifaro.com/en/abs/the-el-theorem-1907.047762023-09-12 https://scifaro.com/en/abs/spherical-discrepancy-minimization-and-algorithmic-lower-bounds-for-covering-the-sphere-1907.055152019-11-19 https://scifaro.com/en/abs/the-projection-games-conjecture-and-the-hardness-of-approximation-of-super-sat-and-related-problems-1907.055482021-10-06 https://scifaro.com/en/abs/efficient-methods-to-determine-the-reversibility-of-general-1d-linear-cellular-automata-in-polynomial-complexity-1907.060122019-07-16 https://scifaro.com/en/abs/parameterized-inapproximability-for-steiner-orientation-by-gap-amplification-1907.065292020-02-11 https://scifaro.com/en/abs/lower-bounding-the-and-or-tree-via-symmetrization-1907.067312023-03-23 https://scifaro.com/en/abs/quasipolynomial-computation-of-nested-fixpoints-1907.070202021-03-23 https://scifaro.com/en/abs/query-complexity-of-generalized-simon-s-problem-1907.073672021-09-07 https://scifaro.com/en/abs/interesting-open-problem-related-to-complexity-of-computing-the-fourier-transform-and-group-theory-1907.074712019-07-18 https://scifaro.com/en/abs/approximate-counting-csp-seen-from-the-other-side-1907.079222020-05-15 https://scifaro.com/en/abs/on-the-text-ac-0-oplus-complexity-of-andreev-s-problem-1907.079692019-07-19 https://scifaro.com/en/abs/metric-dimension-parameterized-by-treewidth-1907.080932019-07-19 https://scifaro.com/en/abs/imperfect-gaps-in-gap-eth-and-pcps-1907.081852019-07-19 https://scifaro.com/en/abs/complexity-of-modification-problems-for-reciprocal-best-match-graphs-1907.088652019-07-23 https://scifaro.com/en/abs/between-the-deterministic-and-non-deterministic-query-complexity-1907.095312025-04-10 https://scifaro.com/en/abs/the-k-dimensional-weisfeiler-leman-algorithm-1907.095822019-07-24 https://scifaro.com/en/abs/the-complexity-of-computational-problems-about-nash-equilibria-in-symmetric-win-lose-games-1907.104682019-07-25 https://scifaro.com/en/abs/a-note-on-the-complexity-of-integer-programming-games-1907.113382019-07-30 https://scifaro.com/en/abs/on-d-distance-m-tuple-ell-r-domination-in-graphs-1907.114162021-04-20 https://scifaro.com/en/abs/parameterized-valiant-s-classes-1907.122872019-11-25 https://scifaro.com/en/abs/lecture-notes-on-automata-languages-and-grammars-1907.127132019-08-01 https://scifaro.com/en/abs/monotonic-and-non-monotonic-solution-concepts-for-generalized-circuits-1907.128542019-07-31 https://scifaro.com/en/abs/optimal-separation-and-strong-direct-sum-for-randomized-query-complexity-1908.010202019-08-06 https://scifaro.com/en/abs/testing-convexity-of-functions-over-finite-domains-1908.025252019-08-08 https://scifaro.com/en/abs/graph-motif-problems-parameterized-by-dual-1908.038702019-08-13 https://scifaro.com/en/abs/on-simplified-np-complete-variants-of-not-all-equal-3-sat-and-3-sat-1908.041982019-08-27 https://scifaro.com/en/abs/cyclic-oritatami-systems-cannot-fold-infinite-fractal-curves-1908.044092019-08-14 https://scifaro.com/en/abs/proceedings-third-joint-workshop-on-developments-in-implicit-computational-complexity-and-foundational-practical-aspects-of-resource-analysis-1908.044782019-08-14 https://scifaro.com/en/abs/pointers-in-recursion-exploring-the-tropics-1908.049222019-08-15 https://scifaro.com/en/abs/type-two-iteration-with-bounded-query-revision-1908.049232019-08-15 https://scifaro.com/en/abs/placing-quantified-variants-of-3-sat-and-not-all-equal-3-sat-in-the-polynomial-hierarchy-1908.053612021-04-13 https://scifaro.com/en/abs/lasertank-is-np-complete-1908.059662020-04-21 https://scifaro.com/en/abs/average-case-lower-bounds-for-learning-sparse-mixtures-robust-estimation-and-semirandom-adversaries-1908.061302020-05-20 https://scifaro.com/en/abs/a-new-fast-computation-of-a-permanent-1908.063712020-08-10 https://scifaro.com/en/abs/safe-sets-in-digraphs-1908.066642019-08-20 https://scifaro.com/en/abs/decoding-downset-codes-over-a-finite-grid-1908.072152019-08-21 https://scifaro.com/en/abs/verification-of-flat-fifo-systems-1908.072822023-06-22 https://scifaro.com/en/abs/finding-hamiltonian-and-longest-s-t-paths-of-c-shaped-supergrid-graphs-in-linear-time-1908.074472019-08-21 https://scifaro.com/en/abs/on-explicit-branching-programs-for-the-rectangular-determinant-and-permanent-polynomials-1908.083472019-08-23 https://scifaro.com/en/abs/complexity-and-geometry-of-sampling-connected-graph-partitions-1908.088812022-02-09 https://scifaro.com/en/abs/red-blue-pebbling-revisited-near-optimal-parallel-matrix-matrix-multiplication-1908.096062019-12-16 https://scifaro.com/en/abs/hardness-amplification-of-optimization-problems-1908.102482019-08-28 https://scifaro.com/en/abs/logical-depth-for-reversible-turing-machines-with-an-application-to-the-rate-of-decrease-in-logical-depth-for-general-turing-machines-1908.108052019-08-29 https://scifaro.com/en/abs/the-tessellation-cover-number-of-good-tessellable-graphs-1908.108442019-08-29 https://scifaro.com/en/abs/computational-complexity-of-hedonic-games-on-sparse-graphs-1908.115542019-10-23 https://scifaro.com/en/abs/equivalences-between-triangle-and-range-query-problems-1908.118192020-04-10 https://scifaro.com/en/abs/agreement-testing-theorems-on-layered-set-systems-1909.006382019-09-04 https://scifaro.com/en/abs/parameterized-intractability-of-even-set-and-shortest-vector-problem-1909.019862019-09-06 https://scifaro.com/en/abs/mathrm-p-ne-mathrm-np-and-all-non-empty-sets-in-mathrm-np-cup-mathrm-conp-have-p-optimal-proof-systems-relative-to-an-oracle-1909.028392020-01-10 https://scifaro.com/en/abs/np-completeness-of-the-game-kingdomino-1909.028492020-04-01 https://scifaro.com/en/abs/tarski-s-theorem-supermodular-games-and-the-complexity-of-equilibria-1909.032102019-09-10 https://scifaro.com/en/abs/hard-properties-with-very-short-pcpps-and-their-applications-1909.032552019-11-18 https://scifaro.com/en/abs/the-cook-reckhow-definition-1909.036912023-05-31 https://scifaro.com/en/abs/2-local-hamiltonian-with-low-complexity-is-qcma-1909.037872019-09-10 https://scifaro.com/en/abs/rank-and-border-rank-of-kronecker-powers-of-tensors-and-strassen-s-laser-method-1909.047852021-12-28 https://scifaro.com/en/abs/algebraic-theory-of-promise-constraint-satisfaction-problems-first-steps-1909.048712019-09-12 https://scifaro.com/en/abs/promises-make-finite-constraint-satisfaction-problems-infinitary-1909.048782019-09-12 https://scifaro.com/en/abs/sublinear-time-language-recognition-and-decision-by-one-dimensional-cellular-automata-1909.058282020-06-11 https://scifaro.com/en/abs/tracking-down-the-bad-guys-reset-and-set-make-feasibility-for-flip-flop-net-derivatives-np-complete-1909.059682019-09-16 https://scifaro.com/en/abs/vanishing-error-approximate-degree-and-qma-complexity-1909.074982019-09-18 https://scifaro.com/en/abs/the-computational-complexity-of-fire-emblem-series-and-similar-tactical-role-playing-games-1909.078162019-09-26 https://scifaro.com/en/abs/a-polynomial-time-approximation-schema-for-maximum-k-vertex-cover-in-bipartite-graphs-1909.084352019-09-19 https://scifaro.com/en/abs/assignment-and-pricing-of-shared-rides-in-ride-sourcing-using-combinatorial-double-auctions-1909.086082020-05-01 https://scifaro.com/en/abs/chaitin-s-omega-and-an-algorithmic-phase-transition-1909.092312021-02-08 https://scifaro.com/en/abs/on-the-characterization-of-1-sided-error-strongly-testable-graph-properties-for-bounded-degree-graphs-including-an-appendix-1909.099842020-11-03 https://scifaro.com/en/abs/decision-list-compression-by-mild-random-restrictions-1909.106582020-02-19 https://scifaro.com/en/abs/on-communication-complexity-of-fixed-point-computation-1909.109582022-05-27 https://scifaro.com/en/abs/conditional-hardness-of-earth-mover-distance-1909.110682019-09-25 https://scifaro.com/en/abs/on-the-complexity-of-the-clone-membership-problem-1909.122112021-06-29 https://scifaro.com/en/abs/circuit-equivalence-in-2-nilpotent-algebras-1909.122562019-09-27 https://scifaro.com/en/abs/hamiltonicity-in-semi-regular-tessellation-dual-graphs-1909.137552019-10-01 https://scifaro.com/en/abs/complexity-of-stability-1910.003052020-12-15 https://scifaro.com/en/abs/the-complexity-of-packing-edge-disjoint-paths-1910.004402019-10-02 https://scifaro.com/en/abs/prime-clocks-1910.007772019-10-03 https://scifaro.com/en/abs/sublinear-algorithms-for-gap-edit-distance-1910.009012019-10-03 https://scifaro.com/en/abs/doubly-efficient-pseudo-deterministic-proofs-1910.009942020-04-28 https://scifaro.com/en/abs/lower-bounds-for-qbfs-of-bounded-treewidth-1910.010472020-07-06 https://scifaro.com/en/abs/subexponential-time-algorithms-for-finding-large-induced-sparse-subgraphs-1910.010822019-10-03 https://scifaro.com/en/abs/search-problems-in-algebraic-complexity-gct-and-hardness-of-generator-for-invariant-rings-1910.012512021-01-11 https://scifaro.com/en/abs/a-fast-exponential-time-algorithm-for-max-hamming-distance-x3sat-1910.012932019-10-04 https://scifaro.com/en/abs/optimal-joint-subcarrier-and-power-allocation-in-noma-is-strongly-np-hard-1910.013312019-10-04 https://scifaro.com/en/abs/recognizing-the-tractability-in-big-data-computing-1910.013572019-12-06 https://scifaro.com/en/abs/on-partisan-bias-in-redistricting-computational-complexity-meets-the-science-of-gerrymandering-1910.015652020-08-05 https://scifaro.com/en/abs/on-the-probabilistic-degrees-of-symmetric-boolean-functions-1910.024652019-10-08 https://scifaro.com/en/abs/non-signaling-proofs-with-o-sqrt-log-n-provers-are-in-pspace-1910.025902020-04-21 https://scifaro.com/en/abs/hardness-of-minimum-barrier-shrinkage-and-minimum-installation-path-1910.042282020-08-20 https://scifaro.com/en/abs/improved-in-approximability-bounds-for-d-scattered-set-1910.055892019-10-15 https://scifaro.com/en/abs/graph-clustering-in-all-parameter-regimes-1910.064352019-10-16 https://scifaro.com/en/abs/proof-complexity-of-systems-of-non-deterministic-decision-trees-and-branching-programs-1910.085032019-10-21 https://scifaro.com/en/abs/cluster-editing-parameterized-above-modification-disjoint-p-3-packings-1910.085172023-10-27 https://scifaro.com/en/abs/mathrm-p-optimal-proof-systems-for-each-mathrm-conp-complete-set-and-no-complete-problems-in-mathrm-np-cap-mathrm-conp-relative-to-an-oracle-1910.085712020-01-10 https://scifaro.com/en/abs/the-exact-complexity-of-the-tutte-polynomial-1910.089152019-10-22 https://scifaro.com/en/abs/the-distribution-function-of-the-longest-path-length-in-constant-treewidth-dags-with-random-edge-length-1910.097912022-03-29 https://scifaro.com/en/abs/necessary-and-sufficient-conditions-for-boolean-satisfiability-1910.107082023-11-07 https://scifaro.com/en/abs/on-the-complexity-of-asynchronous-freezing-cellular-automata-1910.108822019-10-25 https://scifaro.com/en/abs/on-the-weisfeiler-leman-dimension-of-fractional-packing-1910.113252020-06-08 https://scifaro.com/en/abs/tight-running-time-lower-bounds-for-strong-inapproximability-of-maximum-k-coverage-unique-set-cover-and-related-problems-via-t-wise-agreement-testing-theorem-1910.118502019-10-28 https://scifaro.com/en/abs/equivalence-of-systematic-linear-data-structures-and-matrix-rigidity-1910.119212019-10-29 https://scifaro.com/en/abs/on-the-hardness-of-energy-minimisation-for-crystal-structure-prediction-1910.120262023-06-22 https://scifaro.com/en/abs/on-the-parameterized-complexity-of-sparsest-cut-and-small-set-expansion-problems-1910.123532023-04-04 https://scifaro.com/en/abs/on-the-degree-of-boolean-functions-as-polynomials-over-mathbb-z-m-1910.124582020-05-04 https://scifaro.com/en/abs/the-multi-level-bottleneck-assignment-problem-complexity-and-solution-methods-1910.125042019-10-29 https://scifaro.com/en/abs/kruskal-katona-for-convex-sets-with-applications-1911.001782019-11-04 https://scifaro.com/en/abs/two-machine-routing-open-shop-on-a-tree-instance-reduction-and-efficiently-solvable-subclass-1911.002362020-04-09 https://scifaro.com/en/abs/a-solution-of-the-p-versus-np-problem-based-on-specific-property-of-clique-function-1911.007222020-06-29 https://scifaro.com/en/abs/testing-noisy-linear-functions-for-sparsity-1911.009112019-11-05 https://scifaro.com/en/abs/bare-quantum-simultaneity-versus-classical-interactivity-in-communication-complexity-1911.013812022-04-05 https://scifaro.com/en/abs/lifting-sum-of-squares-lower-bounds-degree-2-to-degree-4-1911.014112019-11-05 https://scifaro.com/en/abs/fine-grained-hardness-of-cvp-p-everything-that-we-can-prove-and-nothing-else-1911.024402021-08-10 https://scifaro.com/en/abs/variety-membership-testing-algebraic-natural-proofs-and-geometric-complexity-theory-1911.025342019-11-07 https://scifaro.com/en/abs/extended-formulation-lower-bounds-for-refuting-random-csps-1911.029112019-11-11 https://scifaro.com/en/abs/the-complexity-of-verifying-loop-free-programs-as-differentially-private-1911.032722020-06-30 https://scifaro.com/en/abs/quantum-speedups-need-structure-1911.037482019-12-03 https://scifaro.com/en/abs/universal-communication-universal-graphs-and-graph-labeling-1911.037572019-11-12 https://scifaro.com/en/abs/implementing-geometric-complexity-theory-on-the-separation-of-orbit-closures-via-symmetries-1911.039902019-11-12 https://scifaro.com/en/abs/the-complexity-of-synthesizing-nop-equipped-boolean-nets-from-g-bounded-inputs-technical-report-1911.058342019-11-15 https://scifaro.com/en/abs/hardness-of-learning-dnfs-using-halfspaces-1911.063582019-11-18 https://scifaro.com/en/abs/automated-derivation-of-parametric-data-movement-lower-bounds-for-affine-programs-1911.066642019-11-18 https://scifaro.com/en/abs/semi-algebraic-proofs-ips-lower-bounds-and-the-tau-conjecture-can-a-natural-number-be-negative-1911.067382019-11-18 https://scifaro.com/en/abs/time-inconsistent-planning-simple-motivation-is-hard-to-find-1911.075362019-11-19 https://scifaro.com/en/abs/on-the-complexity-of-2-player-packing-games-1911.077932019-11-19 https://scifaro.com/en/abs/beyond-natural-proofs-hardness-magnification-and-locality-1911.082972019-11-20 https://scifaro.com/en/abs/node-max-cut-and-computing-equilibria-in-linear-weighted-congestion-games-1911.087042020-02-25 https://scifaro.com/en/abs/a-2-approximation-for-the-k-prize-collecting-steiner-tree-problem-1911.092212019-11-22 https://scifaro.com/en/abs/parameterized-complexity-of-stable-roommates-with-ties-and-incomplete-lists-through-the-lens-of-graph-parameters-1911.093792021-03-09 https://scifaro.com/en/abs/combinatorial-lower-bounds-for-3-query-ldcs-1911.106982019-12-03 https://scifaro.com/en/abs/near-optimal-algorithm-for-distribution-free-junta-testing-1911.108332023-01-27 https://scifaro.com/en/abs/pseudo-deterministic-streaming-1911.113682019-11-27 https://scifaro.com/en/abs/a-note-on-computational-complexity-of-kill-all-go-1911.114052019-11-27 https://scifaro.com/en/abs/a-quadratic-lower-bound-for-algebraic-branching-programs-and-formulas-1911.117932020-03-19 https://scifaro.com/en/abs/an-adaptive-algorithm-for-quantum-circuit-simulation-1911.122422020-05-06 https://scifaro.com/en/abs/schur-polynomials-do-not-have-small-formulas-if-the-determinant-doesn-t-1911.125202019-12-02 https://scifaro.com/en/abs/hybrid-decision-trees-longer-quantum-time-is-strictly-more-powerful-1911.130912019-12-02 https://scifaro.com/en/abs/proper-hierarchies-in-polylogarithmic-time-and-absence-of-complete-problems-1911.131042019-12-02 https://scifaro.com/en/abs/inapproximability-of-additive-weak-contraction-under-sseh-and-strong-ugc-1912.001432019-12-03 https://scifaro.com/en/abs/who-asked-us-how-the-theory-of-computing-answers-questions-about-analysis-1912.002842019-12-03 https://scifaro.com/en/abs/exponential-resolution-lower-bounds-for-weak-pigeonhole-principle-and-perfect-matching-formulas-over-sparse-graphs-1912.005342025-04-02 https://scifaro.com/en/abs/windable-heads-recognizing-nl-with-constant-randomness-1912.013822022-06-03 https://scifaro.com/en/abs/on-the-relation-between-structured-d-dnnfs-and-sdds-1912.014302020-01-08 https://scifaro.com/en/abs/derandomization-and-absolute-reconstruction-for-sums-of-powers-of-linear-forms-1912.020212021-07-15 https://scifaro.com/en/abs/constructive-derandomization-of-query-algorithms-1912.030422019-12-09 https://scifaro.com/en/abs/dominating-sets-reconfiguration-under-token-sliding-1912.031272021-05-21 https://scifaro.com/en/abs/the-classes-ppa-k-existence-from-arguments-modulo-k-1912.037292022-03-22 https://scifaro.com/en/abs/multistage-graph-problems-on-a-global-budget-1912.043922020-07-30 https://scifaro.com/en/abs/on-the-complexity-of-modulo-q-arguments-and-the-chevalley-warning-theorem-1912.044672020-07-07 https://scifaro.com/en/abs/high-precision-estimation-of-random-walks-in-small-space-1912.045242022-03-14 https://scifaro.com/en/abs/the-power-of-programs-over-monoids-in-j-and-threshold-dot-depth-one-languages-1912.079922021-03-17 https://scifaro.com/en/abs/monotone-3-sat-2-2-is-np-complete-1912.080322019-12-18 https://scifaro.com/en/abs/on-the-i-o-complexity-of-hybrid-algorithms-for-integer-multiplication-1912.080452020-07-20 https://scifaro.com/en/abs/dynamic-toolbox-for-etrinv-1912.086742019-12-19 https://scifaro.com/en/abs/hyperpfaffians-and-geometric-complexity-theory-1912.093892020-02-26 https://scifaro.com/en/abs/the-abc-problem-and-equator-sampling-renyi-divergences-1912.112752019-12-25 https://scifaro.com/en/abs/towards-finding-hay-in-a-haystack-explicit-tensors-of-border-rank-greater-than-2-02m-in-c-m-otimes-c-m-otimes-c-m-1912.119272019-12-30 https://scifaro.com/en/abs/approximate-knapsack-computations-to-count-semi-fair-allocations-1912.124302020-01-01 https://scifaro.com/en/abs/coarse-grained-complexity-for-dynamic-algorithms-2001.003362023-07-27 https://scifaro.com/en/abs/algorithmic-number-on-the-forehead-protocols-yielding-dense-ruzsa-szemer-e-di-graphs-and-hypergraphs-2001.003872020-01-03 https://scifaro.com/en/abs/hard-3-cnf-sat-problems-are-in-p-a-first-step-in-proving-np-p-2001.007602020-01-06 https://scifaro.com/en/abs/counting-maximum-matchings-in-planar-graphs-is-hard-2001.014932021-03-09 https://scifaro.com/en/abs/lifting-with-simple-gadgets-and-applications-to-circuit-and-proof-complexity-2001.021442020-01-08 https://scifaro.com/en/abs/nullstellensatz-size-degree-trade-offs-from-reversible-pebbling-2001.024812020-01-09 https://scifaro.com/en/abs/grundy-coloring-friends-half-graphs-bicliques-2001.037942020-01-14 https://scifaro.com/en/abs/an-improvement-of-the-upper-bound-for-gks-communication-game-2001.039242020-01-14 https://scifaro.com/en/abs/computational-hardness-of-multidimensional-subtraction-games-2001.039622020-01-14 https://scifaro.com/en/abs/np-complete-variants-of-some-classical-graph-problems-2001.041202020-01-14 https://scifaro.com/en/abs/structural-decompositions-of-epistemic-logic-programs-2001.042192020-01-14 https://scifaro.com/en/abs/simpler-partial-derandomization-of-ppsz-for-k-sat-2001.065362020-01-22 https://scifaro.com/en/abs/lower-bounds-against-sparse-symmetric-functions-of-acc-circuits-expanding-the-reach-of-sat-algorithms-2001.077882020-01-23 https://scifaro.com/en/abs/iterated-type-partitions-2001.081222020-02-03 https://scifaro.com/en/abs/on-the-computational-power-and-complexity-of-spiking-neural-networks-2001.084392020-01-24 https://scifaro.com/en/abs/on-simulation-in-automata-networks-2001.091982020-04-28 https://scifaro.com/en/abs/the-complexity-of-contracting-planar-tensor-network-2001.102042023-07-06 https://scifaro.com/en/abs/extending-chaitin-s-incompleteness-theorem-2001.109192023-06-06 https://scifaro.com/en/abs/the-lagrangian-remainder-of-taylor-s-series-distinguishes-mathcal-o-f-x-time-complexities-to-polynomials-or-not-2001.118112020-05-28 https://scifaro.com/en/abs/probabilistic-complexity-classes-through-semantics-2002.000092020-02-04 https://scifaro.com/en/abs/graphs-cannot-be-indexed-in-polynomial-time-for-sub-quadratic-time-string-matching-unless-seth-fails-2002.006292020-03-05 https://scifaro.com/en/abs/the-computational-complexity-of-plethysm-coefficients-2002.007882020-02-04 https://scifaro.com/en/abs/a-double-exponential-lower-bound-for-the-distinct-vectors-problem-2002.012932023-06-22 https://scifaro.com/en/abs/on-delta-modular-integer-linear-problems-in-the-canonical-form-and-equivalent-problems-2002.013072022-11-30 https://scifaro.com/en/abs/complexity-limitations-on-one-turn-quantum-refereed-games-2002.015092020-02-06 https://scifaro.com/en/abs/a-dichotomy-for-bounded-degree-graph-homomorphisms-with-nonnegative-weights-2002.020212020-02-07 https://scifaro.com/en/abs/on-list-k-coloring-convex-bipartite-graphs-2002.027292020-02-10 https://scifaro.com/en/abs/on-unbalanced-optimal-transport-an-analysis-of-sinkhorn-algorithm-2002.032932020-11-20 https://scifaro.com/en/abs/optimal-polynomial-time-compression-for-boolean-max-csp-2002.034432020-02-11 https://scifaro.com/en/abs/edge-matching-with-inequalities-triangles-unknown-shape-and-two-players-2002.038872020-06-04 https://scifaro.com/en/abs/the-program-size-complexity-of-self-assembled-paths-2002.040122020-02-11 https://scifaro.com/en/abs/local-wl-invariance-and-hidden-shades-of-regularity-2002.045902020-05-20 https://scifaro.com/en/abs/fixed-support-wasserstein-barycenters-computational-hardness-and-fast-algorithm-2002.047832022-06-07 https://scifaro.com/en/abs/optimal-label-splitting-for-embedding-an-lts-into-an-arbitrary-petri-net-reachability-graph-is-np-complete-2002.048412020-02-20 https://scifaro.com/en/abs/complexity-analysis-of-generalized-and-fractional-hypertree-decompositions-2002.052392021-11-22 https://scifaro.com/en/abs/symmetric-arithmetic-circuits-2002.064512024-01-22 https://scifaro.com/en/abs/optimal-error-pseudodistributions-for-read-once-branching-programs-2002.072082020-06-02 https://scifaro.com/en/abs/time-space-tradeoffs-for-distinguishing-distributions-and-applications-to-security-of-goldreich-s-prg-2002.072352020-02-19 https://scifaro.com/en/abs/multiparty-karchmer-wigderson-games-and-threshold-circuits-2002.074442020-02-19 https://scifaro.com/en/abs/multistage-s-t-path-confronting-similarity-with-dissimilarity-2002.075692020-07-02 https://scifaro.com/en/abs/block-structured-integer-and-linear-programming-in-strongly-polynomial-and-near-linear-time-2002.077452020-08-04 https://scifaro.com/en/abs/a-note-on-the-explicit-constructions-of-tree-codes-over-polylogarithmic-sized-alphabet-2002.082312020-02-20 https://scifaro.com/en/abs/algorithms-and-lower-bounds-for-de-morgan-formulas-of-low-communication-leaf-gates-2002.085332020-02-21 https://scifaro.com/en/abs/the-generalized-orthogonality-dimension-of-generalized-kneser-graphs-bounds-and-applications-2002.085802021-05-04 https://scifaro.com/en/abs/intermediate-problems-in-modular-circuits-satisfiability-2002.086262020-06-01 https://scifaro.com/en/abs/even-faster-algorithms-for-csat-over-supernilpotent-algebras-2002.086342020-02-21 https://scifaro.com/en/abs/geometric-rank-of-tensors-and-subrank-of-matrix-multiplication-2002.094722023-04-27 https://scifaro.com/en/abs/hyperbolic-minesweeper-is-in-p-2002.095342023-08-02 https://scifaro.com/en/abs/hardness-of-equations-over-finite-solvable-groups-under-the-exponential-time-hypothesis-2002.101452020-10-27 https://scifaro.com/en/abs/the-power-of-many-samples-in-query-complexity-2002.106542020-02-26 https://scifaro.com/en/abs/a-new-minimax-theorem-for-randomized-algorithms-2002.108022020-09-21 https://scifaro.com/en/abs/a-tight-composition-theorem-for-the-randomized-query-complexity-of-partial-functions-2002.108092020-12-08 https://scifaro.com/en/abs/lower-bounds-for-algebraic-machines-semantically-2002.108882021-02-05 https://scifaro.com/en/abs/consensus-halving-does-it-ever-get-easier-2002.114372023-04-26 https://scifaro.com/en/abs/on-the-complexity-of-evaluating-highest-weight-vectors-2002.115942021-02-16 https://scifaro.com/en/abs/two-player-hidden-pointer-chasing-and-multi-pass-lower-bounds-in-turnstile-streams-2002.128562020-04-22 https://scifaro.com/en/abs/three-dimensional-matching-is-np-hard-2003.003362020-03-03 https://scifaro.com/en/abs/hardness-of-sparse-sets-and-minimal-circuit-size-problem-2003.006692020-07-14 https://scifaro.com/en/abs/direct-product-primality-testing-of-graphs-is-gi-hard-2003.015912025-11-06 https://scifaro.com/en/abs/towards-a-complexity-theoretic-understanding-of-restarts-in-sat-solvers-2003.023232020-05-12 https://scifaro.com/en/abs/characterizations-and-approximability-of-hard-counting-classes-below-p-2003.025242020-06-02 https://scifaro.com/en/abs/barriers-for-rectangular-matrix-multiplication-2003.030192025-11-10 https://scifaro.com/en/abs/the-fine-grained-complexity-of-computing-the-tutte-polynomial-of-a-linear-matroid-2003.035952020-07-29 https://scifaro.com/en/abs/algebraic-branching-programs-border-complexity-and-tangent-spaces-2003.048342020-03-11 https://scifaro.com/en/abs/a-generalized-sylvester-gallai-type-theorem-for-quadratic-polynomials-2003.051522020-03-12 https://scifaro.com/en/abs/on-function-description-2003.052692020-03-12 https://scifaro.com/en/abs/lambda-infty-maximum-variance-embedding-measuring-and-optimizing-connectivity-of-a-graph-metric-2003.055822022-07-04 https://scifaro.com/en/abs/new-exponential-size-lower-bounds-against-depth-four-circuits-of-bounded-individual-degree-2003.058742021-07-21 https://scifaro.com/en/abs/space-hardness-of-solving-structured-linear-systems-2003.069932020-03-17 https://scifaro.com/en/abs/on-the-parameterized-complexity-of-2-partitions-2003.071902020-03-17 https://scifaro.com/en/abs/sandwiches-for-promise-constraint-satisfaction-2003.074872020-03-18 https://scifaro.com/en/abs/hardness-of-bounded-distance-decoding-on-lattices-in-ell-p-norms-2003.079032020-03-19 https://scifaro.com/en/abs/tatamibari-is-np-complete-2003.083312020-05-11 https://scifaro.com/en/abs/a-proof-of-p-neq-np-2003.097912021-10-15 https://scifaro.com/en/abs/lower-bounds-on-the-running-time-of-two-way-quantum-finite-automata-and-sublogarithmic-space-quantum-turing-machines-2003.098772021-01-06 https://scifaro.com/en/abs/the-power-of-a-single-qubit-two-way-quantum-finite-automata-and-the-word-problem-2003.098792020-04-29 https://scifaro.com/en/abs/1-x-1-rush-hour-with-fixed-blocks-is-pspace-complete-2003.099142020-05-05 https://scifaro.com/en/abs/the-computational-complexity-of-evil-hangman-2003.100002020-05-05 https://scifaro.com/en/abs/failure-of-feasible-disjunction-property-for-k-dnf-resolution-and-np-hardness-of-automating-it-2003.102302020-03-24 https://scifaro.com/en/abs/topology-and-adjunction-in-promise-constraint-satisfaction-2003.113512023-02-15 https://scifaro.com/en/abs/no-rainbow-problem-and-the-surjective-constraint-satisfaction-problem-2003.117642021-04-30 https://scifaro.com/en/abs/a-topological-characterization-of-modulo-p-arguments-and-implications-for-necklace-splitting-2003.119742021-01-20 https://scifaro.com/en/abs/a-polynomial-degree-bound-on-equations-of-non-rigid-matrices-and-small-linear-circuits-2003.129382020-11-06 https://scifaro.com/en/abs/two-combinatorial-ma-complete-problems-2003.130652021-01-07 https://scifaro.com/en/abs/a-faster-algorithm-for-the-fssp-in-one-dimensional-ca-with-multiple-speeds-2003.135582020-03-31 https://scifaro.com/en/abs/the-cardinality-of-extended-solution-set-criterion-for-establishing-the-intractability-of-np-problems-2004.014912020-04-06 https://scifaro.com/en/abs/the-tandem-duplication-distance-problem-is-hard-over-bounded-alphabets-2004.023382021-03-16 https://scifaro.com/en/abs/from-holant-to-quantum-entanglement-and-back-2004.057062020-04-14 https://scifaro.com/en/abs/lecture-note-on-lcssx-s-lower-bounds-for-non-adaptive-distribution-free-property-testing-2004.059222020-04-14 https://scifaro.com/en/abs/tensor-network-rewriting-strategies-for-satisfiability-and-counting-2004.064552021-09-07 https://scifaro.com/en/abs/counting-small-induced-subgraphs-satisfying-monotone-properties-2004.065952021-05-14 https://scifaro.com/en/abs/dichotomy-for-graph-homomorphisms-with-complex-values-on-bounded-degree-graphs-2004.066202020-04-15 https://scifaro.com/en/abs/learning-sums-of-powers-of-low-degree-polynomials-in-the-non-degenerate-case-2004.068982020-06-17 https://scifaro.com/en/abs/the-impact-of-heterogeneity-and-geometry-on-the-proof-complexity-of-random-satisfiability-2004.073192021-11-24 https://scifaro.com/en/abs/extending-the-reach-of-the-point-to-set-principle-2004.077982021-02-16 https://scifaro.com/en/abs/automating-cutting-planes-is-np-hard-2004.080372020-04-20 https://scifaro.com/en/abs/on-regularity-of-max-csps-and-min-csps-2004.083742020-04-20 https://scifaro.com/en/abs/counterexamples-to-the-low-degree-conjecture-2004.084542020-04-21 https://scifaro.com/en/abs/fewer-colors-for-perfect-simulation-of-proper-colorings-2004.087162020-06-11 https://scifaro.com/en/abs/the-complexity-of-approximating-averages-on-bounded-degree-graphs-2004.092382021-07-20 https://scifaro.com/en/abs/commutative-automata-networks-2004.098062020-04-22 https://scifaro.com/en/abs/on-the-parameterised-complexity-of-induced-multipartite-graph-parameters-2004.099382023-05-05 https://scifaro.com/en/abs/frechet-like-distances-between-two-merge-trees-2004.107472020-04-23 https://scifaro.com/en/abs/some-results-on-vertex-separator-reconfiguration-2004.108732020-04-24 https://scifaro.com/en/abs/robust-testing-of-low-dimensional-functions-2004.116422021-01-14 https://scifaro.com/en/abs/optimal-streaming-approximations-for-all-boolean-max-2csps-and-max-ksat-2004.117962021-01-13 https://scifaro.com/en/abs/finding-planted-cliques-in-sublinear-time-2004.120022022-10-18 https://scifaro.com/en/abs/hardness-of-random-optimization-problems-for-boolean-circuits-low-degree-polynomials-and-langevin-dynamics-2004.120632022-01-27 https://scifaro.com/en/abs/tree-depth-and-the-formula-complexity-of-subgraph-isomorphism-2004.133022020-04-29 https://scifaro.com/en/abs/on-the-existence-of-algebraic-natural-proofs-2004.141472025-02-04 https://scifaro.com/en/abs/strong-subalgebras-and-the-constraint-satisfaction-problem-2005.005932020-05-05 https://scifaro.com/en/abs/on-p-versus-np-2005.008092026-05-14 https://scifaro.com/en/abs/locally-testable-codes-via-high-dimensional-expanders-2005.010452020-05-05 https://scifaro.com/en/abs/the-complexity-of-approximating-the-complex-valued-potts-model-2005.010762021-11-19 https://scifaro.com/en/abs/a-class-of-examples-demonstrating-that-p-is-different-from-np-in-the-p-vs-np-problem-2005.014122020-05-05 https://scifaro.com/en/abs/envy-free-cake-cutting-a-polynomial-number-of-queries-with-high-probability-2005.019822021-08-25 https://scifaro.com/en/abs/lower-bounds-for-semi-adaptive-data-structures-via-corruption-2005.022382020-10-05 https://scifaro.com/en/abs/when-votes-change-and-committees-should-not-2005.023002024-01-22 https://scifaro.com/en/abs/rigid-matrices-from-rectangular-pcps-2005.031232022-11-24 https://scifaro.com/en/abs/trains-games-and-complexity-0-1-2-player-motion-planning-through-input-output-gadgets-2005.031922023-11-16 https://scifaro.com/en/abs/critique-of-boyu-sima-s-proof-that-rm-p-neq-rm-np-2005.032562020-05-08 https://scifaro.com/en/abs/communication-memento-memoryless-communication-complexity-2005.040682020-09-10 https://scifaro.com/en/abs/time-complexity-of-in-memory-solution-of-linear-systems-2005.045302020-05-12 https://scifaro.com/en/abs/in-memory-eigenvector-computation-in-time-o-1-2005.045312020-05-12 https://scifaro.com/en/abs/insignificant-choice-polynomial-time-a-logic-capturing-ptime-2005.045982025-01-14 https://scifaro.com/en/abs/a-logical-characterization-of-constant-depth-circuits-over-the-reals-2005.049162023-03-16 https://scifaro.com/en/abs/approximating-boolean-functions-with-disjunctive-normal-form-2005.057732020-05-13 https://scifaro.com/en/abs/time-space-optimal-algorithm-for-computing-separators-in-bounded-genus-graphs-2005.064192020-05-14 https://scifaro.com/en/abs/fundamentals-of-computing-2005.064362020-09-30 https://scifaro.com/en/abs/a-dichotomy-for-real-boolean-holant-problems-2005.079062020-05-19 https://scifaro.com/en/abs/reducibility-and-statistical-computational-gaps-from-secret-leakage-2005.080992020-06-30 https://scifaro.com/en/abs/on-the-hardness-of-red-blue-pebble-games-2005.086092020-05-19 https://scifaro.com/en/abs/continuous-lwe-2005.095952020-10-27 https://scifaro.com/en/abs/a-unifying-model-for-locally-constrained-spanning-tree-problems-2005.103282020-05-22 https://scifaro.com/en/abs/hardness-of-modern-games-2005.105062020-05-22 https://scifaro.com/en/abs/distributed-verifiers-in-pcp-2005.107492020-05-22 https://scifaro.com/en/abs/algebraic-hardness-versus-randomness-in-low-characteristic-2005.108852021-12-02 https://scifaro.com/en/abs/algebraic-global-gadgetry-for-surjective-constraint-satisfaction-2005.113072024-04-24 https://scifaro.com/en/abs/finding-small-satisfying-assignments-faster-than-brute-force-a-fine-grained-perspective-into-boolean-constraint-satisfaction-2005.115412020-05-26 https://scifaro.com/en/abs/maxsat-resolution-and-subcube-sums-2005.115892023-04-13 https://scifaro.com/en/abs/a-note-on-the-concrete-hardness-of-the-shortest-independent-vectors-problem-in-lattices-2005.116542020-11-03 https://scifaro.com/en/abs/from-finite-valued-nondeterministic-transducers-to-deterministic-two-tape-automata-2005.137102021-05-03 https://scifaro.com/en/abs/liar-s-domination-in-unit-disk-graphs-2005.139132020-05-29 https://scifaro.com/en/abs/complexity-of-maximum-cut-on-interval-graphs-2006.000612021-04-01 https://scifaro.com/en/abs/walking-through-doors-is-hard-even-without-staircases-universality-and-pspace-hardness-of-planar-door-gadgets-2006.012562026-03-17 https://scifaro.com/en/abs/on-tensor-rank-and-commuting-matrices-2006.023742020-07-07 https://scifaro.com/en/abs/eliminating-intermediate-measurements-in-space-bounded-quantum-computation-2006.035302021-03-05 https://scifaro.com/en/abs/on-the-complexity-of-branching-proofs-2006.041242020-06-09 https://scifaro.com/en/abs/pspace-completeness-of-pulling-blocks-to-reach-a-goal-2006.043372023-11-16 https://scifaro.com/en/abs/an-optimal-tester-for-k-linear-2006.044092020-06-09 https://scifaro.com/en/abs/quantum-logspace-algorithm-for-powering-matrices-with-bounded-norm-2006.048802021-05-10 https://scifaro.com/en/abs/special-case-algorithms-for-blackbox-radical-membership-nullstellensatz-and-transcendence-degree-2006.076132020-06-16 https://scifaro.com/en/abs/polynomial-time-deterministic-identity-testingalgorithm-for-sigma-3-pi-sigma-pi-2-circuits-via-edelstein-kelly-type-theorem-for-quadratic-polynomials-2006.082632020-06-16 https://scifaro.com/en/abs/the-pspace-hardness-of-understanding-neural-circuits-2006.082662020-06-24 https://scifaro.com/en/abs/randomized-polynomial-time-equivalence-between-determinant-and-trace-imm-equivalence-tests-2006.082722020-06-16 https://scifaro.com/en/abs/algorithmically-optimal-outer-measures-2006.084682025-01-08 https://scifaro.com/en/abs/playing-unique-games-on-certified-small-set-expanders-2006.099692021-06-29 https://scifaro.com/en/abs/parameterized-inapproximability-of-independent-set-in-h-free-graphs-2006.104442022-12-16 https://scifaro.com/en/abs/on-the-complexity-of-detecting-hazards-2006.105922020-06-19 https://scifaro.com/en/abs/when-is-amplification-necessary-for-composition-in-randomized-query-complexity-2006.109572020-06-22 https://scifaro.com/en/abs/full-complexity-classification-of-the-list-homomorphism-problem-for-bounded-treewidth-graphs-2006.111552020-09-23 https://scifaro.com/en/abs/constant-space-constant-randomness-verifiers-with-arbitrarily-small-error-2006.123302026-04-21 https://scifaro.com/en/abs/reduction-from-non-unique-games-to-boolean-unique-games-2006.130732021-07-09 https://scifaro.com/en/abs/hardness-of-approximation-of-multi-lcs-over-small-alphabet-2006.134492020-06-25 https://scifaro.com/en/abs/disjointness-through-the-lens-of-vapnik-chervonenkis-dimension-sparsity-and-beyond-2006.137122020-06-25 https://scifaro.com/en/abs/apx-hardness-and-approximation-for-the-k-burning-number-problem-2006.147332021-01-19 https://scifaro.com/en/abs/lee-yang-zeros-and-the-complexity-of-the-ferromagnetic-ising-model-on-bounded-degree-graphs-2006.148282021-01-25 https://scifaro.com/en/abs/quantum-communication-complexity-of-distribution-testing-2006.148702023-12-29 https://scifaro.com/en/abs/ideal-membership-problem-for-boolean-minority-2006.164222020-07-02 https://scifaro.com/en/abs/counting-homomorphisms-to-k-4-minor-free-graphs-modulo-2-2006.166322022-07-04 https://scifaro.com/en/abs/complexity-of-modification-problems-for-best-match-graphs-2006.169092020-12-04 https://scifaro.com/en/abs/efficient-document-exchange-and-error-correcting-codes-with-asymmetric-information-2007.008702020-11-17 https://scifaro.com/en/abs/on-girth-and-the-parameterized-complexity-of-token-sliding-and-token-jumping-2007.016732025-01-15 https://scifaro.com/en/abs/the-combined-basic-lp-and-affine-ip-relaxation-for-promise-vcsps-on-infinite-domains-2007.017792021-07-20 https://scifaro.com/en/abs/complexity-of-the-multilevel-critical-node-problem-2007.023702020-10-05 https://scifaro.com/en/abs/a-stochastic-calculus-approach-to-the-oracle-separation-of-bqp-and-ph-2007.024312020-07-07 https://scifaro.com/en/abs/computational-complexity-characterization-of-protecting-elections-from-bribery-2007.025332020-07-07 https://scifaro.com/en/abs/krw-composition-theorems-via-lifting-2007.027402025-05-08 https://scifaro.com/en/abs/lower-bounds-for-xor-of-forrelations-2007.036312020-07-08 https://scifaro.com/en/abs/a-strong-xor-lemma-for-randomized-query-complexity-2007.055802020-07-21 https://scifaro.com/en/abs/lower-bounds-of-algebraic-branching-programs-and-layerization-2007.068192020-09-18 https://scifaro.com/en/abs/observations-on-symmetric-circuits-2007.074962020-09-24 https://scifaro.com/en/abs/improved-extractors-for-small-space-sources-2007.077722021-08-25 https://scifaro.com/en/abs/maximizing-coverage-while-ensuring-fairness-a-tale-of-conflicting-objective-2007.080692023-05-02 https://scifaro.com/en/abs/parameterized-complexity-of-scheduling-chains-of-jobs-with-delays-2007.090232020-07-20 https://scifaro.com/en/abs/integer-factorization-and-riemann-s-hypothesis-why-two-item-joint-replenishment-is-hard-2007.090452020-07-20 https://scifaro.com/en/abs/a-dichotomy-theorem-for-nonuniform-csps-simplified-2007.090992020-07-20 https://scifaro.com/en/abs/monochromatic-triangles-triangle-listing-and-apsp-2007.093182020-07-29 https://scifaro.com/en/abs/partial-boolean-functions-with-exact-quantum-1-query-complexity-2007.109242021-02-24 https://scifaro.com/en/abs/lower-bounds-and-hardness-magnification-for-sublinear-time-shrinking-cellular-automata-2007.120482021-04-05 https://scifaro.com/en/abs/on-the-parameterized-complexity-of-synthesizing-boolean-petri-nets-with-restricted-dependency-technical-report-2007.123722020-07-29 https://scifaro.com/en/abs/cyclotomic-identity-testing-and-applications-2007.131792021-05-05 https://scifaro.com/en/abs/semantic-width-and-the-fixed-parameter-tractability-of-constraint-satisfaction-problems-2007.141692020-07-29 https://scifaro.com/en/abs/algorithmic-fractal-dimensions-in-geometric-measure-theory-2007.143462020-07-29 https://scifaro.com/en/abs/on-parity-decision-trees-for-fourier-sparse-boolean-functions-2008.002662020-08-04 https://scifaro.com/en/abs/the-amazing-power-of-randomness-np-rp-2008.006012020-08-06 https://scifaro.com/en/abs/fractional-pseudorandom-generators-from-any-fourier-level-2008.013162020-11-10 https://scifaro.com/en/abs/fine-grained-complexity-of-regular-expression-pattern-matching-and-membership-2008.027692020-09-22 https://scifaro.com/en/abs/cons-free-programs-and-complexity-classes-between-logspace-and-ptime-2008.029322020-08-10 https://scifaro.com/en/abs/hierarchical-clusterings-of-unweighted-graphs-2008.030612020-08-10 https://scifaro.com/en/abs/a-parallel-repetition-theorem-for-the-ghz-game-2008.050592020-08-13 https://scifaro.com/en/abs/some-preliminary-result-about-the-inset-edge-and-average-distance-of-trees-2008.056772020-08-14 https://scifaro.com/en/abs/dynamic-complexity-of-expansion-2008.057282020-08-14 https://scifaro.com/en/abs/new-techniques-for-proving-fine-grained-average-case-hardness-2008.065912020-08-18 https://scifaro.com/en/abs/on-partial-differential-encodings-of-boolean-functions-2008.068012022-12-02 https://scifaro.com/en/abs/superlinear-lower-bounds-based-on-eth-2008.068052022-05-18 https://scifaro.com/en/abs/w-1-hardness-of-the-k-center-problem-parameterized-by-the-skeleton-dimension-2008.072522020-08-18 https://scifaro.com/en/abs/parallel-repetition-with-a-threshold-in-quantum-interactive-proofs-2008.074452020-08-18 https://scifaro.com/en/abs/a-unified-algorithm-for-colouring-graphs-of-bounded-clique-width-2008.074682021-08-13 https://scifaro.com/en/abs/the-quantum-supremacy-tsirelson-inequality-2008.087212021-10-13 https://scifaro.com/en/abs/a-direct-product-theorem-for-one-way-quantum-communication-2008.089632020-08-21 https://scifaro.com/en/abs/on-fine-grained-exact-computation-in-regular-graphs-2008.090082021-03-25 https://scifaro.com/en/abs/an-optimal-separation-of-randomized-and-quantum-query-complexity-2008.102232023-01-31 https://scifaro.com/en/abs/simple-reductions-from-formula-sat-to-pattern-matching-on-labeled-graphs-and-subtree-isomorphism-2008.117862020-08-31 https://scifaro.com/en/abs/spectral-planting-and-the-hardness-of-refuting-cuts-colorability-and-communities-in-random-graphs-2008.122372020-08-28 https://scifaro.com/en/abs/is-the-space-complexity-of-planted-clique-recovery-the-same-as-that-of-detection-2008.128252020-11-25 https://scifaro.com/en/abs/the-double-exponential-runtime-is-tight-for-2-stage-stochastic-ilps-2008.129282021-02-08 https://scifaro.com/en/abs/circuit-satisfiability-problem-for-circuits-of-small-complexity-2009.011392020-12-04 https://scifaro.com/en/abs/sum-of-squares-lower-bounds-for-sherrington-kirkpatrick-via-planted-affine-planes-2009.018742020-09-07 https://scifaro.com/en/abs/a-lower-bound-on-determinantal-complexity-2009.024522021-12-03 https://scifaro.com/en/abs/towards-stronger-counterexamples-to-the-log-approximate-rank-conjecture-2009.027172020-09-08 https://scifaro.com/en/abs/on-hardness-of-approximation-of-parameterized-set-cover-and-label-cover-threshold-graphs-from-error-correcting-codes-2009.027782020-09-08 https://scifaro.com/en/abs/optimal-inapproximability-of-satisfiable-k-lin-over-non-abelian-groups-2009.028152020-09-08 https://scifaro.com/en/abs/a-simpler-np-hardness-proof-for-familial-graph-compression-2009.029452020-09-08 https://scifaro.com/en/abs/pushdown-and-lempel-ziv-depth-2009.048212022-01-20 https://scifaro.com/en/abs/toward-probabilistic-checking-against-non-signaling-strategies-with-constant-locality-2009.048922020-09-11 https://scifaro.com/en/abs/explicit-sos-lower-bounds-from-high-dimensional-expanders-2009.052182021-11-23 https://scifaro.com/en/abs/statistical-query-algorithms-and-low-degree-tests-are-almost-equivalent-2009.061072021-06-29 https://scifaro.com/en/abs/relaxed-locally-correctable-codes-with-improved-parameters-2009.073112020-09-17 https://scifaro.com/en/abs/tropical-kirchhoff-s-formula-and-postoptimality-in-matroid-optimization-2009.076302020-09-17 https://scifaro.com/en/abs/strongly-refuting-all-semi-random-boolean-csps-2009.080322020-09-18 https://scifaro.com/en/abs/sparsification-lower-bounds-for-list-h-coloring-2009.083532020-09-18 https://scifaro.com/en/abs/on-the-parameterized-complexity-of-synthesizing-boolean-petri-nets-with-restricted-dependency-2009.088712020-09-21 https://scifaro.com/en/abs/recent-progress-on-matrix-rigidity-a-survey-2009.094602020-09-22 https://scifaro.com/en/abs/the-complexity-of-constrained-min-max-optimization-2009.096232020-09-22 https://scifaro.com/en/abs/in-approximability-of-maximum-minimal-fvs-2009.099712021-02-12 https://scifaro.com/en/abs/on-the-mysteries-of-max-nae-sat-2009.106772024-09-27 https://scifaro.com/en/abs/cyclic-shift-problems-on-graphs-2009.109812020-09-24 https://scifaro.com/en/abs/on-one-way-functions-and-kolmogorov-complexity-2009.115142020-09-25 https://scifaro.com/en/abs/on-tractability-of-ulams-metric-in-highier-dimensions-and-dually-related-hierarchies-2009.116222021-06-08 https://scifaro.com/en/abs/fine-grained-complexity-of-the-list-homomorphism-problem-feedback-vertex-set-and-cutwidth-2009.116422020-09-25 https://scifaro.com/en/abs/pebble-depth-2009.122252022-01-20 https://scifaro.com/en/abs/on-the-approximability-of-robust-network-design-2009.122912021-01-29 https://scifaro.com/en/abs/digraph-homomorphism-problem-and-weak-near-unanimity-polymorphism-2009.130902020-11-24 https://scifaro.com/en/abs/reachability-in-dynamical-systems-with-rounding-2009.133532020-09-29 https://scifaro.com/en/abs/multidimensional-stable-roommates-with-master-list-2009.141912021-04-02 https://scifaro.com/en/abs/tetris-is-np-hard-even-with-o-1-rows-or-columns-2009.143362020-10-01 https://scifaro.com/en/abs/monochromatic-triangles-intermediate-matrix-products-and-convolutions-2009.144792020-10-01 https://scifaro.com/en/abs/on-approximability-of-clustering-problems-without-candidate-centers-2010.000872020-10-08 https://scifaro.com/en/abs/limitations-of-sums-of-bounded-read-formulas-2010.013852020-10-06 https://scifaro.com/en/abs/balanced-incomplete-block-designs-and-exact-satisfiability-2010.029222020-10-08 https://scifaro.com/en/abs/complexity-of-the-list-homomorphism-problem-in-hereditary-graph-classes-2010.033932022-02-04 https://scifaro.com/en/abs/finitely-in-tractable-promise-constraint-satisfaction-problems-2010.046182025-06-09 https://scifaro.com/en/abs/symmetric-promise-constraint-satisfaction-problems-beyond-the-boolean-case-2010.046232020-10-12 https://scifaro.com/en/abs/the-complexity-of-counting-edge-colorings-for-simple-graphs-2010.049102020-10-13 https://scifaro.com/en/abs/a-structural-theorem-for-local-algorithms-with-applications-to-coding-testing-and-verification-2010.049852023-12-13 https://scifaro.com/en/abs/fpras-via-mcmc-where-it-mixes-torpidly-and-very-little-effort-2010.054252020-10-13 https://scifaro.com/en/abs/a-lower-bound-for-polynomial-calculus-with-extension-rule-2010.056602020-10-13 https://scifaro.com/en/abs/on-lattice-point-counting-in-delta-modular-polyhedra-2010.057682022-11-30 https://scifaro.com/en/abs/nearly-optimal-average-case-complexity-of-counting-bicliques-under-seth-2010.058222020-10-13 https://scifaro.com/en/abs/counting-subgraphs-in-degenerate-graphs-2010.059982021-12-10 https://scifaro.com/en/abs/trace-reconstruction-problems-in-computational-biology-2010.060832020-10-14 https://scifaro.com/en/abs/digraph-coloring-and-distance-to-acyclicity-2010.063172022-01-04 https://scifaro.com/en/abs/on-the-complexity-of-some-facet-defining-inequalities-of-the-qap-polytope-2010.064012020-10-14 https://scifaro.com/en/abs/optimal-low-degree-hardness-of-maximum-independent-set-2010.065632020-11-13 https://scifaro.com/en/abs/complexity-measures-on-the-symmetric-group-and-beyond-2010.074052020-10-16 https://scifaro.com/en/abs/barrington-plays-cards-the-complexity-of-card-based-protocols-2010.084452020-10-19 https://scifaro.com/en/abs/on-the-hardness-of-average-case-k-sum-2010.088212020-11-12 https://scifaro.com/en/abs/mad-science-is-provably-hard-puzzles-in-hearthstone-s-boomsday-lab-are-np-hard-2010.088622020-10-20 https://scifaro.com/en/abs/log-rank-and-lifting-for-and-functions-2010.089942020-10-23 https://scifaro.com/en/abs/tightness-of-sensitivity-and-proximity-bounds-for-integer-linear-programs-2010.092552020-10-20 https://scifaro.com/en/abs/complexity-of-retrograde-and-helpmate-chess-problems-even-cooperative-chess-is-hard-2010.092712020-10-20 https://scifaro.com/en/abs/primitive-recursive-ordered-fields-and-some-applications-2010.101892021-11-09 https://scifaro.com/en/abs/separation-results-for-boolean-function-classes-2010.117542020-10-23 https://scifaro.com/en/abs/equation-satisfiability-in-solvable-groups-2010.117882020-10-23 https://scifaro.com/en/abs/singularity-of-random-integer-matrices-with-large-entries-2010.120812021-09-01 https://scifaro.com/en/abs/expressive-power-of-linear-algebra-query-languages-2010.137172020-10-27 https://scifaro.com/en/abs/impossibility-results-for-grammar-compressed-linear-algebra-2010.141812020-10-28 https://scifaro.com/en/abs/the-long-the-short-and-the-random-2011.016492020-11-10 https://scifaro.com/en/abs/the-complexity-of-finding-fair-independent-sets-in-cycles-2011.017702022-09-20 https://scifaro.com/en/abs/the-complexity-of-gradient-descent-cls-ppad-cap-pls-2011.019292023-03-06 https://scifaro.com/en/abs/pcp-theorems-seth-and-more-towards-proving-sub-linear-time-inapproximability-2011.023202022-03-25 https://scifaro.com/en/abs/a-multistage-view-on-2-satisfiability-2011.023252020-11-05 https://scifaro.com/en/abs/consequences-of-apsp-triangle-detection-and-3sum-hardness-for-separation-between-determinism-and-non-determinism-2011.024282021-04-20 https://scifaro.com/en/abs/postulate-based-proof-of-the-p-np-hypothesis-2011.028682020-11-06 https://scifaro.com/en/abs/group-isomorphism-is-nearly-linear-time-for-most-orders-2011.031332021-04-13 https://scifaro.com/en/abs/detecting-and-counting-small-subgraphs-and-evaluating-a-parameterized-tutte-polynomial-lower-bounds-via-toroidal-grids-and-cayley-graph-expanders-2011.034332021-05-14 https://scifaro.com/en/abs/on-the-complexity-of-csp-based-ideal-membership-problems-2011.037002021-06-09 https://scifaro.com/en/abs/quantum-combinatorial-games-structures-and-computational-complexity-2011.037042020-11-10 https://scifaro.com/en/abs/optimal-tiling-of-the-euclidean-space-using-symmetric-bodies-2011.040712020-11-10 https://scifaro.com/en/abs/hardness-of-approximation-of-euclidean-k-median-2011.042212021-12-08 https://scifaro.com/en/abs/machinery-for-proving-sum-of-squares-lower-bounds-on-certification-problems-2011.042532023-02-13 https://scifaro.com/en/abs/high-dimensional-expanders-eigenstripping-pseudorandomness-and-unique-games-2011.046582021-07-20 https://scifaro.com/en/abs/graph-homomorphism-polynomials-algorithms-and-complexity-2011.047782020-11-17 https://scifaro.com/en/abs/on-counting-quantum-graph-homomorphisms-in-finite-fields-of-prime-order-2011.048272022-08-19 https://scifaro.com/en/abs/on-the-cut-dimension-of-a-graph-2011.050852020-11-30 https://scifaro.com/en/abs/the-strongish-planted-clique-hypothesis-and-its-consequences-2011.055552020-11-12 https://scifaro.com/en/abs/ordinally-consensus-subset-over-multiple-metrics-2011.055572021-03-03 https://scifaro.com/en/abs/efficient-list-decoding-with-constant-alphabet-and-list-sizes-2011.058842021-06-11 https://scifaro.com/en/abs/hardness-of-approximate-nearest-neighbor-search-under-l-infinity-2011.061352020-11-13 https://scifaro.com/en/abs/total-completion-time-minimization-for-scheduling-with-incompatibility-cliques-2011.061502021-03-16 https://scifaro.com/en/abs/comparing-computational-entropies-below-majority-or-when-is-the-dense-model-theorem-false-2011.061662020-11-13 https://scifaro.com/en/abs/block-rigidity-strong-multiplayer-parallel-repetition-implies-super-linear-lower-bounds-for-turing-machines-2011.090932020-11-30 https://scifaro.com/en/abs/dichotomy-result-on-3-regular-bipartite-non-negative-functions-2011.091102020-11-19 https://scifaro.com/en/abs/proof-compression-and-np-versus-pspace-ii-addendum-2011.092622022-01-11 https://scifaro.com/en/abs/on-the-directed-tile-assembly-systems-at-temperature-1-2011.096752020-11-20 https://scifaro.com/en/abs/space-lower-bounds-for-graph-stream-problems-2011.105282020-11-23 https://scifaro.com/en/abs/recognizing-proper-tree-graphs-2011.116702020-11-25 https://scifaro.com/en/abs/arithmetic-expression-construction-2011.117672020-11-25 https://scifaro.com/en/abs/on-the-proper-orientation-number-of-chordal-graphs-2011.147192020-12-01 https://scifaro.com/en/abs/fort-formation-by-an-automaton-2011.150742020-12-01 https://scifaro.com/en/abs/integer-programming-and-incidence-treedepth-2012.000792020-12-02 https://scifaro.com/en/abs/time-space-lower-bounds-for-simulating-proof-systems-with-quantum-and-randomized-verifiers-2012.003302021-02-01 https://scifaro.com/en/abs/parameterized-complexity-of-bandwidth-of-caterpillars-and-weighted-path-emulation-2012.012262020-12-03 https://scifaro.com/en/abs/constructing-segmented-differentiable-quadratics-to-determine-algorithmic-run-times-and-model-non-polynomial-functions-2012.014202020-12-04 https://scifaro.com/en/abs/shrinkage-under-random-projections-and-cubic-formula-lower-bounds-for-mathsf-ac-0-2012.022102024-12-09 https://scifaro.com/en/abs/tight-chang-s-lemma-type-bounds-for-boolean-functions-2012.023352021-05-25 https://scifaro.com/en/abs/monotone-circuit-lower-bounds-from-robust-sunflowers-2012.038832022-08-08 https://scifaro.com/en/abs/settling-the-complexity-of-nash-equilibrium-in-congestion-games-2012.043272021-03-24 https://scifaro.com/en/abs/on-proof-theory-in-computer-science-2012.044372020-12-09 https://scifaro.com/en/abs/on-the-geometry-of-geometric-rank-2012.046792022-08-24 https://scifaro.com/en/abs/shrinkage-of-decision-lists-and-dnf-formulas-2012.051322020-12-29 https://scifaro.com/en/abs/the-complexity-of-x3sat-p-np-pspace-2012.063042022-12-13 https://scifaro.com/en/abs/runtime-complexity-analysis-of-logically-constrained-rewriting-2012.063702020-12-14 https://scifaro.com/en/abs/hard-qbfs-for-merge-resolution-2012.067792024-09-13 https://scifaro.com/en/abs/if-vnp-is-hard-then-so-are-equations-for-it-2012.070562024-02-29 https://scifaro.com/en/abs/logical-characterizations-of-computational-complexity-classes-2012.075142020-12-15 https://scifaro.com/en/abs/classifying-celeste-as-np-complete-2012.076782022-12-02 https://scifaro.com/en/abs/going-from-the-huge-to-the-small-efficient-succinct-representation-of-proofs-in-minimal-implicational-logic-2012.078332021-01-26 https://scifaro.com/en/abs/a-new-perspective-of-paramodulation-complexity-by-solving-massive-8-puzzles-2012.082312020-12-16 https://scifaro.com/en/abs/clique-is-hard-on-average-for-regular-resolution-2012.094762020-12-18 https://scifaro.com/en/abs/hard-problems-that-quickly-become-very-easy-2012.097702021-08-06 https://scifaro.com/en/abs/maximum-cut-on-interval-graphs-of-interval-count-four-is-np-complete-2012.098042022-11-30 https://scifaro.com/en/abs/notes-on-hazard-free-circuits-2012.109762020-12-22 https://scifaro.com/en/abs/ergodic-theorems-for-pspace-functions-and-their-converses-2012.112662021-02-16 https://scifaro.com/en/abs/coin-flipping-in-dynamic-programming-is-almost-useless-2012.127982020-12-24 https://scifaro.com/en/abs/approximation-limitations-of-pure-dynamic-programming-2012.128312020-12-24 https://scifaro.com/en/abs/sorting-can-exponentially-speed-up-pure-dynamic-programming-2012.128382020-12-24 https://scifaro.com/en/abs/learning-algorithms-from-circuit-lower-bounds-2012.140952020-12-29 https://scifaro.com/en/abs/pizza-sharing-is-ppa-hard-2012.142362026-03-13 https://scifaro.com/en/abs/weighted-slice-rank-and-a-minimax-correspondence-to-strassen-s-spectra-2012.144122023-04-20 https://scifaro.com/en/abs/yet-another-argument-in-favour-of-np-conp-2101.000032021-01-05 https://scifaro.com/en/abs/algorithmic-complexities-in-backpropagation-and-tropical-neural-networks-2101.007172021-01-05 https://scifaro.com/en/abs/a-polynomial-time-construction-of-a-hitting-set-for-read-once-branching-programs-of-width-3-2101.011512023-06-22 https://scifaro.com/en/abs/resolution-with-symmetry-rule-applied-to-linear-equations-2101.051422021-01-14 https://scifaro.com/en/abs/space-efficient-algorithms-for-reachability-in-geometric-graphs-2101.052352021-07-06 https://scifaro.com/en/abs/necessary-and-sufficient-condition-for-satisfiability-of-a-boolean-formula-in-cnf-and-its-implications-on-p-versus-np-problem-2101.055972021-05-25 https://scifaro.com/en/abs/strings-and-coins-and-nimstring-are-pspace-complete-2101.063612023-10-27 https://scifaro.com/en/abs/transverse-wave-an-impartial-color-propagation-game-inspired-by-social-influence-and-quantum-nim-2101.072372021-01-21 https://scifaro.com/en/abs/tameness-and-the-power-of-programs-over-monoids-in-da-2101.074952023-06-22 https://scifaro.com/en/abs/positive-spectrahedra-invariance-principles-and-pseudorandom-generators-2101.081412021-06-03 https://scifaro.com/en/abs/on-separation-between-the-degree-of-a-boolean-function-and-the-block-sensitivity-2101.086002021-06-22 https://scifaro.com/en/abs/an-in-place-truncated-fourier-transform-2101.090052021-01-25 https://scifaro.com/en/abs/a-superstatistical-formulation-of-complexity-measures-2101.091472021-01-25 https://scifaro.com/en/abs/hard-satisfiable-formulas-for-dpll-algorithms-using-heuristics-with-small-memory-2101.095282021-01-26 https://scifaro.com/en/abs/optimal-oracles-for-point-to-set-principles-2101.111522021-05-13 https://scifaro.com/en/abs/a-deterministic-algorithm-for-the-discrete-logarithm-problem-in-a-semigroup-2101.115002022-03-16 https://scifaro.com/en/abs/an-upper-bound-on-the-complexity-of-tablut-2101.119342021-01-29 https://scifaro.com/en/abs/a-note-on-the-complexity-of-k-metric-dimension-2101.120182021-01-29 https://scifaro.com/en/abs/the-tensor-rank-of-5x5-matrices-multiplication-is-bounded-by-98-and-its-border-rank-by-89-2101.125682021-02-02 https://scifaro.com/en/abs/the-dimension-spectrum-conjecture-for-planar-lines-2102.001342021-11-08 https://scifaro.com/en/abs/quantum-game-theory-and-the-complexity-of-approximating-quantum-nash-equilibria-2102.005122022-12-28 https://scifaro.com/en/abs/sampling-and-complexity-of-partition-function-2102.008552022-12-25 https://scifaro.com/en/abs/the-eth-is-false-k-sat-is-in-sub-exponential-time-2102.026242021-02-05 https://scifaro.com/en/abs/reconstructing-arbitrary-trees-from-traces-in-the-tree-edit-distance-model-2102.031732022-01-14 https://scifaro.com/en/abs/parameterized-complexity-of-immunization-in-the-threshold-model-2102.035372021-02-09 https://scifaro.com/en/abs/on-the-algorithmic-content-of-quantum-measurements-2102.039052021-05-17 https://scifaro.com/en/abs/enumerating-maximal-consistent-closed-sets-in-closure-systems-2102.042452021-02-10 https://scifaro.com/en/abs/a-full-complexity-dichotomy-for-immanant-families-2102.043402021-02-09 https://scifaro.com/en/abs/placing-green-bridges-optimally-with-a-multivariate-analysis-2102.045392024-04-02 https://scifaro.com/en/abs/constant-approximating-k-clique-is-w-1-hard-2102.047692021-02-10 https://scifaro.com/en/abs/on-computation-complexity-of-true-proof-number-search-2102.049072021-02-10 https://scifaro.com/en/abs/on-the-power-and-limitations-of-branch-and-cut-2102.050192021-05-24 https://scifaro.com/en/abs/hitting-sets-and-reconstruction-for-dense-orbits-in-text-vp-e-and-sigma-pi-sigma-circuits-2102.056322021-02-16 https://scifaro.com/en/abs/barriers-for-recent-methods-in-geodesic-optimization-2102.066522024-11-19 https://scifaro.com/en/abs/proof-complexity-of-positive-branching-programs-2102.066732025-03-12 https://scifaro.com/en/abs/lower-bounds-on-dynamic-programming-for-maximum-weight-independent-set-2102.069012022-02-08 https://scifaro.com/en/abs/a-note-on-vnp-completeness-and-border-complexity-2102.071732021-12-02 https://scifaro.com/en/abs/depth-lower-bounds-in-stabbing-planes-for-combinatorial-principles-2102.076222024-08-07 https://scifaro.com/en/abs/unambiguous-dnfs-and-alon-saks-seymour-2102.083482021-06-08 https://scifaro.com/en/abs/data-structures-lower-bounds-and-popular-conjectures-2102.092942021-02-19 https://scifaro.com/en/abs/training-neural-networks-is-exists-mathbb-r-complete-2102.097982021-11-22 https://scifaro.com/en/abs/parallel-algorithms-for-power-circuits-and-the-word-problem-of-the-baumslag-group-2102.099212022-06-16 https://scifaro.com/en/abs/sorting-short-integers-2102.100272021-05-10 https://scifaro.com/en/abs/conditional-dichotomy-of-boolean-ordered-promise-csps-2102.118542023-06-22 https://scifaro.com/en/abs/approximability-of-all-boolean-csps-with-linear-sketches-2102.123512022-02-14 https://scifaro.com/en/abs/a-comprehensive-survey-on-the-multiple-travelling-salesman-problem-applications-approaches-and-taxonomy-2102.127722021-02-26 https://scifaro.com/en/abs/separating-abps-and-some-structured-formulas-in-the-non-commutative-setting-2103.008642021-03-02 https://scifaro.com/en/abs/new-separations-results-for-external-information-2103.040492021-03-09 https://scifaro.com/en/abs/p-hardness-proofs-of-matrix-immanants-evaluated-on-restricted-matrices-2103.049342025-11-21 https://scifaro.com/en/abs/edge-exploration-of-temporal-graphs-2103.053872021-11-18 https://scifaro.com/en/abs/exact-and-approximate-pattern-counting-in-degenerate-graphs-new-algorithms-hardness-results-and-complexity-dichotomies-2103.055882021-06-02 https://scifaro.com/en/abs/several-separations-based-on-a-partial-boolean-function-2103.055932021-03-10 https://scifaro.com/en/abs/hiding-solutions-in-model-rb-forced-instances-are-almost-as-hard-as-unforced-ones-2103.066492021-03-16 https://scifaro.com/en/abs/simplification-strategies-for-the-qutrit-zx-calculus-2103.069142022-06-22 https://scifaro.com/en/abs/an-fptas-for-the-delta-modular-multidimensional-knapsack-problem-2103.072572022-11-30 https://scifaro.com/en/abs/efficient-reconstruction-of-depth-three-circuits-with-top-fan-in-two-2103.074452021-06-18 https://scifaro.com/en/abs/the-complexity-of-multilayer-d-dimensional-circuits-2103.076922021-03-16 https://scifaro.com/en/abs/fooling-gaussian-ptfs-via-local-hyperconcentration-2103.078092022-02-10 https://scifaro.com/en/abs/sharp-indistinguishability-bounds-from-non-uniform-approximations-2103.078422021-03-16 https://scifaro.com/en/abs/pseudodeterministic-algorithms-and-the-structure-of-probabilistic-time-2103.085392021-03-16 https://scifaro.com/en/abs/promise-problems-meet-pseudodeterminism-2103.085892021-03-16 https://scifaro.com/en/abs/the-complexity-of-checking-partial-total-positivity-2103.087422021-09-21 https://scifaro.com/en/abs/strong-parallel-repetition-for-unique-games-on-small-set-expanders-2103.087432022-09-21 https://scifaro.com/en/abs/characterizing-tseitin-formulas-with-short-regular-resolution-refutations-2103.096092021-03-18 https://scifaro.com/en/abs/fourier-growth-of-parity-decision-trees-2103.116042021-05-14 https://scifaro.com/en/abs/separations-between-combinatorial-measures-for-transitive-functions-2103.123552025-10-01 https://scifaro.com/en/abs/the-multicolored-graph-realization-problem-2103.128992021-03-25 https://scifaro.com/en/abs/reachability-and-matching-in-single-crossing-minor-free-graphs-2103.139402021-09-07 https://scifaro.com/en/abs/random-restrictions-and-prgs-for-ptfs-in-gaussian-space-2103.141342021-11-30 https://scifaro.com/en/abs/on-arroyo-figueroa-s-proof-that-mathrm-p-neq-mathrm-np-2103.152462021-03-30 https://scifaro.com/en/abs/determining-a-slater-winner-is-complete-for-parallel-access-to-np-2103.164162021-12-28 https://scifaro.com/en/abs/a-generalization-of-a-theorem-of-rothschild-and-van-lint-2103.168112021-04-01 https://scifaro.com/en/abs/the-complete-classification-for-quantified-equality-constraints-2104.004062026-05-22 https://scifaro.com/en/abs/symmetric-subrank-of-tensors-and-applications-2104.011302022-03-15 https://scifaro.com/en/abs/a-critique-of-keum-bae-cho-s-proof-that-mathrm-p-subsetneq-mathrm-np-2104.017362022-05-16 https://scifaro.com/en/abs/proof-complexity-of-symbolic-qbf-reasoning-2104.025632021-04-07 https://scifaro.com/en/abs/on-salum-s-algorithm-for-mathrm-x3sat-2104.028862021-04-08 https://scifaro.com/en/abs/information-in-propositional-proofs-and-algorithmic-proof-search-2104.047112022-07-12 https://scifaro.com/en/abs/the-algebraic-structure-of-the-densification-and-the-sparsification-tasks-for-csps-2104.050652022-11-22 https://scifaro.com/en/abs/feedback-vertex-set-on-hamiltonian-graphs-2104.053222021-04-13 https://scifaro.com/en/abs/characterization-of-decomposition-of-matrix-multiplication-tensors-2104.053232021-04-13 https://scifaro.com/en/abs/on-lev-gordeev-s-on-p-versus-np-2104.071662021-04-16 https://scifaro.com/en/abs/sized-types-with-usages-for-parallel-complexity-of-pi-calculus-processes-2104.072932021-10-20 https://scifaro.com/en/abs/3-coloring-on-regular-planar-and-ordered-hamiltonian-graphs-2104.084702021-04-20 https://scifaro.com/en/abs/a-timecop-s-chase-around-the-table-2104.086162021-07-13 https://scifaro.com/en/abs/on-the-complexity-of-inverse-mixed-integer-linear-optimization-2104.090022023-07-14 https://scifaro.com/en/abs/qcsp-on-reflexive-tournaments-2104.105702022-04-13 https://scifaro.com/en/abs/unifying-the-three-algebraic-approaches-to-the-csp-via-minimal-taylor-algebras-2104.118082024-08-07 https://scifaro.com/en/abs/beyond-pcsp-1-in-3-nae-2104.128002023-01-31 https://scifaro.com/en/abs/minimum-stable-cut-and-treewidth-2104.130972026-04-08 https://scifaro.com/en/abs/kernelization-proof-complexity-and-social-choice-2104.136812021-04-29 https://scifaro.com/en/abs/parameterized-string-equations-2104.141712021-04-30 https://scifaro.com/en/abs/separation-of-pspace-and-exp-2104.143162024-03-12 https://scifaro.com/en/abs/revising-johnson-s-table-for-the-21st-century-2104.143952021-04-30 https://scifaro.com/en/abs/polytime-reductions-of-af-algebraic-problems-2104.144152021-04-30 https://scifaro.com/en/abs/parameterized-modular-counting-and-cayley-graph-expanders-2104.145962021-05-14 https://scifaro.com/en/abs/turing-completeness-and-sid-meier-s-civilization-2104.146472024-08-28 https://scifaro.com/en/abs/the-complexity-of-approximating-the-complex-valued-ising-model-on-bounded-degree-graphs-2105.002872022-04-11 https://scifaro.com/en/abs/csat-and-ceqv-for-nilpotent-maltsev-algebras-of-fitting-length-2-2105.006892023-08-08 https://scifaro.com/en/abs/lower-bounds-on-the-time-memory-tradeoff-of-function-inversion-2105.007612021-05-11 https://scifaro.com/en/abs/channels-of-small-log-ratio-leakage-and-characterization-of-two-party-differentially-private-computation-2105.007702021-05-11 https://scifaro.com/en/abs/sketching-approximability-of-all-finite-csps-2105.011612024-02-27 https://scifaro.com/en/abs/isolation-schemes-for-problems-on-decomposable-graphs-2105.014652021-05-05 https://scifaro.com/en/abs/counting-vertices-of-integral-polytopes-defined-by-facets-2105.014692022-05-04 https://scifaro.com/en/abs/reconstruction-algorithms-for-low-rank-tensors-and-depth-3-multilinear-circuits-2105.017512021-05-06 https://scifaro.com/en/abs/one-way-communication-complexity-and-non-adaptive-decision-trees-2105.019632022-01-19 https://scifaro.com/en/abs/quantum-logarithmic-space-and-post-selection-2105.026812021-10-05 https://scifaro.com/en/abs/variety-evasive-subspace-families-2105.029082024-10-15 https://scifaro.com/en/abs/on-the-complexity-of-verification-of-time-sensitive-distributed-systems-technical-report-2105.035312021-09-16 https://scifaro.com/en/abs/super-solutions-of-the-model-rb-2105.038312021-05-11 https://scifaro.com/en/abs/proving-regulatory-compliance-full-compliance-against-an-expressive-unconditional-obligation-is-conp-complete-2105.054312022-12-13 https://scifaro.com/en/abs/sketching-with-kerdock-s-crayons-fast-sparsifying-transforms-for-arbitrary-linear-maps-2105.058792021-05-14 https://scifaro.com/en/abs/changeable-sweep-coverage-problem-2105.060302021-05-14 https://scifaro.com/en/abs/pebbles-graphs-and-a-pinch-of-combinatorics-towards-tight-i-o-lower-bounds-for-statically-analyzable-programs-2105.072032021-05-18 https://scifaro.com/en/abs/a-stress-free-sum-of-squares-lower-bound-for-coloring-2105.075172021-05-18 https://scifaro.com/en/abs/monomial-size-vs-bit-complexity-in-sums-of-squares-and-polynomial-calculus-2105.075252021-05-18 https://scifaro.com/en/abs/on-symmetry-versus-asynchronism-at-the-edge-of-universality-in-automata-networks-2105.083562021-05-19 https://scifaro.com/en/abs/gsf-locality-is-not-sufficient-for-proximity-oblivious-testing-2105.084902021-05-19 https://scifaro.com/en/abs/degrees-and-gaps-tight-complexity-results-of-general-factor-problems-parameterized-by-treewidth-and-cutwidth-2105.089802021-10-20 https://scifaro.com/en/abs/parameterized-complexity-of-locally-minimal-defensive-alliances-2105.107422023-03-06 https://scifaro.com/en/abs/parameterized-problems-complete-for-nondeterministic-fpt-time-and-logarithmic-space-2105.148822023-10-24 https://scifaro.com/en/abs/parallel-polynomial-permanent-mod-powers-of-2-and-shortest-disjoint-cycles-2106.007142021-06-03 https://scifaro.com/en/abs/the-hardest-explicit-construction-2106.008752022-02-14 https://scifaro.com/en/abs/from-undecidability-of-non-triviality-and-finiteness-to-undecidability-of-learnability-2106.013822023-10-18 https://scifaro.com/en/abs/stability-of-special-graph-classes-2106.014962021-06-04 https://scifaro.com/en/abs/on-the-computation-of-the-zariski-closure-of-finitely-generated-groups-of-matrices-2106.018532025-03-05 https://scifaro.com/en/abs/winning-the-war-by-strategically-losing-battles-settling-the-complexity-of-grundy-values-in-undirected-geography-2106.021142021-06-07 https://scifaro.com/en/abs/the-algorithmic-phase-transition-of-random-k-sat-for-low-degree-polynomials-2106.021292021-11-02 https://scifaro.com/en/abs/on-classifying-continuous-constraint-satisfaction-problems-2106.023972024-08-07 https://scifaro.com/en/abs/complexity-of-modular-circuits-2106.029472021-06-08 https://scifaro.com/en/abs/complexity-classification-of-counting-graph-homomorphisms-modulo-a-prime-number-2106.040862025-10-02 https://scifaro.com/en/abs/hardness-of-approximate-diameter-now-for-undirected-graphs-2106.060262021-11-16 https://scifaro.com/en/abs/revealing-the-canalizing-structure-of-boolean-functions-algorithms-and-applications-2106.065802024-11-19 https://scifaro.com/en/abs/time-free-solution-to-independent-set-problem-using-p-systems-with-active-membranes-2106.080782023-06-22 https://scifaro.com/en/abs/thou-shalt-covet-the-average-of-thy-neighbors-cakes-2106.111782022-11-02 https://scifaro.com/en/abs/the-separation-of-np-and-pspace-2106.118862025-04-02 https://scifaro.com/en/abs/linear-space-streaming-lower-bounds-for-approximating-csps-2106.130782026-04-03 https://scifaro.com/en/abs/the-complexity-of-quantified-constraints-collapsibility-switchability-and-the-algebraic-formulation-2106.131542021-06-25 https://scifaro.com/en/abs/an-improved-physical-zkp-for-nonogram-and-nonogram-color-2106.140202023-07-20 https://scifaro.com/en/abs/a-bound-on-the-edge-flipping-distance-between-triangulations-revisiting-the-proof-2106.144082021-06-29 https://scifaro.com/en/abs/the-reward-penalty-selection-problem-2106.146012021-06-29 https://scifaro.com/en/abs/the-complexity-of-synthesis-of-b-bounded-petri-nets-2106.152562023-06-22 https://scifaro.com/en/abs/yin-yang-puzzles-are-np-complete-2106.155852021-06-30 https://scifaro.com/en/abs/parameterized-complexities-of-dominating-and-independent-set-reconfiguration-2106.159072023-10-24 https://scifaro.com/en/abs/on-completeness-of-cost-metrics-and-meta-search-algorithms-in-calculus-2106.159692023-06-22 https://scifaro.com/en/abs/backgammon-is-hard-2106.161722021-12-15 https://scifaro.com/en/abs/exponential-lower-bounds-for-threshold-circuits-of-sub-linear-depth-and-energy-2107.002232023-06-29 https://scifaro.com/en/abs/anti-unification-of-unordered-goals-2107.003412021-10-22 https://scifaro.com/en/abs/modular-counting-of-subgraphs-matchings-matching-splittable-graphs-and-paths-2107.006292021-07-02 https://scifaro.com/en/abs/linear-discrepancy-is-pi-2-hard-to-approximate-2107.012352021-07-06 https://scifaro.com/en/abs/average-case-communication-complexity-of-statistical-problems-2107.013352021-07-06 https://scifaro.com/en/abs/the-pcp-like-theorem-for-sub-linear-time-inapproximability-2107.015202024-01-03 https://scifaro.com/en/abs/the-complexity-of-finding-temporal-separators-under-waiting-time-constraints-2107.016092021-07-06 https://scifaro.com/en/abs/on-the-complexity-of-the-escape-problem-for-linear-dynamical-systems-over-compact-semialgebraic-sets-2107.020602021-07-13 https://scifaro.com/en/abs/on-search-complexity-of-discrete-logarithm-2107.026172021-09-07 https://scifaro.com/en/abs/majority-3sat-and-related-problems-in-polynomial-time-2107.027482021-11-16 https://scifaro.com/en/abs/sample-complexity-of-hidden-subgroup-problem-2107.029872021-07-08 https://scifaro.com/en/abs/on-the-probabilistic-degree-of-an-n-variate-boolean-function-2107.031712021-07-08 https://scifaro.com/en/abs/keep-that-card-in-mind-card-guessing-with-limited-memory-2107.038852022-01-04 https://scifaro.com/en/abs/sos-certification-for-symmetric-quadratic-functions-and-its-connection-to-constrained-boolean-hypercube-optimization-2107.041002021-07-12 https://scifaro.com/en/abs/most-classic-problems-remain-np-hard-on-relative-neighborhood-graphs-and-their-relatives-2107.043212021-07-12 https://scifaro.com/en/abs/does-qrat-simulate-ir-calc-qrat-simulation-algorithm-for-forall-exp-res-cannot-be-lifted-to-ir-calc-2107.045472021-07-12 https://scifaro.com/en/abs/smaller-acc0-circuits-for-symmetric-functions-2107.047062021-07-13 https://scifaro.com/en/abs/clap-a-new-algorithm-for-promise-csps-2107.050182023-01-31 https://scifaro.com/en/abs/karchmer-wigderson-games-for-hazard-free-computation-2107.051282022-11-30 https://scifaro.com/en/abs/on-the-computational-complexity-of-the-chain-rule-of-differential-calculus-2107.053552021-10-27 https://scifaro.com/en/abs/inapproximability-of-counting-hypergraph-colourings-2107.054862022-08-23 https://scifaro.com/en/abs/the-element-extraction-problem-and-the-cost-of-determinism-and-limited-adaptivity-in-linear-queries-2107.058102021-07-14 https://scifaro.com/en/abs/promise-constraint-satisfaction-and-width-2107.058862021-07-14 https://scifaro.com/en/abs/towards-exact-structural-thresholds-for-parameterized-complexity-2107.061112022-12-20 https://scifaro.com/en/abs/the-dynamic-complexity-of-acyclic-hypergraph-homomorphisms-2107.061212021-07-14 https://scifaro.com/en/abs/parallel-repetition-for-the-ghz-game-a-simpler-proof-2107.061562021-07-14 https://scifaro.com/en/abs/tight-running-times-for-minimum-ell-q-norm-load-balancing-beyond-exponential-dependencies-on-1-epsilon-2107.062612021-07-14 https://scifaro.com/en/abs/tight-bounds-on-the-fourier-growth-of-bounded-functions-on-the-hypercube-2107.063092021-07-20 https://scifaro.com/en/abs/counting-list-homomorphisms-from-graphs-of-bounded-treewidth-tight-complexity-bounds-2107.068892021-11-01 https://scifaro.com/en/abs/efficient-m-obius-transformations-and-their-applications-to-dempster-shafer-theory-clarification-and-implementation-2107.073592021-07-16 https://scifaro.com/en/abs/scheme-theoretic-approach-to-computational-complexity-i-the-separation-of-p-and-np-2107.073862024-02-20 https://scifaro.com/en/abs/scheme-theoretic-approach-to-computational-complexity-ii-the-separation-of-p-and-np-over-mathbb-c-mathbb-r-and-mathbb-z-2107.073872024-02-23 https://scifaro.com/en/abs/on-the-complexity-of-open-shop-scheduling-with-time-lags-2107.081022022-03-25 https://scifaro.com/en/abs/qrat-polynomially-simulates-merge-resolution-2107.093202021-07-27 https://scifaro.com/en/abs/combinatorial-gap-theorem-and-reductions-between-promise-csps-2107.094232021-07-21 https://scifaro.com/en/abs/functional-lower-bounds-for-restricted-arithmetic-circuits-of-depth-four-2107.097032021-07-22 https://scifaro.com/en/abs/fourier-growth-of-structured-mathbb-f-2-polynomials-and-applications-2107.107972024-10-15 https://scifaro.com/en/abs/lower-bounds-for-symmetric-circuits-for-the-determinant-2107.109862024-09-02 https://scifaro.com/en/abs/on-boolean-functions-with-low-polynomial-degree-and-higher-order-sensitivity-2107.112052021-07-26 https://scifaro.com/en/abs/on-relating-one-way-classical-and-quantum-communication-complexities-2107.116232023-05-24 https://scifaro.com/en/abs/logspace-reducibility-from-secret-leakage-planted-clique-2107.118862023-11-10 https://scifaro.com/en/abs/parameterized-complexity-of-reconfiguration-of-atoms-2107.122672025-04-09 https://scifaro.com/en/abs/dense-graph-partitioning-on-sparse-and-dense-graphs-2107.132822022-02-17 https://scifaro.com/en/abs/generalisations-of-matrix-partitions-complexity-and-obstructions-2107.138092024-07-03 https://scifaro.com/en/abs/generating-boolean-functions-on-totalistic-automata-networks-2107.147992021-08-02 https://scifaro.com/en/abs/deciding-boundedness-of-monadic-sirups-2108.004332021-08-03 https://scifaro.com/en/abs/geometric-embeddability-of-complexes-is-exists-mathbb-r-complete-2108.025852021-11-08 https://scifaro.com/en/abs/benchmarking-multi-task-learning-for-sentiment-analysis-and-offensive-language-identification-in-under-resourced-dravidian-languages-2108.038672021-08-10 https://scifaro.com/en/abs/two-class-r-k-coloring-coloring-with-service-guarantees-2108.038822021-08-10 https://scifaro.com/en/abs/efficient-algorithms-for-collecting-the-statistics-of-large-scale-ip-address-data-2108.040002025-02-24 https://scifaro.com/en/abs/stochastic-games-with-disjunctions-of-multiple-objectives-technical-report-2108.046042022-07-21 https://scifaro.com/en/abs/a-simple-lower-bound-for-arrival-2108.062732021-08-16 https://scifaro.com/en/abs/separation-of-p-and-np-2108.092692022-01-12 https://scifaro.com/en/abs/on-the-computational-complexities-of-various-geography-variants-2108.093672021-08-24 https://scifaro.com/en/abs/from-amortized-to-worst-case-delay-in-enumeration-algorithms-2108.102082024-09-04 https://scifaro.com/en/abs/positive-planar-satisfiability-problems-under-3-connectivity-constraints-2108.125002021-08-31 https://scifaro.com/en/abs/parameterizing-the-permanent-hardness-for-k-8-minor-free-graphs-2108.128792021-08-31 https://scifaro.com/en/abs/reachability-is-np-complete-even-for-the-simplest-neural-networks-2108.131792022-03-16 https://scifaro.com/en/abs/ell-p-spread-and-restricted-isometry-properties-of-sparse-random-matrices-2108.135782024-07-11 https://scifaro.com/en/abs/circuit-lower-bounds-for-the-p-spin-optimization-problem-2109.013422022-01-25 https://scifaro.com/en/abs/computational-complexity-of-jumping-block-puzzles-2109.022132021-09-07 https://scifaro.com/en/abs/matrix-hypercontractivity-streaming-algorithms-and-ldcs-the-large-alphabet-case-2109.026002024-11-12 https://scifaro.com/en/abs/analyzing-xor-forrelation-through-stochastic-calculus-2109.027322021-09-08 https://scifaro.com/en/abs/linear-equations-for-unordered-data-vectors-in-d-k-to-z-d-2109.030252023-06-22 https://scifaro.com/en/abs/convex-influences-2109.031072021-09-08 https://scifaro.com/en/abs/improved-hardness-of-bdd-and-svp-under-gap-s-eth-2109.040252025-07-30 https://scifaro.com/en/abs/algorithms-and-certificates-for-boolean-csp-refutation-smoothed-is-no-harder-than-random-2109.044152023-09-06 https://scifaro.com/en/abs/sharper-bounds-on-the-fourier-concentration-of-dnfs-2109.045252021-10-19 https://scifaro.com/en/abs/nimber-preserving-reductions-and-homomorphic-sprague-grundy-game-encodings-2109.056222022-02-24 https://scifaro.com/en/abs/on-the-equivalence-of-two-post-quantum-cryptographic-families-2109.058062024-10-21 https://scifaro.com/en/abs/dimension-and-the-structure-of-complexity-classes-2109.059562021-09-14 https://scifaro.com/en/abs/on-the-parameterized-complexity-of-the-acyclic-matching-problem-2109.060042022-10-05 https://scifaro.com/en/abs/the-inverse-of-ackermann-function-is-computable-in-linear-time-2109.060842023-06-22 https://scifaro.com/en/abs/symbolic-determinant-identity-testing-and-non-commutative-ranks-of-matrix-lie-algebras-2109.064032021-12-07 https://scifaro.com/en/abs/strong-approximations-and-irrationality-in-financial-networks-with-financial-derivatives-2109.066082022-01-17 https://scifaro.com/en/abs/monotone-complexity-of-spanning-tree-polynomial-re-visited-2109.069412021-09-16 https://scifaro.com/en/abs/small-promise-csps-that-reduce-to-large-csps-2109.079242023-06-22 https://scifaro.com/en/abs/computational-complexity-of-quadratic-unconstrained-binary-optimization-2109.100482022-02-21 https://scifaro.com/en/abs/on-the-hardness-of-the-determinant-sum-of-regular-set-multilinear-circuits-2109.100942021-09-22 https://scifaro.com/en/abs/generalized-minimum-0-extension-problem-and-discrete-convexity-2109.102032024-01-22 https://scifaro.com/en/abs/fine-grained-meta-theorems-for-vertex-integrity-2109.103332024-12-04 https://scifaro.com/en/abs/machines-as-programs-p-neq-np-2109.106702021-09-23 https://scifaro.com/en/abs/filling-crosswords-is-very-hard-2109.112032021-09-24 https://scifaro.com/en/abs/punctured-low-bias-codes-behave-like-random-linear-codes-2109.117252024-07-11 https://scifaro.com/en/abs/separating-circuits-switching-lemmas-and-random-restrictions-2109.139172021-09-30 https://scifaro.com/en/abs/the-overlap-gap-property-a-geometric-barrier-to-optimizing-over-random-structures-2109.144092022-10-12 https://scifaro.com/en/abs/gaps-ambiguity-and-establishing-complexity-class-containments-via-iterative-constant-setting-2109.147642024-02-12 https://scifaro.com/en/abs/decomposing-a-graph-into-subgraphs-with-small-components-2110.006922021-10-05 https://scifaro.com/en/abs/bipartite-3-regular-counting-problems-with-mixed-signs-2110.011732021-10-05 https://scifaro.com/en/abs/compiling-turing-machines-into-storage-modification-machines-2110.014152021-10-05 https://scifaro.com/en/abs/irreversibility-of-structure-tensors-of-modules-2110.016842022-01-31 https://scifaro.com/en/abs/a-faster-algorithm-for-counting-the-integer-points-number-in-delta-modular-polyhedra-corrected-version-2110.017322023-05-09 https://scifaro.com/en/abs/complexity-of-traveling-tournament-problem-with-trip-length-more-than-three-2110.023002021-10-07 https://scifaro.com/en/abs/partial-order-alignment-by-adjacencies-and-breakpoints-2110.028092021-10-07 https://scifaro.com/en/abs/polynomial-turing-kernels-for-clique-with-an-optimal-number-of-queries-2110.032792021-10-08 https://scifaro.com/en/abs/on-the-complexity-of-inductively-learning-guarded-rules-2110.036242021-10-08 https://scifaro.com/en/abs/on-sets-of-linear-forms-of-maximal-complexity-2110.046572022-12-13 https://scifaro.com/en/abs/black-box-absolute-reconstruction-for-sums-of-powers-of-linear-forms-2110.053052021-10-12 https://scifaro.com/en/abs/on-complexity-of-substructure-connectivity-and-restricted-connectivity-of-graphs-2110.059172026-01-15 https://scifaro.com/en/abs/resolution-of-the-linear-bounded-automata-question-2110.059422025-05-27 https://scifaro.com/en/abs/diagonalization-of-polynomial-time-deterministic-turing-machines-via-nondeterministic-turing-machines-2110.062112025-06-03 https://scifaro.com/en/abs/algorithmic-thresholds-for-refuting-random-polynomial-systems-2110.086772021-10-19 https://scifaro.com/en/abs/anti-factor-is-fpt-parameterized-by-treewidth-and-list-size-but-counting-is-hard-2110.093692023-02-08 https://scifaro.com/en/abs/the-complexity-of-the-quantified-csp-having-the-polynomially-generated-powers-property-2110.095042021-10-19 https://scifaro.com/en/abs/an-invariance-principle-for-the-multi-slice-with-applications-2110.107252025-07-28 https://scifaro.com/en/abs/refuting-tianrong-lin-s-arxiv-2110-05942-resolution-of-the-linear-bounded-automata-question-2110.124212022-08-09 https://scifaro.com/en/abs/extractors-for-sum-of-two-sources-2110.126522021-10-26 https://scifaro.com/en/abs/a-compilation-of-succinctness-results-for-arithmetic-circuits-2110.130142021-10-26 https://scifaro.com/en/abs/the-computational-complexity-of-finding-arithmetic-expressions-with-and-without-parentheses-2110.140452022-01-31 https://scifaro.com/en/abs/average-case-subset-balancing-problems-2110.146072021-10-28 https://scifaro.com/en/abs/on-structural-parameterizations-of-the-offensive-alliance-problem-2110.157572021-11-01 https://scifaro.com/en/abs/classifying-approximation-algorithms-understanding-the-apx-complexity-class-2111.015512021-11-03 https://scifaro.com/en/abs/deterministic-approximation-of-random-walks-via-queries-in-graphs-of-unbounded-size-2111.019972021-11-04 https://scifaro.com/en/abs/w-1-hardness-of-outer-connected-dominating-set-in-d-degenerate-graphs-2111.020252021-11-04 https://scifaro.com/en/abs/effective-guessing-has-unlikely-consequences-2111.021382024-07-31 https://scifaro.com/en/abs/counting-small-induced-subgraphs-with-hereditary-properties-2111.022772022-03-30 https://scifaro.com/en/abs/on-polynomially-many-queries-to-np-or-qma-oracles-2111.022962022-10-18 https://scifaro.com/en/abs/long-paths-make-pattern-counting-hard-and-deep-trees-make-it-harder-2111.034792021-11-08 https://scifaro.com/en/abs/alternating-automatic-register-machines-2111.042542022-08-18 https://scifaro.com/en/abs/parameterized-complexity-of-untangling-knots-2111.050012021-11-10 https://scifaro.com/en/abs/applications-of-random-algebraic-constructions-to-hardness-of-approximation-2111.055182021-11-11 https://scifaro.com/en/abs/defensive-alliances-in-graphs-2111.055452021-11-11 https://scifaro.com/en/abs/enhanced-fast-boolean-matching-based-on-sensitivity-signatures-pruning-2111.062132021-11-12 https://scifaro.com/en/abs/the-harmless-set-problem-2111.062672022-01-27 https://scifaro.com/en/abs/on-the-parameterized-complexity-of-compact-set-packing-2111.063382023-02-28 https://scifaro.com/en/abs/fixp-membership-via-convex-optimization-games-cakes-and-markets-2111.068782023-04-27 https://scifaro.com/en/abs/on-the-complexity-of-sat-2111.069672022-03-23 https://scifaro.com/en/abs/tradeoffs-for-small-depth-frege-proofs-2111.074832022-04-08 https://scifaro.com/en/abs/fast-algebraic-multivariate-multipoint-evaluation-in-small-characteristic-and-applications-2111.075722022-03-29 https://scifaro.com/en/abs/a-chronology-of-set-cover-inapproximability-results-2111.081002021-11-30 https://scifaro.com/en/abs/larger-corner-free-sets-from-combinatorial-degenerations-2111.082622022-02-01 https://scifaro.com/en/abs/addition-machines-automatic-functions-and-open-problems-of-floyd-and-knuth-2111.089692022-10-18 https://scifaro.com/en/abs/bipartite-temporal-graphs-and-the-parameterized-complexity-of-multistage-2-coloring-2111.090492021-11-18 https://scifaro.com/en/abs/sum-of-squares-lower-bounds-for-sparse-independent-set-2111.092502021-11-18 https://scifaro.com/en/abs/max-3-lin-over-non-abelian-groups-with-universal-factor-graphs-2111.092562021-11-18 https://scifaro.com/en/abs/hypercontractivity-on-high-dimensional-expanders-approximate-efron-stein-decompositions-for-varepsilon-product-spaces-2111.093752021-12-28 https://scifaro.com/en/abs/a-variant-of-the-vc-dimension-with-applications-to-depth-3-circuits-2111.096712022-06-28 https://scifaro.com/en/abs/non-np-hardness-of-translationally-invariant-spin-model-problems-2111.100922021-11-22 https://scifaro.com/en/abs/the-acrobatics-of-bqp-2111.104092024-04-26 https://scifaro.com/en/abs/a-counter-example-to-the-probabilistic-universal-graph-conjecture-via-randomized-communication-complexity-2111.104362021-12-09 https://scifaro.com/en/abs/learning-algorithms-versus-automatability-of-frege-systems-2111.106262021-11-23 https://scifaro.com/en/abs/johnson-coverage-hypothesis-inapproximability-of-k-means-and-k-median-in-l-p-metrics-2111.109122021-11-23 https://scifaro.com/en/abs/algorithmizing-the-multiplicity-schwartz-zippel-lemma-2111.110722025-12-24 https://scifaro.com/en/abs/on-the-strong-metric-dimension-of-directed-co-graphs-2111.130542021-11-29 https://scifaro.com/en/abs/on-algorithms-based-on-finitely-many-homomorphism-counts-2111.132692023-04-21 https://scifaro.com/en/abs/on-lower-bounds-of-approximating-parameterized-k-clique-2111.140332022-08-04 https://scifaro.com/en/abs/algorithms-and-lower-bounds-for-comparator-circuits-from-shrinkage-2111.149742021-12-01 https://scifaro.com/en/abs/sublinear-time-reductions-for-big-data-computing-2111.153302021-12-01 https://scifaro.com/en/abs/towards-algorithm-free-physical-equilibrium-model-of-computing-2112.000062021-12-02 https://scifaro.com/en/abs/spurious-valleys-np-hardness-and-tractability-of-sparse-matrix-factorization-with-fixed-support-2112.003862022-11-23 https://scifaro.com/en/abs/robustly-self-ordered-graphs-constructions-and-applications-to-property-testing-2112.006732023-06-22 https://scifaro.com/en/abs/ideals-determinants-and-straightening-proving-and-using-lower-bounds-for-polynomial-ideals-2112.007922022-10-28 https://scifaro.com/en/abs/the-mirage-of-universality-in-cellular-automata-2112.010902021-12-03 https://scifaro.com/en/abs/strong-hardness-of-approximation-for-tree-transversals-2112.017102021-12-06 https://scifaro.com/en/abs/on-the-complexity-of-the-k-way-vertex-cut-problem-2112.017812021-12-06 https://scifaro.com/en/abs/a-reliable-turing-machine-2112.021522021-12-07 https://scifaro.com/en/abs/the-complexity-of-data-driven-norm-synthesis-and-revision-2112.026262022-11-30 https://scifaro.com/en/abs/on-complexity-of-1-center-in-various-metrics-2112.032222023-07-13 https://scifaro.com/en/abs/np-completeness-of-the-active-time-scheduling-problem-2112.032552021-12-07 https://scifaro.com/en/abs/inconsistent-planning-when-in-doubt-toss-a-coin-2112.033292021-12-08 https://scifaro.com/en/abs/computational-complexity-of-problems-for-deterministic-presentations-of-sofic-shifts-2112.034842022-09-29 https://scifaro.com/en/abs/on-baker-gill-solovay-oracle-turing-machines-and-relativization-barrier-2112.036772023-11-14 https://scifaro.com/en/abs/almost-polynomial-factor-inapproximability-for-parameterized-k-clique-2112.039832025-01-28 https://scifaro.com/en/abs/a-survey-on-parameterized-inapproximability-k-clique-k-setcover-and-more-2112.046692021-12-13 https://scifaro.com/en/abs/a-critique-of-kumar-s-necessary-and-sufficient-condition-for-satisfiability-of-a-boolean-formula-in-cnf-and-its-implications-on-p-versus-np-problem-2112.060622021-12-14 https://scifaro.com/en/abs/zhed-is-np-complete-2112.079142021-12-16 https://scifaro.com/en/abs/optimal-grain-mixing-is-np-complete-2112.085012021-12-17 https://scifaro.com/en/abs/deciding-twin-width-at-most-4-is-np-complete-2112.089532021-12-17 https://scifaro.com/en/abs/hardness-of-the-generalized-coloring-numbers-2112.105622023-03-17 https://scifaro.com/en/abs/extending-merge-resolution-to-a-family-of-proof-systems-2112.110442021-12-29 https://scifaro.com/en/abs/the-complexity-of-iterated-reversible-computation-2112.116072024-02-14 https://scifaro.com/en/abs/on-theoretical-complexity-and-boolean-satisfiability-2112.117692021-12-23 https://scifaro.com/en/abs/lower-bounds-on-intermediate-results-in-bottom-up-knowledge-compilation-2112.124302021-12-24 https://scifaro.com/en/abs/the-probabilistic-weisfeiler-leman-algorithm-2112.130452021-12-28 https://scifaro.com/en/abs/new-computing-model-of-gn-etm-turing-machine-on-solving-even-goldbach-conjecture-2112.132052021-12-30 https://scifaro.com/en/abs/rough-analysis-of-computation-trees-2201.003112022-01-04 https://scifaro.com/en/abs/time-and-space-complexity-of-deterministic-and-nondeterministic-decision-trees-2201.010132022-01-05 https://scifaro.com/en/abs/an-experiment-of-the-complexity-of-sliding-block-puzzles-by-2d-heat-flow-in-paramodulation-2201.033012022-01-11 https://scifaro.com/en/abs/a-full-dichotomy-for-holant-c-inspired-by-quantum-computation-2201.033752025-08-08 https://scifaro.com/en/abs/on-proof-theory-in-computational-complexity-overview-2201.041182022-01-12 https://scifaro.com/en/abs/exact-learning-and-test-theory-2201.045062022-01-13 https://scifaro.com/en/abs/the-ideal-membership-problem-and-abelian-groups-2201.052182026-02-10 https://scifaro.com/en/abs/on-protocols-for-monotone-feasible-interpolation-2201.056622022-01-19 https://scifaro.com/en/abs/on-finer-separations-between-subclasses-of-read-once-oblivious-abps-2201.064322022-01-19 https://scifaro.com/en/abs/a-computation-model-with-automatic-functions-and-relations-as-primitive-operations-2201.068362022-01-19 https://scifaro.com/en/abs/incomplete-sets-in-p-for-logspace-reduction-2201.085012022-01-24 https://scifaro.com/en/abs/on-the-satisfaction-probabilities-of-k-cnf-formulas-2201.088952024-08-12 https://scifaro.com/en/abs/faster-algorithms-for-sparse-ilp-and-hypergraph-multi-packing-multi-cover-problems-2201.089882024-01-23 https://scifaro.com/en/abs/strong-sleptsov-net-is-turing-complete-2201.090342023-12-15 https://scifaro.com/en/abs/constant-inapproximability-for-ppa-2201.100112024-11-26 https://scifaro.com/en/abs/noise-sensitivity-from-fractional-query-algorithms-and-the-axis-aligned-laplacian-2201.103502022-01-26 https://scifaro.com/en/abs/perfect-matching-in-random-graphs-is-as-hard-as-tseitin-2201.108352023-06-22 https://scifaro.com/en/abs/linear-branching-programs-and-directional-affine-extractors-2201.109972022-07-19 https://scifaro.com/en/abs/two-commodity-flow-is-equivalent-to-linear-programming-under-nearly-linear-time-reductions-2201.115872022-01-28 https://scifaro.com/en/abs/on-the-kolmogorov-complexity-of-binary-classifiers-2201.123742022-02-04 https://scifaro.com/en/abs/general-2-path-problem-2201.128702023-04-25 https://scifaro.com/en/abs/xnlp-completeness-for-parameterized-problems-on-graphs-with-a-linear-structure-2201.131192022-07-14 https://scifaro.com/en/abs/recognising-the-overlap-graphs-of-subtrees-of-restricted-trees-is-hard-2202.016782022-02-04 https://scifaro.com/en/abs/globally-minimal-defensive-alliances-a-parameterized-perspective-2202.020102023-03-05 https://scifaro.com/en/abs/a-framework-for-loop-and-path-puzzle-satisfiability-np-hardness-results-2202.020462022-02-07 https://scifaro.com/en/abs/the-exponential-time-complexity-of-the-complex-weighted-csp-2202.027822022-02-08 https://scifaro.com/en/abs/a-robust-version-of-heged-h-u-s-s-lemma-with-applications-2202.049822023-06-22 https://scifaro.com/en/abs/hardness-results-for-laplacians-of-simplicial-complexes-via-sparse-linear-equation-complete-gadgets-2202.050112022-02-11 https://scifaro.com/en/abs/deterministic-non-cooperative-binding-in-two-dimensional-tile-assembly-systems-must-have-ultimately-periodic-paths-2202.051652022-02-11 https://scifaro.com/en/abs/notes-on-switching-lemmas-2202.056512022-02-14 https://scifaro.com/en/abs/black-box-identity-testing-of-noncommutative-rational-formulas-of-inversion-height-two-in-deterministic-quasipolynomial-time-2202.056932022-02-14 https://scifaro.com/en/abs/random-primes-in-arithmetic-progressions-2202.059552022-05-02 https://scifaro.com/en/abs/beyond-worst-case-analysis-for-root-isolation-algorithms-2202.064282022-09-28 https://scifaro.com/en/abs/parallel-repetition-for-all-3-player-games-over-binary-alphabet-2202.068262022-02-15 https://scifaro.com/en/abs/consensus-division-in-an-arbitrary-ratio-2202.069492022-11-30 https://scifaro.com/en/abs/hardness-of-the-approximate-shortest-vector-problem-a-simple-proof-via-reed-solomon-codes-2202.077362022-02-17 https://scifaro.com/en/abs/further-collapses-in-tfnp-2202.077612022-05-23 https://scifaro.com/en/abs/identity-testing-for-radical-expressions-2202.079612024-10-17 https://scifaro.com/en/abs/lower-bounds-for-subset-sum-in-resolution-with-modular-counting-2202.082142026-04-23 https://scifaro.com/en/abs/on-the-complexity-of-some-variations-of-sorting-by-transpositions-2202.083572022-02-18 https://scifaro.com/en/abs/improved-optimal-testing-results-from-global-hypercontractivity-2202.086882022-02-18 https://scifaro.com/en/abs/proofs-circuits-and-communication-2202.089092022-02-21 https://scifaro.com/en/abs/on-the-majority-is-least-stable-conjecture-2202.090242022-02-24 https://scifaro.com/en/abs/sorting-balls-and-water-equivalence-and-computational-complexity-2202.094952022-02-22 https://scifaro.com/en/abs/on-efficient-noncommutative-polynomial-factorization-via-higman-linearization-2202.098832025-05-27 https://scifaro.com/en/abs/np-hardness-of-a-2d-a-2-5d-and-a-3d-puzzle-game-2202.105292022-02-23 https://scifaro.com/en/abs/p-class-is-a-proper-subclass-of-np-class-and-more-2202.108462022-07-12 https://scifaro.com/en/abs/mathbf-vdf-subsetneq-mathbf-pspace-2202.109702022-11-14 https://scifaro.com/en/abs/tight-dynamic-problem-lower-bounds-from-generalized-bmm-and-omv-2202.112502022-02-24 https://scifaro.com/en/abs/on-the-complexity-of-chow-and-hurwitz-forms-2202.115822024-04-16 https://scifaro.com/en/abs/np-p-exists-pp-and-other-remarks-about-maximized-counting-2202.119552022-02-25 https://scifaro.com/en/abs/monotone-classes-beyond-vnp-2202.131032023-10-06 https://scifaro.com/en/abs/a-note-on-the-hardness-of-problems-from-cryptographic-group-actions-2202.138102022-03-01 https://scifaro.com/en/abs/maxcut-on-permutation-graphs-is-np-complete-2202.139552022-03-01 https://scifaro.com/en/abs/cnf-encodings-of-parity-2203.010822022-05-17 https://scifaro.com/en/abs/the-sherali-adams-hierarchy-for-promise-csps-through-tensors-2203.024782022-11-11 https://scifaro.com/en/abs/double-choco-is-np-complete-2203.028152022-03-08 https://scifaro.com/en/abs/a-reply-to-on-salum-s-algorithm-for-x3sat-2203.041422024-09-17 https://scifaro.com/en/abs/no-efficient-disjunction-or-conjunction-of-switch-lists-2203.047882022-03-10 https://scifaro.com/en/abs/quantum-and-classical-algorithms-for-bounded-distance-decoding-2203.050192022-03-11 https://scifaro.com/en/abs/a-proof-of-p-np-new-symmetric-encryption-algorithm-against-any-linear-attacks-and-differential-attacks-2203.050222026-05-01 https://scifaro.com/en/abs/testing-indexability-and-computing-whittle-and-gittins-index-in-subcubic-time-2203.052072023-06-23 https://scifaro.com/en/abs/realizing-implicit-computational-complexity-2203.052212022-05-26 https://scifaro.com/en/abs/maximum-cut-on-interval-graphs-of-interval-count-two-is-np-complete-2203.066302024-04-25 https://scifaro.com/en/abs/strategy-complexity-of-point-payoff-mean-payoff-and-total-payoff-objectives-in-countable-mdps-2203.070792023-06-22 https://scifaro.com/en/abs/multi-parameter-analysis-of-finding-minors-and-subgraphs-in-edge-periodic-temporal-graphs-2203.074012022-03-16 https://scifaro.com/en/abs/computational-complexity-of-multi-player-evolutionarily-stable-strategies-2203.074072022-03-16 https://scifaro.com/en/abs/modern-lower-bound-techniques-in-database-theory-and-constraint-satisfaction-2203.077172022-03-16 https://scifaro.com/en/abs/reachability-in-simple-neural-networks-2203.079412026-04-08 https://scifaro.com/en/abs/hardness-for-triangle-problems-under-even-more-believable-hypotheses-reductions-from-real-apsp-real-3sum-and-ov-2203.083562022-04-15 https://scifaro.com/en/abs/the-outlier-theorem-revisited-2203.087332023-06-27 https://scifaro.com/en/abs/greedy-algorithms-for-decision-trees-with-hypotheses-2203.088482022-03-18 https://scifaro.com/en/abs/decision-trees-with-hypotheses-for-recognition-of-monotone-boolean-functions-and-for-sorting-2203.088942022-03-18 https://scifaro.com/en/abs/on-the-complexity-of-techniques-that-make-transition-systems-implementable-by-boolean-nets-2203.092332026-04-08 https://scifaro.com/en/abs/on-the-problem-of-undirected-st-connectivity-2203.097282022-06-30 https://scifaro.com/en/abs/oracle-with-mathrm-p-np-cap-conp-but-no-many-one-completeness-in-up-disjnp-and-disjconp-2203.110792022-03-22 https://scifaro.com/en/abs/subset-sum-in-o-n-11-log-n-2203.116752022-12-08 https://scifaro.com/en/abs/new-distinguishers-for-negation-limited-weak-pseudorandom-functions-2203.122462022-03-24 https://scifaro.com/en/abs/constructive-separations-and-their-consequences-2203.143792024-08-07 https://scifaro.com/en/abs/algorithms-and-barriers-in-the-symmetric-binary-perceptron-model-2203.156672022-03-30 https://scifaro.com/en/abs/wordle-is-np-hard-2203.167132022-05-17 https://scifaro.com/en/abs/matrix-polynomial-factorization-via-higman-linearization-2203.169782022-04-01 https://scifaro.com/en/abs/the-legend-of-zelda-the-complexity-of-mechanics-2203.171672022-04-01 https://scifaro.com/en/abs/lower-bounds-for-uniform-read-once-threshold-formulae-in-the-randomized-decision-tree-model-2203.171682023-10-19 https://scifaro.com/en/abs/traversability-reconfiguration-and-reachability-in-the-gadget-framework-2204.006002023-11-16 https://scifaro.com/en/abs/polynomial-bounds-on-parallel-repetition-for-all-3-player-games-with-binary-inputs-2204.008582022-04-05 https://scifaro.com/en/abs/training-fully-connected-neural-networks-is-exists-mathbb-r-complete-2204.013682024-03-25 https://scifaro.com/en/abs/finding-a-winning-strategy-for-wordle-is-np-complete-2204.041042022-04-11 https://scifaro.com/en/abs/galactic-token-sliding-2204.055492022-04-13 https://scifaro.com/en/abs/linearly-ordered-colourings-of-hypergraphs-2204.056282023-02-03 https://scifaro.com/en/abs/1-extendability-of-independent-sets-2204.058092022-04-13 https://scifaro.com/en/abs/energy-complexity-of-regular-languages-2204.060252023-02-08 https://scifaro.com/en/abs/formal-language-recognition-by-hard-attention-transformers-perspectives-from-circuit-complexity-2204.066182022-04-15 https://scifaro.com/en/abs/comparison-communication-protocols-2204.080372022-04-19 https://scifaro.com/en/abs/optimal-coding-theorems-in-time-bounded-kolmogorov-complexity-2204.083122022-04-19 https://scifaro.com/en/abs/a-survey-on-the-parameterized-complexity-of-the-independent-set-and-connected-dominating-set-reconfiguration-problems-2204.105262022-04-25 https://scifaro.com/en/abs/a-ihara-bass-formula-for-non-boolean-matrices-and-strong-refutations-of-random-csps-2204.108812023-05-16 https://scifaro.com/en/abs/explicit-lower-bounds-against-omega-n-rounds-of-sum-of-squares-2204.114692022-04-26 https://scifaro.com/en/abs/mirror-games-against-an-open-book-player-2204.121292023-07-14 https://scifaro.com/en/abs/maxsat-with-absolute-value-functions-a-parameterized-perspective-2204.126142022-04-28 https://scifaro.com/en/abs/what-is-in-p-and-what-is-not-2204.131492022-04-29 https://scifaro.com/en/abs/enumerating-connected-dominating-sets-2205.000862022-05-03 https://scifaro.com/en/abs/baba-is-you-is-undecidable-2205.001272024-06-17 https://scifaro.com/en/abs/enumeration-classes-defined-by-circuits-2205.005392022-05-03 https://scifaro.com/en/abs/improved-low-depth-set-multilinear-circuit-lower-bounds-2205.006112022-05-03 https://scifaro.com/en/abs/superredundancy-a-tool-for-boolean-formula-minimization-complexity-analysis-2205.007622022-05-03 https://scifaro.com/en/abs/weighted-counting-of-matchings-in-unbounded-treewidth-graph-families-2205.008512023-01-10 https://scifaro.com/en/abs/token-sliding-on-graphs-of-girth-five-2205.010092022-05-03 https://scifaro.com/en/abs/a-critique-of-uribe-s-p-vs-np-2205.011892022-05-04 https://scifaro.com/en/abs/capacity-variation-in-the-many-to-one-stable-matching-2205.013022022-05-04 https://scifaro.com/en/abs/hardness-results-for-weaver-s-discrepancy-problem-2205.014822022-05-04 https://scifaro.com/en/abs/degree-restricted-strength-decompositions-and-algebraic-branching-programs-2205.021492022-12-27 https://scifaro.com/en/abs/is-the-algorithmic-kadison-singer-problem-hard-2205.021612022-11-04 https://scifaro.com/en/abs/separations-in-proof-complexity-and-tfnp-2205.021682024-08-13 https://scifaro.com/en/abs/sketching-approximability-of-weak-monarchy-predicates-2205.023452022-07-18 https://scifaro.com/en/abs/the-composition-complexity-of-majority-2205.023742022-05-18 https://scifaro.com/en/abs/streaming-and-sketching-complexity-of-csps-a-survey-2205.027442022-05-06 https://scifaro.com/en/abs/constrained-backward-time-travel-planning-is-in-p-2205.033722023-12-18 https://scifaro.com/en/abs/defying-gravity-the-complexity-of-the-hanano-puzzle-2205.034002023-04-27 https://scifaro.com/en/abs/bounds-on-the-total-coefficient-size-of-nullstellensatz-proofs-of-the-pigeonhole-principle-and-the-ordering-principle-2205.035772022-05-10 https://scifaro.com/en/abs/on-turedo-hierarchies-and-intrinsic-universality-2205.041032022-05-10 https://scifaro.com/en/abs/fixed-template-promise-model-checking-problems-2205.047872022-05-11 https://scifaro.com/en/abs/on-the-complexity-of-determining-whether-there-is-a-unique-hamiltonian-cycle-or-path-2205.057822022-05-13 https://scifaro.com/en/abs/optimal-degree-polynomial-approximations-for-exponentials-and-gaussian-kernel-density-estimation-2205.062492022-05-13 https://scifaro.com/en/abs/skew-sparse-matrix-multiplication-2205.064292022-05-16 https://scifaro.com/en/abs/sparsity-and-ell-p-restricted-isometry-2205.067382023-05-09 https://scifaro.com/en/abs/simple-hard-instances-for-low-depth-algebraic-proofs-2205.071752022-05-17 https://scifaro.com/en/abs/polynomial-formulations-as-a-barrier-for-reduction-based-hardness-proofs-2205.077092022-11-30 https://scifaro.com/en/abs/the-influence-of-dimensions-on-the-complexity-of-computing-decision-trees-2205.077562022-06-03 https://scifaro.com/en/abs/average-case-hardness-of-proving-tautologies-and-theorems-2205.078032022-07-21 https://scifaro.com/en/abs/on-algebraic-constructions-of-neural-networks-with-small-weights-2205.080322022-05-18 https://scifaro.com/en/abs/on-the-complexity-of-recognizing-stick-biphook-and-max-point-tolerance-graphs-2205.090762022-10-25 https://scifaro.com/en/abs/general-ramified-recurrence-and-polynomial-time-completeness-2205.103482022-05-23 https://scifaro.com/en/abs/modeling-asymptotic-complexity-using-acl2-2205.117002022-05-25 https://scifaro.com/en/abs/hardness-of-maximum-likelihood-learning-of-dpps-2205.123772026-02-27 https://scifaro.com/en/abs/qbf-merge-resolution-is-powerful-but-unnatural-2205.134282024-09-11 https://scifaro.com/en/abs/low-degree-polynomials-extract-from-local-sources-2205.137252022-05-30 https://scifaro.com/en/abs/theory-and-applications-of-probabilistic-kolmogorov-complexity-2205.147182022-05-31 https://scifaro.com/en/abs/subrank-and-optimal-reduction-of-scalar-multiplications-to-generic-tensors-2205.151682022-06-10 https://scifaro.com/en/abs/a-formula-for-the-determinant-2206.001342022-06-02 https://scifaro.com/en/abs/a-normal-form-for-matrix-multiplication-schemes-2206.005502022-06-02 https://scifaro.com/en/abs/real-time-constant-space-constant-randomness-verifiers-2206.009682022-06-03 https://scifaro.com/en/abs/on-the-parallel-parameterized-complexity-of-maxsat-variants-2206.012802022-06-06 https://scifaro.com/en/abs/a-relative-church-turing-deutsch-thesis-from-special-relativity-and-undecidability-2206.064192022-06-15 https://scifaro.com/en/abs/parameterized-complexity-results-for-bayesian-inference-2206.071722022-06-16 https://scifaro.com/en/abs/the-complexity-of-contracting-bipartite-graphs-into-small-cycles-2206.073582025-12-10 https://scifaro.com/en/abs/complexity-of-the-multiobjective-spanner-problem-2206.088052022-06-20 https://scifaro.com/en/abs/the-game-of-tumbleweed-is-pspace-complete-2206.094762022-06-22 https://scifaro.com/en/abs/parameterized-nl-completeness-of-combinatorial-problems-by-short-logarithmic-space-reductions-and-immediate-consequences-of-the-linear-space-hypothesis-2206.103892022-06-22 https://scifaro.com/en/abs/approximating-observables-is-as-hard-as-counting-2206.116062022-06-24 https://scifaro.com/en/abs/on-the-complexity-of-problems-on-tree-structured-graphs-2206.118282024-01-22 https://scifaro.com/en/abs/arithmetic-circuits-structured-matrices-and-not-so-deep-learning-2206.124902022-11-01 https://scifaro.com/en/abs/hardness-of-interval-scheduling-on-unrelated-machines-2206.128252022-06-28 https://scifaro.com/en/abs/which-arithmetic-operations-can-be-performed-in-constant-time-in-the-ram-model-with-addition-2206.138512023-02-22 https://scifaro.com/en/abs/subsequences-with-gap-constraints-complexity-bounds-for-matching-and-analysis-problems-2206.138962022-06-29 https://scifaro.com/en/abs/a-theoretical-computer-science-perspective-on-free-will-2206.139422024-05-17 https://scifaro.com/en/abs/slim-tree-cut-width-2206.150912022-07-01 https://scifaro.com/en/abs/on-the-number-of-quantifiers-as-a-complexity-measure-2207.001042022-07-05 https://scifaro.com/en/abs/the-parallelism-tradeoff-limitations-of-log-precision-transformers-2207.007292023-04-28 https://scifaro.com/en/abs/bounding-the-escape-time-of-a-linear-dynamical-system-over-a-compact-semialgebraic-set-2207.015502022-08-08 https://scifaro.com/en/abs/hierarchies-of-minion-tests-for-pcsps-through-tensors-2207.022772026-02-24 https://scifaro.com/en/abs/outliers-dynamics-and-the-independence-postulate-2207.039552022-07-28 https://scifaro.com/en/abs/turing-machines-cannot-simulate-the-human-mind-2207.057002022-07-13 https://scifaro.com/en/abs/on-the-complexity-of-identifying-strongly-regular-graphs-2207.059302023-03-22 https://scifaro.com/en/abs/deciding-fo-rewritability-of-regular-languages-and-ontology-mediated-queries-in-linear-temporal-logic-2207.062102023-03-16 https://scifaro.com/en/abs/pspace-completeness-of-reversible-deterministic-systems-2207.072292022-07-18 https://scifaro.com/en/abs/flow-augmentation-iii-complexity-dichotomy-for-boolean-csps-parameterized-by-the-number-of-unsatisfied-constraints-2207.074222025-04-23 https://scifaro.com/en/abs/the-computational-complexity-of-multi-player-concave-games-and-kakutani-fixed-points-2207.075572023-05-26 https://scifaro.com/en/abs/notes-on-boolean-read-k-and-multilinear-circuits-2207.087012023-11-23 https://scifaro.com/en/abs/polynomial-threshold-functions-for-decision-lists-2207.093712022-12-22 https://scifaro.com/en/abs/all-paths-lead-to-rome-2207.094392022-07-20 https://scifaro.com/en/abs/on-hardness-of-testing-equivalence-to-sparse-polynomials-under-shifts-2207.105882022-07-22 https://scifaro.com/en/abs/matching-triangles-and-triangle-collection-hardness-based-on-a-weak-quantum-conjecture-2207.110682022-07-25 https://scifaro.com/en/abs/parallelism-resource-of-numerical-algorithms-version-1-2207.119152022-07-26 https://scifaro.com/en/abs/low-complexity-low-probability-patterns-and-consequences-for-algorithmic-probability-applications-2207.122512022-07-26 https://scifaro.com/en/abs/component-twin-width-as-a-parameter-for-binary-csp-and-its-semiring-generalisations-2207.123682022-07-26 https://scifaro.com/en/abs/gacs-kucera-theorem-2207.124892022-08-23 https://scifaro.com/en/abs/pinned-distance-sets-using-effective-dimension-2207.125012022-08-16 https://scifaro.com/en/abs/searching-for-regularity-in-bounded-functions-2207.133122023-05-04 https://scifaro.com/en/abs/communication-complexity-of-collision-2208.000292022-08-11 https://scifaro.com/en/abs/a-point-to-set-principle-for-finite-state-dimension-2208.001572025-02-12 https://scifaro.com/en/abs/on-matrix-multiplication-and-polynomial-identity-testing-2208.010782024-04-18 https://scifaro.com/en/abs/on-the-computational-complexity-of-the-strong-geodetic-recognition-problem-2208.017962022-08-04 https://scifaro.com/en/abs/local-time-of-martin-lof-brownian-motion-2208.018772022-08-04 https://scifaro.com/en/abs/jumping-evaluation-of-nested-regular-path-queries-2208.030882022-08-08 https://scifaro.com/en/abs/an-optimal-it-ain-t-over-till-it-s-over-theorem-2208.034502022-08-19 https://scifaro.com/en/abs/solving-the-online-assignment-problem-with-machine-learned-advice-2208.040162022-08-09 https://scifaro.com/en/abs/combinatorial-optimization-via-the-sum-of-squares-hierarchy-2208.043742022-09-02 https://scifaro.com/en/abs/roman-census-enumerating-and-counting-roman-dominating-functions-on-graph-classes-2208.052612022-08-11 https://scifaro.com/en/abs/a-note-on-the-computational-complexity-of-selfmate-and-reflexmate-chess-problems-2208.053762022-08-11 https://scifaro.com/en/abs/avoider-enforcer-game-is-np-hard-2208.066872022-11-21 https://scifaro.com/en/abs/direct-sum-theorems-from-fortification-2208.077302023-10-17 https://scifaro.com/en/abs/partitioning-hypergraphs-is-hard-models-inapproximability-and-applications-2208.082572023-04-06 https://scifaro.com/en/abs/the-proper-conflict-free-k-coloring-problem-and-the-odd-k-coloring-problem-are-np-complete-on-bipartite-graphs-2208.083302025-08-15 https://scifaro.com/en/abs/constant-depth-sorting-networks-2208.083942022-08-18 https://scifaro.com/en/abs/embedding-arbitrary-boolean-circuits-into-fungal-automata-2208.087792022-08-19 https://scifaro.com/en/abs/turing-machines-with-two-level-memory-a-deep-look-into-the-input-output-complexity-2208.098032022-08-23 https://scifaro.com/en/abs/strong-xor-lemma-for-communication-with-bounded-rounds-2208.111522022-08-25 https://scifaro.com/en/abs/the-kolmogorov-birthday-paradox-2208.112372023-05-23 https://scifaro.com/en/abs/22-examples-of-solution-compression-via-derandomization-2208.115622023-04-25 https://scifaro.com/en/abs/on-the-existence-of-strong-proof-complexity-generators-2208.116422024-06-12 https://scifaro.com/en/abs/randomised-composition-and-small-bias-minimax-2208.128962022-08-30 https://scifaro.com/en/abs/an-invitation-to-the-promise-constraint-satisfaction-problem-2208.135382022-08-30 https://scifaro.com/en/abs/on-the-complexity-of-the-storyplan-problem-2209.004532022-09-07 https://scifaro.com/en/abs/the-approximate-degree-of-dnf-and-cnf-formulas-2209.015842022-09-07 https://scifaro.com/en/abs/induced-cycles-and-paths-are-harder-than-you-think-2209.018732022-09-07 https://scifaro.com/en/abs/concentration-of-polynomial-random-matrices-via-efron-stein-inequalities-2209.026552023-01-19 https://scifaro.com/en/abs/counting-subgraphs-in-somewhere-dense-graphs-2209.034022024-04-15 https://scifaro.com/en/abs/tensor-reconstruction-beyond-constant-rank-2209.041772022-09-12 https://scifaro.com/en/abs/on-identity-testing-and-noncommutative-rank-computation-over-the-free-skew-field-2209.047972022-09-13 https://scifaro.com/en/abs/structured-min-convolution-and-its-applications-for-the-shortest-vector-closest-vector-and-separable-nonlinear-knapsack-problems-2209.048122022-09-29 https://scifaro.com/en/abs/ppp-completeness-and-extremal-combinatorics-2209.048272022-09-13 https://scifaro.com/en/abs/on-finding-short-reconfiguration-sequences-between-independent-sets-2209.051452022-09-13 https://scifaro.com/en/abs/on-bounded-depth-proofs-for-tseitin-formulas-on-the-grid-revisited-2209.058392025-10-29 https://scifaro.com/en/abs/the-complexity-classes-of-hamming-distance-recoverable-robust-problems-2209.069392025-11-24 https://scifaro.com/en/abs/extremal-combinatorics-iterated-pigeonhole-arguments-and-generalizations-of-ppp-2209.076252022-09-19 https://scifaro.com/en/abs/b-coloring-parameterized-by-pathwidth-is-xnlp-complete-2209.077722022-09-19 https://scifaro.com/en/abs/approximate-traces-on-groups-and-the-quantum-complexity-class-operatorname-mip-co-s-2209.080092022-09-19 https://scifaro.com/en/abs/decision-tree-complexity-versus-block-sensitivity-and-degree-2209.080422022-09-19 https://scifaro.com/en/abs/better-hardness-results-for-the-minimum-spanning-tree-congestion-problem-2209.082192023-07-12 https://scifaro.com/en/abs/translationally-invariant-constraint-optimization-problems-2209.087312022-09-20 https://scifaro.com/en/abs/how-do-humans-succeed-in-tasks-like-proving-fermat-s-theorem-or-predicting-the-higgs-boson-2209.091212026-02-10 https://scifaro.com/en/abs/intrinsic-simulations-and-universality-in-automata-networks-2209.095272022-09-22 https://scifaro.com/en/abs/vest-is-w-2-hard-2209.097882022-09-21 https://scifaro.com/en/abs/characterizing-the-decidability-of-finite-state-automata-team-games-with-communication-2209.103242022-09-22 https://scifaro.com/en/abs/bqp-is-not-in-np-2209.103982022-09-22 https://scifaro.com/en/abs/downward-self-reducibility-in-tfnp-2209.105092023-12-27 https://scifaro.com/en/abs/solving-the-general-case-of-rank-3-maker-breaker-games-in-polynomial-time-2209.112022022-09-23 https://scifaro.com/en/abs/on-simple-decision-tree-rank-2209.128772022-09-27 https://scifaro.com/en/abs/quantum-inspired-perfect-matching-under-vertex-color-constraints-2209.130632023-05-02 https://scifaro.com/en/abs/polynomial-time-computable-functions-over-the-reals-characterized-using-discrete-ordinary-differential-equations-2209.134042022-11-17 https://scifaro.com/en/abs/a-characterization-of-polynomial-time-computable-functions-from-the-integers-to-the-reals-using-discrete-ordinary-differential-equations-2209.135992022-10-04 https://scifaro.com/en/abs/quantum-invariants-for-the-graph-isomorphism-problem-2209.149142022-10-07 https://scifaro.com/en/abs/pure-circuit-tight-inapproximability-for-ppad-2209.151492024-09-13 https://scifaro.com/en/abs/a-multivariate-complexity-analysis-of-qualitative-reasoning-problems-2209.152752022-10-03 https://scifaro.com/en/abs/exploring-p-versus-np-2209.154102024-03-26 https://scifaro.com/en/abs/beyond-the-existential-theory-of-the-reals-2210.005712025-03-04 https://scifaro.com/en/abs/notions-of-tensor-rank-2210.011832023-06-16 https://scifaro.com/en/abs/the-complexity-of-online-graph-games-2210.016942023-11-28 https://scifaro.com/en/abs/on-convexity-in-split-graphs-complexity-of-steiner-tree-and-domination-2210.022882022-10-06 https://scifaro.com/en/abs/on-the-complexity-of-symmetric-vs-functional-pcsps-2210.033432024-08-19 https://scifaro.com/en/abs/superpolynomial-lower-bounds-for-decision-tree-learning-and-testing-2210.063752022-10-13 https://scifaro.com/en/abs/computing-the-best-case-energy-complexity-of-satisfying-assignments-in-monotone-circuits-2210.067392022-10-14 https://scifaro.com/en/abs/the-fine-grained-complexity-of-graph-homomorphism-parameterized-by-clique-width-2210.068452022-10-14 https://scifaro.com/en/abs/hard-to-detect-factors-of-univariate-integer-polynomials-2210.070302022-10-14 https://scifaro.com/en/abs/approximate-graph-colouring-and-crystals-2210.082932022-10-18 https://scifaro.com/en/abs/on-depth-3-circuits-and-covering-number-an-explicit-counter-example-2210.083002022-10-18 https://scifaro.com/en/abs/list-homomorphisms-by-deleting-edges-and-vertices-tight-complexity-bounds-for-bounded-treewidth-graphs-2210.106772024-02-14 https://scifaro.com/en/abs/on-universality-of-the-s-combinator-2210.128932022-10-26 https://scifaro.com/en/abs/list-agreement-expansion-from-coboundary-expansion-2210.157142022-10-31 https://scifaro.com/en/abs/the-isotropy-group-of-the-matrix-multiplication-tensor-2210.165652022-11-01 https://scifaro.com/en/abs/the-power-of-the-binary-value-principle-2210.174292022-11-30 https://scifaro.com/en/abs/polynomial-identity-testing-via-evaluation-of-rational-functions-2211.010622025-01-06 https://scifaro.com/en/abs/improved-inapproximability-of-vc-dimension-and-littlestone-s-dimension-via-unbalanced-biclique-2211.014432022-11-04 https://scifaro.com/en/abs/complexity-of-simon-s-problem-in-classical-sense-2211.017762022-11-04 https://scifaro.com/en/abs/the-complexity-of-pattern-counting-in-directed-graphs-parameterised-by-the-outdegree-2211.019052022-11-04 https://scifaro.com/en/abs/certification-with-an-np-oracle-2211.022572022-11-07 https://scifaro.com/en/abs/parity-games-of-bounded-tree-depth-2211.029262022-11-08 https://scifaro.com/en/abs/approximate-graph-colouring-and-the-crystal-with-a-hollow-shadow-2211.031682025-08-21 https://scifaro.com/en/abs/polynomial-kernels-for-generalized-domination-problems-2211.033652022-11-10 https://scifaro.com/en/abs/certificate-games-and-consequences-for-the-classical-adversary-bound-2211.033962025-03-12 https://scifaro.com/en/abs/non-existence-of-a-short-algorithm-for-multiplication-of-3-times3-matrices-with-group-s-4-times-s-3-2211.034042022-11-08 https://scifaro.com/en/abs/nearly-optimal-independence-oracle-algorithms-for-edge-estimation-in-hypergraphs-2211.038742024-04-29 https://scifaro.com/en/abs/non-existence-of-a-short-algorithm-for-multiplication-of-3-times3-matrices-with-group-s-4-times-s-3-ii-2211.040322022-11-09 https://scifaro.com/en/abs/tight-complexity-bounds-for-counting-generalized-dominating-sets-in-bounded-treewidth-graphs-part-i-algorithmic-results-2211.042782025-04-22 https://scifaro.com/en/abs/why-we-couldn-t-prove-seth-hardness-of-the-closest-vector-problem-for-even-norms-2211.043852023-11-28 https://scifaro.com/en/abs/basis-for-a-vector-space-generated-by-hamiltonian-time-paths-in-a-complete-time-graph-2211.050692022-11-10 https://scifaro.com/en/abs/average-case-complexity-of-tensor-decomposition-for-low-degree-polynomials-2211.052742023-03-28 https://scifaro.com/en/abs/parameterized-complexity-of-weighted-local-hamiltonian-problems-and-the-quantum-exponential-time-hypothesis-2211.053252022-11-11 https://scifaro.com/en/abs/description-graphs-matrix-power-stabilizations-and-graph-isomorphism-in-polynomial-time-2211.056372023-01-25 https://scifaro.com/en/abs/a-parameterized-halting-problem-delta-0-truth-and-the-mrdp-theorem-2211.061212022-11-14 https://scifaro.com/en/abs/on-automorphism-group-of-a-possible-short-algorithm-for-multiplication-of-3-times3-matrices-2211.064852022-11-15 https://scifaro.com/en/abs/geometric-complexity-theory-for-product-plus-power-2211.070552025-05-29 https://scifaro.com/en/abs/counterfactual-analysis-by-algorithmic-complexity-a-metric-between-possible-worlds-2211.073152022-11-15 https://scifaro.com/en/abs/on-the-smoothed-complexity-of-combinatorial-local-search-2211.075472025-09-24 https://scifaro.com/en/abs/low-depth-arithmetic-circuit-lower-bounds-via-shifted-partials-2211.076912022-11-16 https://scifaro.com/en/abs/parameterized-inapproximability-of-the-minimum-distance-problem-over-all-fields-and-the-shortest-vector-problem-in-all-ell-p-norms-2211.079002024-02-28 https://scifaro.com/en/abs/a-theory-for-discrete-time-boolean-finite-dynamical-systems-with-uncertainty-2211.079232022-11-16 https://scifaro.com/en/abs/complexity-results-for-implication-bases-of-convex-geometries-2211.085242022-11-17 https://scifaro.com/en/abs/the-wrong-direction-of-jensen-s-inequality-is-algorithmically-right-2211.085632022-11-17 https://scifaro.com/en/abs/the-exact-bipartite-matching-polytope-has-exponential-extension-complexity-2211.091062022-11-17 https://scifaro.com/en/abs/improved-monotonicity-testers-via-hypercube-embeddings-2211.092292022-11-18 https://scifaro.com/en/abs/approaching-the-soundness-barrier-a-near-optimal-analysis-of-the-cube-versus-cube-test-2211.093412022-11-18 https://scifaro.com/en/abs/unique-neighbor-like-expansion-and-group-independent-cosystolic-expansion-2211.094822022-11-18 https://scifaro.com/en/abs/double-balanced-sets-in-high-dimensional-expanders-2211.094852022-11-18 https://scifaro.com/en/abs/rounding-via-low-dimensional-embeddings-2211.097292022-11-18 https://scifaro.com/en/abs/computational-short-cuts-in-infinite-domain-constraint-satisfaction-2211.101442022-11-21 https://scifaro.com/en/abs/lattice-problems-beyond-polynomial-time-2211.116932022-11-22 https://scifaro.com/en/abs/celeste-is-pspace-hard-2211.118392022-11-23 https://scifaro.com/en/abs/edge-multiway-cut-and-node-multiway-cut-are-np-complete-on-subcubic-graphs-2211.122032024-08-20 https://scifaro.com/en/abs/odd-paths-cycles-and-t-joins-connections-and-algorithms-2211.128622023-06-21 https://scifaro.com/en/abs/the-stochastic-arrival-problem-2211.129822024-09-17 https://scifaro.com/en/abs/communication-complexity-of-inner-product-in-symmetric-normed-spaces-2211.134732022-11-28 https://scifaro.com/en/abs/parallel-repetition-for-the-ghz-game-exponential-decay-2211.137412022-11-28 https://scifaro.com/en/abs/approximating-the-chromatic-polynomial-is-as-hard-as-computing-it-exactly-2211.137902023-11-14 https://scifaro.com/en/abs/extractors-for-images-of-varieties-2211.144972023-01-18 https://scifaro.com/en/abs/derandomization-under-different-resource-constraints-2211.146402023-09-13 https://scifaro.com/en/abs/hardness-results-for-minimizing-the-covariance-of-randomly-signed-sum-of-vectors-2211.146582022-11-29 https://scifaro.com/en/abs/symmetric-formulas-for-products-of-permutations-2211.155202022-11-29 https://scifaro.com/en/abs/query-complexity-of-boolean-functions-on-slices-2211.164022022-11-30 https://scifaro.com/en/abs/opinion-evolution-among-friends-and-foes-the-deterministic-majority-rule-extended-abstract-2211.171592022-12-01 https://scifaro.com/en/abs/on-disperser-lifting-properties-of-the-index-and-inner-product-functions-2211.172112022-12-21 https://scifaro.com/en/abs/lifting-to-parity-decision-trees-via-stifling-2211.172142023-10-19 https://scifaro.com/en/abs/the-smoothed-complexity-of-policy-iteration-for-markov-decision-processes-2212.000832022-12-02 https://scifaro.com/en/abs/complexity-blowup-for-solutions-of-the-laplace-and-the-diffusion-equation-2212.006932023-09-13 https://scifaro.com/en/abs/inapproximability-of-counting-independent-sets-in-linear-hypergraphs-2212.030722023-09-29 https://scifaro.com/en/abs/partial-gathering-of-mobile-agents-in-dynamic-rings-2212.034572024-05-21 https://scifaro.com/en/abs/recognizing-when-a-preference-system-is-close-to-admitting-a-master-list-2212.035212022-12-13 https://scifaro.com/en/abs/on-the-strong-metric-dimension-of-composed-graphs-2212.041662022-12-09 https://scifaro.com/en/abs/a-lower-bound-on-the-constant-in-the-fourier-min-entropy-influence-conjecture-2212.077132024-01-19 https://scifaro.com/en/abs/a-graphical-sat-algorithm-for-formulae-with-small-clause-density-2212.080482024-08-13 https://scifaro.com/en/abs/criticality-of-text-ac-0-formulae-2212.083972023-01-06 https://scifaro.com/en/abs/localizability-of-the-approximation-method-2212.092852022-12-20 https://scifaro.com/en/abs/separating-max-2-and-max-di-cut-and-max-cut-2212.111912023-04-13 https://scifaro.com/en/abs/a-graph-transformational-approach-for-proving-the-correctness-of-reductions-between-np-problems-2212.116272022-12-23 https://scifaro.com/en/abs/some-results-on-approximability-of-minimum-sum-vertex-cover-2212.118822022-12-23 https://scifaro.com/en/abs/a-closer-look-at-some-recent-proof-compression-related-claims-2212.121502022-12-26 https://scifaro.com/en/abs/optimizing-the-half-gcd-algorithm-2212.123892022-12-26 https://scifaro.com/en/abs/on-the-complexity-of-generalized-discrete-logarithm-problem-2212.125772022-12-27 https://scifaro.com/en/abs/matrix-multiplication-verifying-strong-uniquely-solvable-puzzles-2301.000742023-01-03 https://scifaro.com/en/abs/power-of-decision-trees-with-monotone-queries-2301.001362023-01-03 https://scifaro.com/en/abs/improved-np-hardness-of-approximation-for-orthogonality-dimension-and-minrank-2301.007322023-11-16 https://scifaro.com/en/abs/on-the-complexity-of-sub-tree-scheduling-for-wireless-sensor-networks-with-partial-coverage-2301.007392023-01-03 https://scifaro.com/en/abs/new-lower-bounds-against-homogeneous-non-commutative-circuits-2301.016762023-01-05 https://scifaro.com/en/abs/parameterised-and-fine-grained-subgraph-counting-modulo-2-2301.016962023-10-12 https://scifaro.com/en/abs/streaming-zero-knowledge-proofs-2301.021612024-05-28 https://scifaro.com/en/abs/representing-matroids-over-the-reals-is-exists-mathbb-r-complete-2301.032212024-08-21 https://scifaro.com/en/abs/exceeding-computational-complexity-trial-and-error-dynamic-action-and-intelligence-2301.033842023-01-10 https://scifaro.com/en/abs/a-critique-of-sopin-s-rm-ph-rm-pspace-2301.034872023-01-10 https://scifaro.com/en/abs/a-functorial-perspective-on-multi-computational-irreducibility-2301.046902023-01-13 https://scifaro.com/en/abs/hardness-of-ruling-out-short-proofs-of-kolmogorov-randomness-2301.047892023-03-20 https://scifaro.com/en/abs/streaming-lower-bounds-and-asymmetric-set-disjointness-2301.056582023-01-16 https://scifaro.com/en/abs/cumulative-memory-lower-bounds-for-randomized-and-quantum-computation-2301.056802023-07-06 https://scifaro.com/en/abs/forced-capture-hnefatafl-2301.061272023-06-21 https://scifaro.com/en/abs/polynomial-time-axioms-of-choice-and-polynomial-time-cardinality-2301.071232023-01-19 https://scifaro.com/en/abs/pseudorandom-generators-for-sliding-window-algorithms-2301.073842023-01-19 https://scifaro.com/en/abs/a-quantum-el-theorem-2301.083482023-01-23 https://scifaro.com/en/abs/treewidth-is-np-complete-on-cubic-graphs-and-related-results-2301.100312023-03-03 https://scifaro.com/en/abs/improved-pseudorandom-generators-for-mathsf-ac-0-circuits-2301.101022023-01-25 https://scifaro.com/en/abs/bqp-pspace-2301.105572023-06-27 https://scifaro.com/en/abs/turing-machines-equipped-with-ctc-in-physical-universes-2301.116322023-01-30 https://scifaro.com/en/abs/an-arithmetic-theory-for-the-poly-time-random-functions-2301.120282023-02-08 https://scifaro.com/en/abs/rethinking-npn-classification-from-face-and-point-characteristics-of-boolean-functions-2301.121222023-01-31 https://scifaro.com/en/abs/measuring-robustness-of-dynamical-systems-relating-time-and-space-to-length-and-precision-2301.127232024-02-08 https://scifaro.com/en/abs/this-game-is-not-going-to-analyze-itself-2302.011452023-11-16 https://scifaro.com/en/abs/complexity-of-solo-chess-with-unlimited-moves-2302.014052023-02-06 https://scifaro.com/en/abs/diagnosis-of-constant-faults-in-switching-networks-2302.027562023-02-07 https://scifaro.com/en/abs/noisy-decoding-by-shallow-circuits-with-parities-classical-and-quantum-2302.028702024-01-25 https://scifaro.com/en/abs/1-in-3-vs-not-all-equal-dichotomy-of-a-broken-promise-2302.034562025-05-09 https://scifaro.com/en/abs/on-the-computational-complexity-of-ethics-moral-tractability-for-minds-and-machines-2302.042182023-02-09 https://scifaro.com/en/abs/nonlinear-random-matrices-and-applications-to-the-sum-of-squares-hierarchy-2302.044622023-02-10 https://scifaro.com/en/abs/secret-sharing-on-superconcentrator-2302.044822026-03-02 https://scifaro.com/en/abs/hardness-of-monadic-second-order-formulae-over-succinct-graphs-2302.045222026-01-14 https://scifaro.com/en/abs/find-a-witness-or-shatter-the-landscape-of-computable-pac-learning-2302.047312023-02-24 https://scifaro.com/en/abs/lower-bounds-for-choiceless-polynomial-time-via-symmetric-xor-circuits-2302.054262023-02-13 https://scifaro.com/en/abs/compositional-algorithms-on-compositional-data-deciding-sheaves-on-presheaves-2302.055752023-10-05 https://scifaro.com/en/abs/partial-k-means-to-avoid-outliers-mathematical-programming-formulations-complexity-results-2302.056442023-06-01 https://scifaro.com/en/abs/on-the-existence-of-anomalies-2302.059722023-02-14 https://scifaro.com/en/abs/computation-with-large-advice-2302.060122023-04-17 https://scifaro.com/en/abs/proving-unsatisfiability-with-hitting-formulas-2302.062412024-08-16 https://scifaro.com/en/abs/geometric-barriers-for-stable-and-online-algorithms-for-discrepancy-minimization-2302.064852023-02-14 https://scifaro.com/en/abs/towards-optimal-depth-reductions-for-algebraic-formulas-2302.069842023-02-15 https://scifaro.com/en/abs/bounds-on-depth-of-decision-trees-derived-from-decision-rule-systems-2302.070632023-02-15 https://scifaro.com/en/abs/some-implications-of-the-independence-postulate-for-physics-2302.076492024-08-16 https://scifaro.com/en/abs/the-computational-complexity-of-quantum-determinants-2302.080832023-02-17 https://scifaro.com/en/abs/the-complexity-of-graph-exploration-games-2302.084202024-12-02 https://scifaro.com/en/abs/the-complexity-of-counting-planar-graph-homomorphisms-of-domain-size-3-2302.085702023-02-20 https://scifaro.com/en/abs/a-new-approach-for-a-proof-that-p-is-np-2302.090242023-02-20 https://scifaro.com/en/abs/a-tight-lower-bound-for-compact-set-packing-2302.092202023-02-21 https://scifaro.com/en/abs/sat-requires-exhaustive-search-2302.095122025-07-08 https://scifaro.com/en/abs/kernelizing-temporal-exploration-problems-2302.101102023-02-21 https://scifaro.com/en/abs/a-note-on-the-partition-bound-for-one-way-classical-communication-complexity-2302.104312023-02-22 https://scifaro.com/en/abs/complexity-of-maker-breaker-games-on-edge-sets-of-graphs-2302.109722024-11-18 https://scifaro.com/en/abs/approximability-of-the-four-vertex-model-2302.113362023-05-04 https://scifaro.com/en/abs/hitting-the-romans-2302.114172023-02-23 https://scifaro.com/en/abs/matrix-multiplication-and-number-on-the-forehead-communication-2302.114762023-02-23 https://scifaro.com/en/abs/cutting-barnette-graphs-perfectly-is-hard-2302.116672023-02-24 https://scifaro.com/en/abs/generative-models-of-huge-objects-2302.128232023-02-27 https://scifaro.com/en/abs/the-hardness-of-optimization-problems-on-the-weighted-massively-parallel-computation-model-2302.129532023-06-21 https://scifaro.com/en/abs/logical-characterization-of-algebraic-circuit-classes-over-integral-domains-2302.137642023-02-28 https://scifaro.com/en/abs/is-planted-coloring-easier-than-planted-clique-2303.002522023-03-02 https://scifaro.com/en/abs/on-the-consistency-of-circuit-lower-bounds-for-non-deterministic-time-2303.010162023-08-29 https://scifaro.com/en/abs/complexity-of-reasoning-with-cardinality-minimality-conditions-2303.015712023-03-06 https://scifaro.com/en/abs/approximate-degree-lower-bounds-for-oracle-identification-problems-2303.039212023-05-23 https://scifaro.com/en/abs/the-linear-correlation-of-p-and-np-2303.039582023-03-08 https://scifaro.com/en/abs/range-avoidance-for-constant-depth-circuits-hardness-and-algorithms-2303.050442023-07-10 https://scifaro.com/en/abs/on-the-existence-of-anomalies-the-reals-case-2303.056142024-05-14 https://scifaro.com/en/abs/how-to-compress-the-solution-2303.056162023-09-08 https://scifaro.com/en/abs/uniform-tests-and-algorithmic-thermodynamic-entropy-2303.056192023-08-01 https://scifaro.com/en/abs/dag-scheduling-in-the-bsp-model-2303.059892024-07-18 https://scifaro.com/en/abs/multivariate-to-bivariate-reduction-for-noncommutative-polynomial-factorization-2303.060012023-03-13 https://scifaro.com/en/abs/a-quantum-outlier-theorem-2303.062562023-03-14 https://scifaro.com/en/abs/two-source-extractors-for-asymptotically-optimal-entropy-and-many-more-2303.068022023-05-31 https://scifaro.com/en/abs/coloring-a-dominating-set-without-conflicts-q-subset-square-coloring-2303.068642023-03-14 https://scifaro.com/en/abs/on-the-algorithmic-information-between-probabilities-2303.072962024-09-12 https://scifaro.com/en/abs/on-the-parameterized-complexity-of-relaxations-of-clique-2303.104902023-03-23 https://scifaro.com/en/abs/being-an-influencer-is-hard-the-complexity-of-influence-maximization-in-temporal-graphs-with-a-fixed-source-2303.117032023-03-24 https://scifaro.com/en/abs/moment-cone-membership-for-quivers-in-strongly-polynomial-time-2303.148212023-03-28 https://scifaro.com/en/abs/complexity-of-reconfiguration-in-surface-chemical-reaction-networks-2303.155562023-10-27 https://scifaro.com/en/abs/certified-hardness-vs-randomness-for-log-space-2303.164132023-03-30 https://scifaro.com/en/abs/planar-3-way-edge-perfect-matching-leads-to-a-holant-dichotomy-2303.167052023-03-30 https://scifaro.com/en/abs/training-neural-networks-is-np-hard-in-fixed-dimension-2303.170452024-01-19 https://scifaro.com/en/abs/sum-of-squares-lower-bounds-for-densest-k-subgraph-2303.175062023-03-31 https://scifaro.com/en/abs/the-communication-complexity-of-functions-with-large-outputs-2304.003912023-04-04 https://scifaro.com/en/abs/ruling-out-short-proofs-of-unprovable-sentences-is-hard-2304.006102023-04-04 https://scifaro.com/en/abs/k-sum-in-the-sparse-regime-2304.017872023-11-22 https://scifaro.com/en/abs/picturing-counting-reductions-with-the-zh-calculus-2304.025242023-09-01 https://scifaro.com/en/abs/top-down-lower-bounds-for-depth-four-circuits-2304.025552024-05-03 https://scifaro.com/en/abs/tight-correlation-bounds-for-circuits-between-ac0-and-tc0-2304.027702023-05-23 https://scifaro.com/en/abs/inapproximability-of-sufficient-reasons-for-decision-trees-2304.027812023-04-07 https://scifaro.com/en/abs/improved-hardness-of-approximating-k-clique-under-eth-2304.029432023-09-27 https://scifaro.com/en/abs/the-complexity-of-decomposing-a-graph-into-a-matching-and-a-bounded-linear-forest-2304.032562023-04-10 https://scifaro.com/en/abs/no-existence-of-generalize-diffusion-2304.039602023-04-19 https://scifaro.com/en/abs/the-n-vehicle-exploration-problem-is-np-complete-2304.039652024-09-17 https://scifaro.com/en/abs/geometry-of-rounding-near-optimal-bounds-and-a-new-neighborhood-sperner-s-lemma-2304.048372023-04-12 https://scifaro.com/en/abs/optimal-testing-of-generalized-reed-muller-codes-in-fewer-queries-2304.055982023-04-14 https://scifaro.com/en/abs/the-2-attractor-problem-is-np-complete-2304.065232024-02-08 https://scifaro.com/en/abs/solving-unique-games-over-globally-hypercontractive-graphs-2304.072842023-04-17 https://scifaro.com/en/abs/simple-combinatorial-construction-of-the-k-o-1-lower-bound-for-approximating-the-parameterized-k-clique-2304.075162024-08-12 https://scifaro.com/en/abs/on-modeling-np-complete-problems-as-polynomial-sized-linear-programs-escaping-side-stepping-the-barriers-2304.077162024-08-19 https://scifaro.com/en/abs/regression-and-algorithmic-information-theory-2304.078252023-04-18 https://scifaro.com/en/abs/limits-of-cdcl-learning-via-merge-resolution-2304.094222023-04-20 https://scifaro.com/en/abs/comparative-analysis-of-deterministic-and-nondeterministic-decision-trees-for-decision-tables-from-closed-classes-2304.105942023-04-24 https://scifaro.com/en/abs/a-conjecture-related-to-the-traveling-salesman-problem-2304.106612023-04-24 https://scifaro.com/en/abs/black-box-acceleration-of-las-vegas-algorithms-and-algorithmic-reverse-jensen-s-inequalities-2304.110172023-07-11 https://scifaro.com/en/abs/deterministic-identity-testing-paradigms-for-bounded-top-fanin-depth-4-circuits-2304.113252023-04-26 https://scifaro.com/en/abs/explicit-directional-affine-extractors-and-improved-hardness-for-linear-branching-programs-2304.114952024-07-04 https://scifaro.com/en/abs/an-efficient-algorithm-for-solving-the-2-maxsat-problem-2304.125172025-08-05 https://scifaro.com/en/abs/on-the-order-of-power-series-and-the-sum-of-square-roots-problem-2304.136052023-04-27 https://scifaro.com/en/abs/a-parameterized-theory-of-pac-learning-2304.140582023-04-28 https://scifaro.com/en/abs/on-solution-discovery-via-reconfiguration-2304.142952023-04-28 https://scifaro.com/en/abs/a-critique-of-czerwinski-s-separation-of-rm-pspace-and-rm-exp-2304.145752023-05-01 https://scifaro.com/en/abs/stretching-demi-bits-and-nondeterministic-secure-pseudorandomness-2304.147002025-01-14 https://scifaro.com/en/abs/upward-translation-of-optimal-and-p-optimal-proof-systems-in-the-boolean-hierarchy-over-np-2304.147022023-09-22 https://scifaro.com/en/abs/the-iteration-time-and-the-general-position-number-in-graph-convexities-2305.004672023-10-26 https://scifaro.com/en/abs/an-approach-to-circuit-lower-bounds-via-bounded-width-circuits-2305.007942023-05-02 https://scifaro.com/en/abs/approximate-evaluation-of-quantitative-second-order-queries-2305.020562023-05-04 https://scifaro.com/en/abs/p-not-np-relative-to-a-p-complete-oracle-2305.022262023-05-04 https://scifaro.com/en/abs/l-is-unequal-nl-under-the-strong-exponential-time-hypothesis-2305.022712023-05-04 https://scifaro.com/en/abs/on-the-parameterized-complexity-of-the-perfect-phylogeny-problem-2305.028002023-11-28 https://scifaro.com/en/abs/on-optimization-and-counting-of-non-broken-bases-of-matroids-2305.033072023-05-08 https://scifaro.com/en/abs/on-guarded-extensions-of-mmsnp-2305.042342025-11-05 https://scifaro.com/en/abs/sampling-and-certifying-symmetric-functions-2305.043632023-05-09 https://scifaro.com/en/abs/structural-complexity-of-rational-interactive-proofs-2305.045632023-05-09 https://scifaro.com/en/abs/count-on-cfi-graphs-for-p-hardness-2305.047672023-05-09 https://scifaro.com/en/abs/the-computational-complexity-of-equilibria-with-strategic-constraints-2305.049182023-05-09 https://scifaro.com/en/abs/low-degree-testing-over-grids-2305.049832024-11-12 https://scifaro.com/en/abs/scheme-theoretic-approach-to-computational-complexity-iii-seth-2305.054152024-02-23 https://scifaro.com/en/abs/scheme-theoretic-approach-to-computational-complexity-iv-a-new-perspective-on-hardness-of-approximation-2305.056762024-02-23 https://scifaro.com/en/abs/on-the-information-capacity-of-nearest-neighbor-representations-2305.058082023-05-11 https://scifaro.com/en/abs/deterministic-and-strongly-nondeterministic-decision-trees-for-decision-tables-from-closed-classes-2305.060932024-11-18 https://scifaro.com/en/abs/constant-depth-circuits-vs-monotone-circuits-2305.068212023-05-12 https://scifaro.com/en/abs/improved-lower-bounds-for-monotone-q-multilinear-boolean-circuits-2305.073642023-05-15 https://scifaro.com/en/abs/the-sharp-power-law-of-local-search-on-expanders-2305.082692023-08-16 https://scifaro.com/en/abs/border-complexity-of-symbolic-determinant-under-rank-one-restriction-2305.099732023-05-18 https://scifaro.com/en/abs/the-noncommutative-edmonds-problem-re-visited-2305.099842023-05-18 https://scifaro.com/en/abs/on-the-computational-complexity-of-generalized-common-shape-puzzles-2305.107492023-05-19 https://scifaro.com/en/abs/perspective-on-complexity-measures-targetting-read-once-branching-programs-2305.112762023-05-22 https://scifaro.com/en/abs/on-the-approximability-and-energy-flow-modeling-of-the-electric-vehicle-sharing-problem-2305.121762023-05-23 https://scifaro.com/en/abs/the-airplane-refueling-problem-is-np-complete-and-is-solvable-in-polynomial-time-2305.124782023-05-23 https://scifaro.com/en/abs/perfect-information-hearthstone-is-pspace-hard-2305.127312023-05-23 https://scifaro.com/en/abs/marriage-and-roommate-2305.128412023-05-23 https://scifaro.com/en/abs/heuristics-optimization-of-boolean-circuits-with-application-in-attribute-based-encryption-2305.130082025-09-26 https://scifaro.com/en/abs/polynomial-time-pseudodeterministic-construction-of-primes-2305.151402025-12-05 https://scifaro.com/en/abs/unprovability-of-strong-complexity-lower-bounds-in-bounded-arithmetic-2305.152352023-05-25 https://scifaro.com/en/abs/a-fast-algorithm-for-consistency-checking-partially-ordered-time-2305.159172023-05-26 https://scifaro.com/en/abs/improved-algorithms-for-allen-s-interval-algebra-by-dynamic-programming-with-sublinear-partitioning-2305.159502023-05-26 https://scifaro.com/en/abs/can-you-solve-closest-string-faster-than-exhaustive-search-2305.168782023-05-30 https://scifaro.com/en/abs/hardness-of-approximation-in-pspace-and-separation-results-for-pebble-games-2305.191042023-05-31 https://scifaro.com/en/abs/solving-projected-model-counting-by-utilizing-treewidth-and-its-limits-2305.192122023-06-01 https://scifaro.com/en/abs/on-the-algebraic-proof-complexity-of-tensor-isomorphism-2305.193202023-06-01 https://scifaro.com/en/abs/graph-colouring-is-hard-for-algorithms-based-on-hilbert-s-nullstellensatz-and-gr-o-bner-bases-2306.001252023-06-02 https://scifaro.com/en/abs/toward-better-depth-lower-bounds-a-krw-like-theorem-for-strong-composition-2306.006152025-02-13 https://scifaro.com/en/abs/bounds-on-bdd-based-bucket-elimination-2306.008862023-06-02 https://scifaro.com/en/abs/the-maximum-matrix-contraction-problem-2306.013492023-06-05 https://scifaro.com/en/abs/discreteness-of-asymptotic-tensor-ranks-2306.017182025-09-11 https://scifaro.com/en/abs/polynomial-identity-testing-and-the-ideal-proof-system-pit-is-in-np-if-and-only-if-ips-can-be-p-simulated-by-a-cook-reckhow-proof-system-2306.021842023-06-06 https://scifaro.com/en/abs/on-approximability-of-steiner-tree-in-ell-p-metrics-2306.021892025-01-29 https://scifaro.com/en/abs/on-the-complexity-of-isomorphism-problems-for-tensors-groups-and-polynomials-iii-actions-by-classical-groups-2306.031352024-08-13 https://scifaro.com/en/abs/tight-complexity-bounds-for-counting-generalized-dominating-sets-in-bounded-treewidth-graphs-part-ii-hardness-results-2306.036402023-06-07 https://scifaro.com/en/abs/an-exponential-envy-free-cake-cutting-protocol-for-n-agents-2306.038542023-06-07 https://scifaro.com/en/abs/complexity-of-reachability-problems-in-neural-networks-2306.058182023-06-12 https://scifaro.com/en/abs/verification-of-np-hardness-reduction-functions-for-exact-lattice-problems-2306.083752023-06-16 https://scifaro.com/en/abs/a-note-on-the-complexity-of-addition-2306.085132023-06-16 https://scifaro.com/en/abs/the-directed-metric-dimension-of-directed-co-graphs-2306.085942023-06-16 https://scifaro.com/en/abs/on-the-k-hamming-and-k-edit-distances-2306.091442023-06-16 https://scifaro.com/en/abs/rm-p-has-polynomial-time-finite-state-verifiers-2306.095422025-12-17 https://scifaro.com/en/abs/approximate-model-counting-is-sat-oracle-more-powerful-than-np-oracle-2306.102812023-06-21 https://scifaro.com/en/abs/on-the-power-of-counting-the-total-number-of-computation-paths-of-nptms-2306.116142024-10-11 https://scifaro.com/en/abs/sleptsov-nets-are-turing-complete-2306.124402023-12-18 https://scifaro.com/en/abs/preprocessing-complexity-for-some-graph-problems-parameterized-by-structural-parameters-2306.126552023-06-23 https://scifaro.com/en/abs/on-the-distribution-of-sensitivities-of-symmetric-boolean-functions-2306.144012023-06-27 https://scifaro.com/en/abs/a-note-on-the-natural-range-of-unambiguous-sat-2306.147792024-11-25 https://scifaro.com/en/abs/algorithmics-of-egalitarian-versus-equitable-sequences-of-committees-2306.148502023-06-27 https://scifaro.com/en/abs/a-note-on-the-complexity-of-one-sided-crossing-minimization-of-trees-2306.153392023-06-28 https://scifaro.com/en/abs/randomized-vs-deterministic-separation-in-time-space-tradeoffs-of-multi-output-functions-2306.158172023-06-29 https://scifaro.com/en/abs/fine-grained-reductions-around-cfl-reachability-2306.159672023-06-29 https://scifaro.com/en/abs/a-review-on-optimality-investigation-strategies-for-the-balanced-assignment-problem-2306.162872023-06-29 https://scifaro.com/en/abs/on-the-complexity-of-isomorphism-problems-for-tensors-groups-and-polynomials-iv-linear-length-reductions-and-their-applications-2306.163172024-04-15 https://scifaro.com/en/abs/relaxed-local-correctability-from-local-testing-2306.170352024-04-02 https://scifaro.com/en/abs/multi-votes-election-control-by-selecting-rules-2306.174302023-07-03 https://scifaro.com/en/abs/on-the-complexity-of-robust-eventual-inequality-testing-for-c-finite-functions-2307.003632023-07-04 https://scifaro.com/en/abs/a-fine-grained-classification-of-the-complexity-of-evaluating-the-tutte-polynomial-on-integer-points-parameterized-by-treewidth-and-cutwidth-2307.010462023-07-04 https://scifaro.com/en/abs/optimal-information-encoding-in-chemical-reaction-networks-2307.019392023-07-07 https://scifaro.com/en/abs/parameterized-complexity-of-domination-problems-using-restricted-modular-partitions-2307.020212023-07-06 https://scifaro.com/en/abs/locating-robber-with-cop-strategy-graph-subdivision-vs-multiple-cop-2307.025172023-07-07 https://scifaro.com/en/abs/the-complexity-of-the-chinese-remainder-theorem-2307.026172023-07-07 https://scifaro.com/en/abs/a-topological-version-of-schaefer-s-dichotomy-theorem-2307.034462023-07-10 https://scifaro.com/en/abs/on-the-composition-of-randomized-query-complexity-and-approximate-degree-2307.039002023-07-12 https://scifaro.com/en/abs/a-strong-composition-theorem-for-junta-complexity-and-the-boosting-of-property-testers-2307.040392023-07-11 https://scifaro.com/en/abs/properly-learning-decision-trees-with-queries-is-np-hard-2307.040932023-07-11 https://scifaro.com/en/abs/randomized-communication-and-implicit-representations-for-matrices-and-graphs-of-small-sign-rank-2307.044412023-07-11 https://scifaro.com/en/abs/parameterised-distance-to-local-irregularity-2307.045832025-12-17 https://scifaro.com/en/abs/complexity-and-algorithms-for-matching-cut-problems-in-graphs-without-long-induced-paths-and-cycles-2307.054022025-10-10 https://scifaro.com/en/abs/efficiently-verifiable-strong-uniquely-solvable-puzzles-and-matrix-multiplication-2307.064632023-07-18 https://scifaro.com/en/abs/a-framework-for-universality-in-physics-computer-science-and-beyond-2307.068512024-09-04 https://scifaro.com/en/abs/on-the-complexity-of-target-set-selection-in-simple-geometric-networks-2307.069762024-09-04 https://scifaro.com/en/abs/computing-all-monomials-of-degree-n-1-using-2n-3-and-gates-2307.074242023-09-25 https://scifaro.com/en/abs/minimum-separator-reconfiguration-2307.077822023-07-18 https://scifaro.com/en/abs/on-the-hardness-of-posslp-2307.080082023-07-18 https://scifaro.com/en/abs/problems-in-np-can-admit-double-exponential-lower-bounds-when-parameterized-by-treewidth-or-vertex-cover-2307.081492025-03-18 https://scifaro.com/en/abs/on-hardness-of-computing-analytic-brouwer-degree-2307.087242025-09-11 https://scifaro.com/en/abs/on-the-works-of-avi-wigderson-2307.095242023-07-20 https://scifaro.com/en/abs/a-note-on-hardness-of-computing-recursive-teaching-dimension-2307.097922023-07-20 https://scifaro.com/en/abs/the-complexity-of-p-k-p-ell-arrowing-2307.105102023-07-21 https://scifaro.com/en/abs/computations-with-polynomial-evaluation-oracle-ruling-out-superlinear-seth-based-lower-bounds-2307.114442023-07-24 https://scifaro.com/en/abs/simulation-of-turing-machines-with-analytic-discrete-odes-fptime-and-fpspace-over-the-reals-characterised-with-discrete-ordinary-differential-equations-2307.117472024-02-15 https://scifaro.com/en/abs/dyadic-existential-rules-2307.120512023-07-25 https://scifaro.com/en/abs/fourier-growth-of-communication-protocols-for-xor-functions-2307.139262023-07-27 https://scifaro.com/en/abs/complexity-results-for-the-pilot-assignment-problem-in-cell-free-massive-mimo-2307.141862023-08-09 https://scifaro.com/en/abs/fixed-points-and-attractors-of-reactantless-and-inhibitorless-reaction-systems-2307.156122023-10-31 https://scifaro.com/en/abs/restricted-holant-dichotomy-on-domains-3-and-4-2307.160782023-08-01 https://scifaro.com/en/abs/on-approximability-of-satisfiable-k-csps-iv-2307.162482024-08-02 https://scifaro.com/en/abs/the-complexity-of-the-timetable-based-railway-network-design-problem-2308.004202023-08-02 https://scifaro.com/en/abs/a-thermodynamically-universal-turing-machine-2308.023082023-08-07 https://scifaro.com/en/abs/randomized-and-quantum-query-complexities-of-finding-a-king-in-a-tournament-2308.024722023-08-07 https://scifaro.com/en/abs/spectral-norm-economical-sieve-and-linear-invariance-testing-of-boolean-functions-2308.026622026-01-14 https://scifaro.com/en/abs/determinants-vs-algebraic-branching-programs-2308.045992023-08-10 https://scifaro.com/en/abs/on-lifting-lower-bounds-for-noncommutative-circuits-using-automata-2308.048542023-08-10 https://scifaro.com/en/abs/descriptive-complexity-for-neural-networks-via-boolean-networks-2308.062772025-05-12 https://scifaro.com/en/abs/distribution-free-proofs-of-proximity-2308.088742024-02-19 https://scifaro.com/en/abs/probabilistic-computers-so-quantum-computers-are-more-rigorously-powerful-than-traditional-computers-and-derandomization-2308.095492026-05-26 https://scifaro.com/en/abs/agreement-theorems-for-high-dimensional-expanders-in-the-small-soundness-regime-the-role-of-covers-2308.095822024-04-15 https://scifaro.com/en/abs/characterizing-direct-product-testing-via-coboundary-expansion-2308.096682024-02-02 https://scifaro.com/en/abs/the-parallel-dynamic-complexity-of-the-abelian-cayley-group-membership-problem-2308.100732023-08-22 https://scifaro.com/en/abs/on-the-impossibility-of-discovering-a-formula-for-primes-using-ai-2308.108172024-12-05 https://scifaro.com/en/abs/explaining-emergence-2308.109122023-08-23 https://scifaro.com/en/abs/network-navigation-with-online-delays-is-pspace-complete-2308.122652023-08-24 https://scifaro.com/en/abs/explicit-separations-between-randomized-and-deterministic-number-on-forehead-communication-2308.124512024-01-04 https://scifaro.com/en/abs/testing-junta-truncation-2308.139922023-09-06 https://scifaro.com/en/abs/a-near-cubic-lower-bound-for-3-query-locally-decodable-codes-from-semirandom-csp-refutation-2308.154032023-08-30 https://scifaro.com/en/abs/independent-set-in-k-claw-free-graphs-conditional-chi-boundedness-and-the-power-of-lp-sdp-relaxations-2308.160332023-08-31 https://scifaro.com/en/abs/a-discharging-method-improved-kernels-for-edge-triangle-packing-and-covering-2308.165152023-09-01 https://scifaro.com/en/abs/streaming-and-query-once-space-complexity-of-longest-increasing-subsequence-2309.012082023-09-06 https://scifaro.com/en/abs/strictly-locally-testable-and-resources-restricted-control-languages-in-tree-controlled-grammars-2309.027682023-09-07 https://scifaro.com/en/abs/non-clashing-teaching-maps-for-balls-in-graphs-2309.028762024-07-30 https://scifaro.com/en/abs/the-randomness-deficiency-function-and-the-shift-operator-2309.044062024-08-28 https://scifaro.com/en/abs/recursive-error-reduction-for-regular-branching-programs-2309.045512023-12-08 https://scifaro.com/en/abs/tensor-ranks-and-the-fine-grained-complexity-of-dynamic-programming-2309.046832024-01-03 https://scifaro.com/en/abs/two-state-spin-systems-with-negative-interactions-2309.047352025-08-19 https://scifaro.com/en/abs/an-improved-protocol-for-exactlyn-with-more-than-3-players-2309.065542023-09-14 https://scifaro.com/en/abs/defensive-alliances-in-signed-networks-2309.068012024-01-24 https://scifaro.com/en/abs/sumplete-is-hard-even-with-two-different-numbers-2309.071612024-07-01 https://scifaro.com/en/abs/lower-bounds-from-succinct-hitting-sets-2309.076122025-05-14 https://scifaro.com/en/abs/superpositioner-a-non-logical-computation-model-2309.086182023-09-19 https://scifaro.com/en/abs/the-discrepancy-of-greater-than-2309.087032023-09-19 https://scifaro.com/en/abs/merging-two-hierarchies-of-internal-contextual-grammars-with-subregular-selection-2309.087242023-09-19 https://scifaro.com/en/abs/deterministic-algorithms-for-low-degree-factors-of-constant-depth-circuits-2309.097012023-09-19 https://scifaro.com/en/abs/2-colorable-perfect-matching-is-np-complete-in-2-connected-3-regular-planar-graphs-2309.097862023-09-19 https://scifaro.com/en/abs/extractors-for-polynomial-sources-over-mathbb-f-2-2309.110192024-02-02 https://scifaro.com/en/abs/on-the-fine-grained-query-complexity-of-symmetric-functions-2309.112792023-10-24 https://scifaro.com/en/abs/recognizing-unit-multiple-intervals-is-hard-2309.119082023-09-22 https://scifaro.com/en/abs/mildly-exponential-lower-bounds-on-tolerant-testers-for-monotonicity-unateness-and-juntas-2309.125132023-09-25 https://scifaro.com/en/abs/symmetric-exponential-time-requires-near-maximum-circuit-size-2309.129122023-09-25 https://scifaro.com/en/abs/lifting-theorems-meet-information-complexity-known-and-new-lower-bounds-of-set-disjointness-2309.135172023-09-26 https://scifaro.com/en/abs/counting-vanishing-matrix-vector-products-2309.136982023-10-05 https://scifaro.com/en/abs/on-the-tensor-representation-and-algebraic-homomorphism-of-the-neural-state-turing-machine-2309.146902023-09-27 https://scifaro.com/en/abs/instance-complexity-of-boolean-functions-2309.150262026-04-13 https://scifaro.com/en/abs/patterns-induce-injectivity-a-new-thinking-in-constructing-injective-local-rules-of-1d-cellular-automata-over-mathbb-f-2-2309.154682023-09-28 https://scifaro.com/en/abs/black-box-identity-testing-of-noncommutative-rational-formulas-in-deterministic-quasipolynomial-time-2309.156472025-07-14 https://scifaro.com/en/abs/efficient-algorithms-for-semirandom-planted-csps-at-the-refutation-threshold-2309.168972023-10-02 https://scifaro.com/en/abs/refined-kolmogorov-complexity-of-analog-evolving-and-stochastic-recurrent-neural-networks-2309.170322023-10-02 https://scifaro.com/en/abs/enumeration-complexity-incremental-time-delay-and-space-2309.170422023-10-02 https://scifaro.com/en/abs/bounded-simultaneous-messages-2310.003342023-12-25 https://scifaro.com/en/abs/the-recursive-arrival-problem-2310.010042023-10-03 https://scifaro.com/en/abs/a-note-on-the-logrank-conjecture-in-communication-complexity-2310.033552023-11-07 https://scifaro.com/en/abs/distributional-pac-learning-from-nisan-s-natural-proofs-2310.036412023-12-04 https://scifaro.com/en/abs/enumeration-and-updates-for-conjunctive-linear-algebra-queries-through-expressibility-2310.041182026-01-07 https://scifaro.com/en/abs/on-a-hierarchy-of-spectral-invariants-for-graphs-2310.043912025-05-06 https://scifaro.com/en/abs/canonization-of-a-random-circulant-graph-by-counting-walks-2310.057882025-08-19 https://scifaro.com/en/abs/np-hardness-of-tensor-network-contraction-ordering-2310.061402023-10-11 https://scifaro.com/en/abs/an-improved-composition-theorem-of-a-universal-relation-and-most-functions-via-effective-restriction-2310.074222023-11-14 https://scifaro.com/en/abs/on-the-rational-degree-of-boolean-functions-and-applications-2310.080042025-04-16 https://scifaro.com/en/abs/nondango-is-np-complete-2310.114472024-02-27 https://scifaro.com/en/abs/some-derivations-among-logarithmic-space-bounded-counting-classes-2310.118742026-04-28 https://scifaro.com/en/abs/towards-simpler-sorting-networks-and-monotone-circuits-for-majority-2310.122702023-10-20 https://scifaro.com/en/abs/tight-approximability-of-max-2-sat-and-relatives-under-ugc-2310.129112023-11-02 https://scifaro.com/en/abs/deterministic-3sum-hardness-2310.129132023-11-30 https://scifaro.com/en/abs/explicit-orthogonal-and-unitary-designs-2310.135972023-10-23 https://scifaro.com/en/abs/the-space-complexity-of-generating-tent-codes-2310.141852023-10-24 https://scifaro.com/en/abs/fast-fourier-transform-via-automorphism-groups-of-rational-function-fields-2310.144622023-10-24 https://scifaro.com/en/abs/baby-pih-parameterized-inapproximability-of-min-csp-2310.163442024-05-22 https://scifaro.com/en/abs/symmetric-exponential-time-requires-near-maximum-circuit-size-simplified-truly-uniform-2310.177622024-04-05 https://scifaro.com/en/abs/power-of-counting-by-nonuniform-families-of-polynomial-size-finite-automata-2310.189652025-11-19 https://scifaro.com/en/abs/simple-constructions-of-unique-neighbor-expanders-from-error-correcting-codes-2310.191492024-01-29 https://scifaro.com/en/abs/ussr-is-in-p-poly-2310.193352023-11-02 https://scifaro.com/en/abs/two-player-domino-games-2310.197592025-02-18 https://scifaro.com/en/abs/polynomial-time-algorithm-for-boolean-satisfiability-problem-2310.198332023-11-01 https://scifaro.com/en/abs/the-computational-lens-from-quantum-physics-to-neuroscience-2310.205392023-11-01 https://scifaro.com/en/abs/one-way-communication-complexity-of-partial-xor-functions-2310.206062024-06-04 https://scifaro.com/en/abs/an-exponential-lower-bound-for-linear-3-query-locally-correctable-codes-2311.005582023-11-02 https://scifaro.com/en/abs/semidefinite-programming-and-linear-equations-vs-homomorphism-problems-2311.008822025-05-08 https://scifaro.com/en/abs/a-correspondence-between-the-time-and-space-complexity-2311.011842024-12-24 https://scifaro.com/en/abs/patterned-non-determinism-in-communication-complexity-2311.026592023-11-07 https://scifaro.com/en/abs/a-stronger-connection-between-the-asymptotic-rank-conjecture-and-the-set-cover-conjecture-2311.027742023-11-07 https://scifaro.com/en/abs/last-fall-degree-of-semi-local-polynomial-systems-2311.028042023-11-07 https://scifaro.com/en/abs/sharp-thresholds-imply-circuit-lower-bounds-from-random-2-sat-to-planted-clique-2311.042042024-07-17 https://scifaro.com/en/abs/on-the-complexity-of-the-virtual-network-embedding-in-specific-tree-topologies-2311.054742023-11-10 https://scifaro.com/en/abs/np-hard-problems-are-not-in-bqp-2311.056242024-10-15 https://scifaro.com/en/abs/on-the-chow-rank-of-the-permanent-2311.058902025-03-26 https://scifaro.com/en/abs/conditional-lower-bounds-for-sparse-parameterized-2-csp-a-streamlined-proof-2311.059132024-04-18 https://scifaro.com/en/abs/all-instances-of-monotone-3-sat-3-1-are-satisfiable-2311.065632023-12-11 https://scifaro.com/en/abs/gaussian-approximation-of-convex-sets-by-intersections-of-halfspaces-2311.085752023-11-16 https://scifaro.com/en/abs/counting-small-induced-subgraphs-with-edge-monotone-properties-2311.089882023-11-16 https://scifaro.com/en/abs/the-chromatic-number-of-kneser-hypergraphs-via-consensus-division-2311.090162024-11-25 https://scifaro.com/en/abs/on-correlation-bounds-against-polynomials-2311.093702023-11-17 https://scifaro.com/en/abs/the-nfa-acceptance-hypothesis-non-combinatorial-and-dynamic-lower-bounds-2311.102042024-10-09 https://scifaro.com/en/abs/completeness-in-the-polynomial-hierarchy-for-many-natural-problems-in-bilevel-and-robust-optimization-2311.105402025-11-24 https://scifaro.com/en/abs/popularity-on-the-3d-euclidean-stable-roommates-2311.105852023-11-20 https://scifaro.com/en/abs/testing-intersecting-and-union-closed-families-2311.111192023-11-21 https://scifaro.com/en/abs/on-hardness-assumptions-needed-for-extreme-high-end-prgs-and-fast-derandomization-2311.116632023-11-21 https://scifaro.com/en/abs/configuring-an-heterogeneous-smartgrid-network-complexity-and-approximations-for-tree-topologies-2311.117072023-11-21 https://scifaro.com/en/abs/a-collapsible-polynomial-hierarchy-for-promise-problems-2311.122282023-11-22 https://scifaro.com/en/abs/an-improved-line-point-low-degree-test-2311.127522023-11-22 https://scifaro.com/en/abs/sum-of-squares-lower-bounds-for-the-minimum-circuit-size-problem-2311.129942023-11-23 https://scifaro.com/en/abs/the-complexity-of-computing-kkt-solutions-of-quadratic-programs-2311.137382025-07-30 https://scifaro.com/en/abs/elementary-quantum-recursion-schemes-that-capture-quantum-polylogarithmic-time-computability-of-quantum-functions-2311.158842025-01-22 https://scifaro.com/en/abs/matrix-multiplication-in-quadratic-time-and-energy-towards-a-fine-grained-energy-centric-church-turing-thesis-2311.163422023-12-14 https://scifaro.com/en/abs/parameterized-inapproximability-hypothesis-under-eth-2311.165872023-11-29 https://scifaro.com/en/abs/homogeneous-algebraic-complexity-theory-and-algebraic-formulas-2311.170192024-11-08 https://scifaro.com/en/abs/on-the-complexity-of-the-median-and-closest-permutation-problems-2311.172242023-11-30 https://scifaro.com/en/abs/a-local-approach-to-studying-the-time-and-space-complexity-of-deterministic-and-nondeterministic-decision-trees-2311.173062023-11-30 https://scifaro.com/en/abs/violating-constant-degree-hypothesis-requires-breaking-symmetry-2311.174402023-11-30 https://scifaro.com/en/abs/proofs-of-np-conp-pspace-current-upgrade-2311.179392026-05-14 https://scifaro.com/en/abs/lifting-query-complexity-to-time-space-complexity-for-two-way-finite-automata-2311.182202023-12-01 https://scifaro.com/en/abs/comparison-of-deterministic-and-nondeterministic-decision-trees-for-decision-tables-with-many-valued-decisions-from-closed-classes-2312.011162023-12-06 https://scifaro.com/en/abs/disjoint-dominating-and-2-dominating-sets-in-graphs-hardness-and-approximation-results-2312.011492023-12-05 https://scifaro.com/en/abs/output-sensitive-complexity-of-multi-objective-integer-network-flow-problems-2312.017862025-06-02 https://scifaro.com/en/abs/computing-repairs-under-functional-and-inclusion-dependencies-via-argumentation-2312.019732023-12-05 https://scifaro.com/en/abs/evaluating-the-claims-of-sat-requires-exhaustive-search-2312.020712023-12-05 https://scifaro.com/en/abs/a-turing-incomputable-coloring-function-2312.024122023-12-06 https://scifaro.com/en/abs/xor-lemmas-for-communication-via-marginal-information-2312.030762024-07-03 https://scifaro.com/en/abs/canonization-of-a-random-graph-by-two-matrix-vector-multiplications-2312.036862024-01-23 https://scifaro.com/en/abs/corrigendum-pls-is-contained-in-plc-2312.040512024-02-14 https://scifaro.com/en/abs/enumerating-complexity-revisited-2312.041872023-12-18 https://scifaro.com/en/abs/when-input-integers-are-given-in-the-unary-numeral-representation-2312.043482023-12-08 https://scifaro.com/en/abs/on-czerwinski-s-rm-p-neq-rm-np-relative-to-a-rm-p-complete-oracle-2312.043952023-12-08 https://scifaro.com/en/abs/parallel-repetition-of-k-player-projection-games-2312.047832023-12-11 https://scifaro.com/en/abs/clearing-financial-networks-with-derivatives-from-intractability-to-algorithms-2312.051392023-12-14 https://scifaro.com/en/abs/transforms-for-multiplicative-and-fractional-programming-with-broad-applications-in-edge-computing-and-communication-networks-2312.062022023-12-12 https://scifaro.com/en/abs/algorithms-and-turing-kernels-for-detecting-and-counting-small-patterns-in-unit-disk-graphs-2312.063772024-05-28 https://scifaro.com/en/abs/parameterized-algorithms-for-covering-by-arithmetic-progressions-2312.063932023-12-12 https://scifaro.com/en/abs/on-inefficiently-connecting-temporal-networks-2312.071172023-12-13 https://scifaro.com/en/abs/approximation-algorithms-for-preference-aggregation-using-cp-nets-2312.091622023-12-18 https://scifaro.com/en/abs/utilizing-novel-quantum-counters-for-grover-s-algorithm-to-solve-the-dominating-set-problem-2312.093882023-12-18 https://scifaro.com/en/abs/refuting-approaches-to-the-log-rank-conjecture-for-xor-functions-2312.094002024-05-06 https://scifaro.com/en/abs/exact-algorithms-and-lowerbounds-for-multiagent-pathfinding-power-of-treelike-topology-2312.096462023-12-18 https://scifaro.com/en/abs/multicut-problems-in-embedded-graphs-the-dependency-of-complexity-on-the-demand-pattern-2312.110862025-04-16 https://scifaro.com/en/abs/almost-uniform-sampling-of-independent-sets-in-polynomial-time-implying-np-rp-2312.118382023-12-20 https://scifaro.com/en/abs/offensive-alliances-in-signed-graphs-2312.119602023-12-20 https://scifaro.com/en/abs/enumerating-minimal-defensive-alliances-2312.119632024-05-30 https://scifaro.com/en/abs/hardness-of-linearly-ordered-4-colouring-of-3-colourable-3-uniform-hypergraphs-2312.129812023-12-21 https://scifaro.com/en/abs/on-the-complexity-of-sabotage-games-for-network-security-2312.131322023-12-21 https://scifaro.com/en/abs/leakage-resilient-hardness-equivalence-to-logspace-derandomization-2312.140232024-07-01 https://scifaro.com/en/abs/quantum-complexity-vs-classical-complexity-a-survey-2312.140752024-09-13 https://scifaro.com/en/abs/the-problem-of-computational-complexity-2312.141942023-12-25 https://scifaro.com/en/abs/complexity-of-local-search-for-euclidean-clustering-problems-2312.149162025-05-12 https://scifaro.com/en/abs/on-the-existence-of-seedless-condensers-exploring-the-terrain-2312.150872024-10-04 https://scifaro.com/en/abs/the-zeta-zeta-notation-for-complex-asymptotes-2312.154882024-02-02 https://scifaro.com/en/abs/lower-bounds-for-set-multilinear-branching-programs-2312.158742024-02-20 https://scifaro.com/en/abs/the-linear-time-encoding-scheme-fails-to-encode-2312.161252023-12-27 https://scifaro.com/en/abs/on-inapproximability-of-reconfiguration-problems-pspace-hardness-and-some-tight-np-hardness-results-2312.171402025-09-24 https://scifaro.com/en/abs/complexity-theoretic-implications-of-multicalibration-2312.172232024-07-30 https://scifaro.com/en/abs/quantum-and-classical-communication-complexity-of-permutation-invariant-functions-2401.004542025-10-14 https://scifaro.com/en/abs/probabilistically-checkable-reconfiguration-proofs-and-inapproximability-of-reconfiguration-problems-2401.004742025-01-08 https://scifaro.com/en/abs/on-sat-information-content-its-polynomial-time-solvability-and-fixed-code-algorithms-2401.009472024-07-26 https://scifaro.com/en/abs/further-explanations-on-sat-requires-exhaustive-search-2401.011932024-01-18 https://scifaro.com/en/abs/lower-bounds-on-cardinality-of-reducts-for-decision-tables-from-closed-classes-2401.013242024-01-03 https://scifaro.com/en/abs/quantum-polynomial-hierarchies-karp-lipton-error-reduction-and-lower-bounds-2401.016332024-09-04 https://scifaro.com/en/abs/a-computing-machinery-using-a-continuous-memory-tape-2401.024202024-01-08 https://scifaro.com/en/abs/on-the-exact-matching-problem-in-dense-graphs-2401.039242024-01-09 https://scifaro.com/en/abs/quantum-time-space-tradeoffs-for-matrix-problems-2401.053212025-11-03 https://scifaro.com/en/abs/an-optimal-randomized-algorithm-for-finding-the-saddlepoint-2401.065122024-01-17 https://scifaro.com/en/abs/low-rank-tensor-decomposition-over-finite-fields-2401.068572024-04-18 https://scifaro.com/en/abs/fixed-parameter-debordering-of-waring-rank-2401.076312024-11-11 https://scifaro.com/en/abs/isomorphism-testing-of-rooted-trees-in-linear-time-2401.076362024-01-17 https://scifaro.com/en/abs/on-the-formalization-of-the-notion-of-an-algorithm-2401.083662024-09-05 https://scifaro.com/en/abs/the-bit-complexity-of-dynamic-algebraic-formulas-and-their-determinants-2401.111272024-01-24 https://scifaro.com/en/abs/unambiguous-parity-query-complexity-2401.112742024-01-23 https://scifaro.com/en/abs/what-juris-hartmanis-taught-me-about-reductions-2401.112822024-01-23 https://scifaro.com/en/abs/small-even-covers-locally-decodable-codes-and-restricted-subgraphs-of-edge-colored-kikuchi-graphs-2401.115902024-11-27 https://scifaro.com/en/abs/on-a-class-of-interdiction-problems-with-partition-matroids-complexity-and-polynomial-time-algorithms-2401.120102025-08-26 https://scifaro.com/en/abs/clique-as-an-and-of-polynomial-sized-monotone-constant-depth-circuits-2401.120942024-01-24 https://scifaro.com/en/abs/on-pigeonhole-principles-and-ramsey-in-tfnp-2401.126042024-08-13 https://scifaro.com/en/abs/reconfigurable-routing-in-data-center-networks-2401.133592025-01-14 https://scifaro.com/en/abs/a-structural-complexity-analysis-of-hierarchical-task-network-planning-2401.141742025-01-23 https://scifaro.com/en/abs/sum-of-squares-gaussian-processes-i-certification-2401.143832024-10-08 https://scifaro.com/en/abs/structure-in-communication-complexity-and-constant-cost-complexity-classes-2401.146232024-01-29 https://scifaro.com/en/abs/p-not-equal-to-np-2401.150792024-01-30 https://scifaro.com/en/abs/the-rise-of-plurimorphisms-algebraic-approach-to-approximation-2401.151862025-02-05 https://scifaro.com/en/abs/randomized-query-composition-and-product-distributions-2401.153522024-01-30 https://scifaro.com/en/abs/on-small-depth-frege-proofs-for-php-2401.156832026-01-14 https://scifaro.com/en/abs/on-the-complexity-of-establishing-hereditary-graph-properties-via-vertex-splitting-2401.162962024-01-30 https://scifaro.com/en/abs/on-the-constant-depth-circuit-complexity-of-generating-quasigroups-2402.001332025-08-27 https://scifaro.com/en/abs/on-the-minimum-depth-of-circuits-with-linear-number-of-wires-encoding-good-codes-2402.003782024-02-02 https://scifaro.com/en/abs/hardness-of-random-reordered-encodings-of-parity-for-resolution-and-cdcl-2402.005422024-02-02 https://scifaro.com/en/abs/hausdorff-reductions-and-the-exponential-hierarchies-2402.007912026-04-14 https://scifaro.com/en/abs/constant-degree-direct-product-testers-with-small-soundness-2402.008502024-07-18 https://scifaro.com/en/abs/ruling-out-low-rank-matrix-multiplication-tensor-decompositions-with-symmetries-via-sat-2402.010112024-02-05 https://scifaro.com/en/abs/low-acceptance-agreement-tests-via-bounded-degree-symplectic-hdxs-2402.010782024-04-15 https://scifaro.com/en/abs/simple-stochastic-stopping-games-a-generator-and-benchmark-library-2402.025712024-02-06 https://scifaro.com/en/abs/xalp-completeness-of-parameterized-problems-on-planar-graphs-2402.030872025-01-09 https://scifaro.com/en/abs/a-quasi-optimal-lower-bound-for-skew-polynomial-multiplication-2402.041342024-02-07 https://scifaro.com/en/abs/exponential-separation-between-powers-of-regular-and-general-resolution-over-parities-2402.043642024-02-26 https://scifaro.com/en/abs/simple-inexpensive-vertex-and-edge-invariants-distinguishing-dataset-strongly-regular-graphs-2402.049162024-02-08 https://scifaro.com/en/abs/two-simple-proofs-of-m-uller-s-theorem-2402.053282024-07-04 https://scifaro.com/en/abs/finding-hardness-reductions-automatically-using-sat-solvers-2402.063972024-02-12 https://scifaro.com/en/abs/nearest-neighbor-complexity-and-boolean-circuits-2402.067402024-05-24 https://scifaro.com/en/abs/the-complexity-of-promise-constraint-satisfaction-problem-seen-from-the-other-side-2402.068212024-02-20 https://scifaro.com/en/abs/fundamental-problems-on-bounded-treewidth-graphs-the-real-source-of-hardness-2402.073312024-02-20 https://scifaro.com/en/abs/two-choices-are-enough-for-p-lcps-usos-and-colorful-tangents-2402.076832024-05-22 https://scifaro.com/en/abs/detecting-low-degree-truncation-2402.081332024-11-25 https://scifaro.com/en/abs/solving-promise-equations-over-monoids-and-groups-2402.084342025-03-04 https://scifaro.com/en/abs/nearest-neighbor-representations-of-neurons-2402.087482024-05-13 https://scifaro.com/en/abs/nearest-neighbor-representations-of-neural-circuits-2402.087512024-05-13 https://scifaro.com/en/abs/on-computability-of-computable-problems-2402.094102024-09-06 https://scifaro.com/en/abs/improved-lower-bounds-for-approximating-parameterized-nearest-codeword-and-related-problems-under-eth-2402.098252024-02-16 https://scifaro.com/en/abs/quantum-automating-mathbf-tc-0-frege-is-lwe-hard-2402.103512026-03-10 https://scifaro.com/en/abs/alphabet-reduction-for-reconfiguration-problems-2402.106272025-01-07 https://scifaro.com/en/abs/a-simple-proof-that-ricochet-robots-is-pspace-complete-2402.114402024-02-20 https://scifaro.com/en/abs/computational-complexity-of-the-weisfeiler-leman-dimension-2402.115312024-11-18 https://scifaro.com/en/abs/optimal-pseudorandom-generators-for-low-degree-polynomials-over-moderately-large-fields-2402.119152024-02-20 https://scifaro.com/en/abs/optimal-pspace-hardness-of-approximating-set-cover-reconfiguration-2402.126452025-01-07 https://scifaro.com/en/abs/two-quantum-paradigms-but-still-no-signal-2402.130492024-02-21 https://scifaro.com/en/abs/improved-space-bounds-for-subset-sum-2402.131702024-08-02 https://scifaro.com/en/abs/edge-disjoint-paths-in-eulerian-digraphs-2402.137162024-02-22 https://scifaro.com/en/abs/aaronson-ambainis-conjecture-is-true-for-random-restrictions-2402.139522026-03-05 https://scifaro.com/en/abs/locality-bounds-for-sampling-hamming-slices-2402.142782024-02-28 https://scifaro.com/en/abs/on-the-communication-complexity-of-finding-a-king-in-a-tournament-2402.147512024-02-23 https://scifaro.com/en/abs/improved-hardness-results-for-learning-intersections-of-halfspaces-2402.159952026-05-06 https://scifaro.com/en/abs/tight-lower-bounds-for-block-structured-integer-programs-2402.172902024-02-28 https://scifaro.com/en/abs/fractional-linear-matroid-matching-is-in-quasi-nc-2402.182762024-02-29 https://scifaro.com/en/abs/on-efficient-computation-of-dire-committees-2402.193652025-10-22 https://scifaro.com/en/abs/on-the-counting-complexity-of-the-skolem-problem-2403.000982025-08-05 https://scifaro.com/en/abs/posslp-and-sum-of-squares-2403.001152024-03-04 https://scifaro.com/en/abs/deterministic-weighted-automata-under-partial-observability-2403.003902024-03-04 https://scifaro.com/en/abs/graph-homomorphism-monotone-classes-and-bounded-pathwidth-2403.004972025-03-17 https://scifaro.com/en/abs/atropos-k-is-pspace-complete-2403.016622025-03-25 https://scifaro.com/en/abs/towards-deterministic-algorithms-for-constant-depth-factors-of-constant-depth-circuits-2403.019652024-03-05 https://scifaro.com/en/abs/bounded-depth-frege-lower-bounds-for-random-3-cnfs-via-deterministic-restrictions-2403.022752024-09-04 https://scifaro.com/en/abs/the-complexity-of-computing-in-continuous-time-space-complexity-is-precision-2403.024992024-03-06 https://scifaro.com/en/abs/average-case-deterministic-query-complexity-of-boolean-functions-with-fixed-weight-2403.035302025-06-12 https://scifaro.com/en/abs/polynomial-calculus-sizes-over-the-boolean-and-fourier-bases-are-incomparable-2403.039332024-07-02 https://scifaro.com/en/abs/on-1-2-domination-in-interval-and-circle-graphs-2403.046942024-11-20 https://scifaro.com/en/abs/a-tractability-gap-beyond-nim-sums-it-s-hard-to-tell-whether-a-bunch-of-superstars-are-losers-2403.049552024-03-11 https://scifaro.com/en/abs/spectral-lower-bounds-for-local-search-2403.062482024-11-19 https://scifaro.com/en/abs/the-primal-pathwidth-seth-2403.072392024-10-08 https://scifaro.com/en/abs/local-enumeration-and-majority-lower-bounds-2403.091342024-05-24 https://scifaro.com/en/abs/complexity-classification-of-complex-weighted-counting-acyclic-constraint-satisfaction-problems-2403.091452024-03-15 https://scifaro.com/en/abs/even-quantum-advice-is-unlikely-to-solve-pp-2403.099942025-11-26 https://scifaro.com/en/abs/perfect-zero-knowledge-pcps-for-p-2403.119412024-03-20 https://scifaro.com/en/abs/a-new-reduction-method-from-multivariate-polynomials-to-univariate-polynomials-2403.127162024-03-20 https://scifaro.com/en/abs/a-combinatorial-view-of-holant-problems-on-higher-domains-2403.141502024-06-11 https://scifaro.com/en/abs/maximizing-phylogenetic-diversity-under-time-pressure-planning-with-extinctions-ahead-2403.142172024-03-22 https://scifaro.com/en/abs/hardness-of-learning-boolean-functions-from-label-proportions-2403.194012024-03-29 https://scifaro.com/en/abs/a-1-999999-approximation-ratio-for-vertex-cover-problem-2403.196802025-03-04 https://scifaro.com/en/abs/computing-a-fixed-point-of-contraction-maps-in-polynomial-queries-2403.199112025-08-12 https://scifaro.com/en/abs/computational-complexity-of-the-recoverable-robust-shortest-path-problem-with-discrete-recourse-2403.200002026-05-01 https://scifaro.com/en/abs/a-new-information-complexity-measure-for-multi-pass-streaming-with-applications-2403.202832024-04-01 https://scifaro.com/en/abs/local-correction-of-linear-functions-over-the-boolean-cube-2403.203052024-04-29 https://scifaro.com/en/abs/a-critique-of-chen-s-the-2-maxsat-problem-can-be-solved-in-polynomial-time-2404.000062024-04-02 https://scifaro.com/en/abs/no-complete-problem-for-constant-cost-randomized-communication-2404.008122024-04-02 https://scifaro.com/en/abs/a-simplified-proof-of-the-csp-dichotomy-conjecture-and-xy-symmetric-operations-2404.010802024-10-22 https://scifaro.com/en/abs/probabilistic-generating-circuits-demystified-2404.029122024-04-05 https://scifaro.com/en/abs/the-low-degree-hardness-of-finding-large-independent-sets-in-sparse-random-hypergraphs-2404.038422025-10-27 https://scifaro.com/en/abs/pi-2-p-vs-pspace-dichotomy-for-the-quantified-constraint-satisfaction-problem-2404.038442024-10-22 https://scifaro.com/en/abs/a-critique-of-du-s-a-polynomial-time-algorithm-for-3-sat-2404.043952024-04-09 https://scifaro.com/en/abs/a-universal-sequence-of-tensors-for-the-asymptotic-rank-conjecture-2404.064272024-04-10 https://scifaro.com/en/abs/exponential-lower-bounds-for-smooth-3-lccs-and-sharp-bounds-for-designs-2404.065132024-10-29 https://scifaro.com/en/abs/optimal-communication-complexity-of-chained-index-2404.070262024-05-31 https://scifaro.com/en/abs/near-optimal-alphabet-soundness-tradeoff-pcps-2404.074412026-05-15 https://scifaro.com/en/abs/lifting-with-inner-functions-of-polynomial-discrepancy-2404.076062024-04-12 https://scifaro.com/en/abs/fourier-analysis-of-iterative-algorithms-2404.078812024-11-07 https://scifaro.com/en/abs/trading-determinism-for-noncommutativity-in-edmonds-problem-2404.079862024-04-12 https://scifaro.com/en/abs/on-the-power-of-interactive-proofs-for-learning-2404.081582024-04-15 https://scifaro.com/en/abs/resolution-over-linear-equations-combinatorial-games-for-tree-like-size-and-space-2404.083702024-07-11 https://scifaro.com/en/abs/almost-optimal-time-lower-bound-for-approximating-parameterized-clique-csp-and-more-under-eth-2404.088702024-06-13 https://scifaro.com/en/abs/the-complexity-of-convexity-number-and-percolation-time-in-the-cycle-convexity-2404.092362025-04-22 https://scifaro.com/en/abs/the-fine-grained-complexity-of-graph-homomorphism-problems-towards-the-okrasa-and-rz-k-a-zewski-conjecture-2404.097982024-04-16 https://scifaro.com/en/abs/pspace-hard-2d-super-mario-games-thirteen-doors-2404.103802024-04-17 https://scifaro.com/en/abs/tetris-with-few-piece-types-2404.107122024-04-17 https://scifaro.com/en/abs/constant-depth-arithmetic-circuits-for-linear-algebra-problems-2404.108392026-01-27 https://scifaro.com/en/abs/chernoff-bounds-and-reverse-hypercontractivity-on-hdx-2404.109612024-07-16 https://scifaro.com/en/abs/satisfiability-of-commutative-vs-non-commutative-csps-2404.117092025-09-12 https://scifaro.com/en/abs/unambiguous-and-co-nondeterministic-computations-of-finite-automata-and-pushdown-automata-families-and-the-effects-of-multiple-counters-2404.132542025-12-16 https://scifaro.com/en/abs/prove-symbolic-regression-is-np-hard-by-symbol-graph-2404.138202024-04-23 https://scifaro.com/en/abs/functional-closure-properties-of-finite-mathbb-n-weighted-automata-2404.142452024-04-23 https://scifaro.com/en/abs/complexity-of-planar-graph-orientation-consistency-promise-inference-and-uniqueness-with-applications-to-minesweeper-variants-2404.145192024-04-24 https://scifaro.com/en/abs/pseudorandom-permutations-from-random-reversible-circuits-2404.146482025-02-13 https://scifaro.com/en/abs/a-nearly-4-log-n-depth-lower-bound-for-formulas-with-restriction-on-top-2404.156132024-04-25 https://scifaro.com/en/abs/a-multivariate-to-bivariate-reduction-for-noncommutative-rank-and-related-results-2404.163822024-04-26 https://scifaro.com/en/abs/tightening-i-o-lower-bounds-through-the-hourglass-dependency-pattern-2404.164432024-04-26 https://scifaro.com/en/abs/l-is-different-from-np-2404.165622024-09-05 https://scifaro.com/en/abs/clique-is-hard-on-average-for-sherali-adams-with-bounded-coefficients-2404.167222024-04-26 https://scifaro.com/en/abs/computational-hardness-of-detecting-graph-lifts-and-certifying-lift-monotone-properties-of-random-regular-graphs-2404.170122024-04-29 https://scifaro.com/en/abs/two-source-and-affine-non-malleable-extractors-for-small-entropy-2404.170132024-04-29 https://scifaro.com/en/abs/maximizing-minimum-cycle-bases-intersection-2404.172232024-04-29 https://scifaro.com/en/abs/limits-of-sequential-local-algorithms-on-the-random-k-xorsat-problem-2404.177752024-09-10 https://scifaro.com/en/abs/an-oracle-with-no-mathrm-up-complete-sets-but-mathrm-np-mathrm-pspace-2404.191042024-05-01 https://scifaro.com/en/abs/solvable-initial-value-problems-ruled-by-discontinuous-ordinary-differential-equations-2405.001652024-05-03 https://scifaro.com/en/abs/a-smoothed-analysis-of-the-space-complexity-of-computing-a-chaotic-sequence-2405.003272024-05-02 https://scifaro.com/en/abs/phylogenetic-network-diversity-parameterized-by-reticulation-number-and-beyond-2405.010912025-11-20 https://scifaro.com/en/abs/from-proof-complexity-to-circuit-complexity-via-interactive-protocols-2405.022322024-05-06 https://scifaro.com/en/abs/decision-algorithms-for-reversibility-of-one-dimensional-non-linear-cellular-automata-under-null-boundary-conditions-2405.036092024-05-07 https://scifaro.com/en/abs/the-existential-theory-of-the-reals-with-summation-operators-2405.046972024-10-07 https://scifaro.com/en/abs/controlling-borda-elections-by-adding-or-deleting-either-votes-or-candidates-complete-and-top-truncated-votes-2405.050622024-05-09 https://scifaro.com/en/abs/committee-elections-with-candidate-attribute-constraints-2405.050832024-05-09 https://scifaro.com/en/abs/solving-quantified-boolean-formulas-with-few-existential-variables-2405.064852024-05-13 https://scifaro.com/en/abs/a-pair-of-bayesian-network-structures-has-undecidable-conditional-independencies-2405.071072024-05-14 https://scifaro.com/en/abs/p-np-2405.080512024-05-21 https://scifaro.com/en/abs/total-variation-distance-for-product-distributions-is-mathsf-p-complete-2405.082552024-05-15 https://scifaro.com/en/abs/asp-completeness-of-hamiltonicity-in-grid-graphs-with-applications-to-loop-puzzles-2405.083772026-05-05 https://scifaro.com/en/abs/the-computational-power-of-discrete-chemical-reaction-networks-with-bounded-executions-2405.086492026-01-21 https://scifaro.com/en/abs/hilbert-functions-and-low-degree-randomness-extractors-2405.102772024-05-17 https://scifaro.com/en/abs/low-degree-polynomials-are-good-extractors-2405.102972025-04-22 https://scifaro.com/en/abs/you-can-t-solve-these-super-mario-bros-levels-undecidable-mario-games-2405.105462024-05-20 https://scifaro.com/en/abs/injective-hardness-condition-for-pcsps-2405.107742024-05-20 https://scifaro.com/en/abs/fixed-parameter-tractability-of-canonical-polyadic-decomposition-over-finite-fields-2405.116992024-06-18 https://scifaro.com/en/abs/pseudorandomness-symmetry-smoothing-i-2405.131432024-05-24 https://scifaro.com/en/abs/on-the-inapproximability-of-finding-minimum-monitoring-edge-geodetic-sets-2405.138752024-05-24 https://scifaro.com/en/abs/complexity-of-robust-orbit-problems-for-torus-actions-and-the-abc-conjecture-2405.153682025-10-14 https://scifaro.com/en/abs/the-radical-solution-and-computational-complexity-2405.157902024-05-28 https://scifaro.com/en/abs/complexity-of-multiple-hamiltonicity-in-graphs-of-bounded-degree-2405.162702024-05-28 https://scifaro.com/en/abs/a-strong-direct-sum-theorem-for-distributional-query-complexity-2405.163402024-05-28 https://scifaro.com/en/abs/game-derandomization-2405.163532024-05-28 https://scifaro.com/en/abs/half-duplex-communication-complexity-with-adversary-can-be-less-than-the-classical-communication-complexity-2405.168812024-05-28 https://scifaro.com/en/abs/unconventional-complexity-classes-in-unconventional-computing-extended-abstract-2405.168962024-05-28 https://scifaro.com/en/abs/delta-modular-ilp-problems-of-bounded-codimension-discrepancy-and-convolution-new-version-2405.170012025-06-17 https://scifaro.com/en/abs/maximizing-phylogenetic-diversity-under-ecological-constraints-a-parameterized-complexity-study-2405.173142024-05-28 https://scifaro.com/en/abs/on-bounded-advice-classes-2405.181552024-05-29 https://scifaro.com/en/abs/the-polynomial-hierarchy-does-not-collapse-2405.184392024-05-30 https://scifaro.com/en/abs/a-linear-bound-for-the-size-of-the-finite-terminal-assembly-of-a-directed-non-cooperative-tile-assembly-system-2405.186302026-05-11 https://scifaro.com/en/abs/derandomized-non-abelian-homomorphism-testing-in-low-soundness-regime-2405.189982024-09-25 https://scifaro.com/en/abs/formalizing-the-notions-of-non-interactive-and-interactive-algorithms-2405.190372025-11-11 https://scifaro.com/en/abs/set-descriptive-complexity-of-solvable-functions-2405.193042024-06-04 https://scifaro.com/en/abs/complexity-of-injectivity-and-verification-of-relu-neural-networks-2405.198052025-06-23 https://scifaro.com/en/abs/proportionally-dense-subgraphs-of-maximum-size-in-degree-constrained-graphs-2405.208472024-06-03 https://scifaro.com/en/abs/on-the-completeness-of-several-fortification-interdiction-games-in-the-polynomial-hierarchy-2406.017562025-12-22 https://scifaro.com/en/abs/actionreasoningbench-reasoning-about-actions-with-and-without-ramification-constraints-2406.040462025-03-04 https://scifaro.com/en/abs/on-kolmogorov-structure-functions-2406.059032024-07-11 https://scifaro.com/en/abs/completeness-classes-in-algebraic-complexity-theory-2406.062172024-06-11 https://scifaro.com/en/abs/psmc-provable-and-scalable-algorithms-for-motif-conductance-based-graph-clustering-2406.073572024-06-12 https://scifaro.com/en/abs/relations-between-monotone-complexity-measures-based-on-decision-tree-complexity-2406.078592024-06-14 https://scifaro.com/en/abs/resource-leveling-complexity-of-a-uet-two-processor-scheduling-variant-and-related-problems-2406.081042024-06-13 https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-3sat-2406.084892024-06-14 https://scifaro.com/en/abs/an-origami-universal-turing-machine-design-2406.084902024-06-25 https://scifaro.com/en/abs/equivalence-of-countable-and-computable-2406.084932024-06-14 https://scifaro.com/en/abs/what-if-turing-had-preceded-g-odel-2406.084942024-06-14 https://scifaro.com/en/abs/a-brief-note-on-a-recent-claim-about-np-hard-problems-and-bqp-2406.084952024-06-14 https://scifaro.com/en/abs/on-the-simulation-power-of-surface-chemical-reaction-networks-2406.084972024-06-14 https://scifaro.com/en/abs/more-efficient-k-wise-independent-permutations-from-random-reversible-circuits-via-log-sobolev-inequalities-2406.084992024-06-14 https://scifaro.com/en/abs/newman-s-theorem-via-carath-eodory-2406.085002024-11-04 https://scifaro.com/en/abs/a-refinement-of-the-mccreight-meyer-union-theorem-2406.086002024-06-14 https://scifaro.com/en/abs/on-the-expressibility-of-the-reconstructional-color-refinement-2406.093512024-06-14 https://scifaro.com/en/abs/simulating-polynomial-time-nondeterministic-turing-machines-via-nondeterministic-turing-machines-2406.104762026-05-29 https://scifaro.com/en/abs/treewidth-inapproximability-and-tight-eth-lower-bound-2406.116282025-06-25 https://scifaro.com/en/abs/assembly-theory-and-its-relationship-with-computational-complexity-2406.121762024-12-04 https://scifaro.com/en/abs/parameterized-shortest-path-reconfiguration-2406.127172024-06-19 https://scifaro.com/en/abs/computable-one-way-functions-on-the-reals-2406.158172025-07-21 https://scifaro.com/en/abs/formula-size-depth-tradeoffs-for-iterated-sub-permutation-matrix-multiplication-2406.160152024-06-25 https://scifaro.com/en/abs/an-invitation-to-universality-in-physics-computer-science-and-beyond-2406.166072024-06-25 https://scifaro.com/en/abs/consistent-query-answering-over-shacl-constraints-2406.166532024-08-01 https://scifaro.com/en/abs/extensively-not-p-bi-immune-promisebqp-complete-languages-2406.167642024-06-25 https://scifaro.com/en/abs/constructibility-and-the-p-versus-np-problem-2406.168432026-05-26 https://scifaro.com/en/abs/structure-of-sparse-boolean-functions-over-abelian-groups-and-its-application-to-testing-2406.187002026-02-03 https://scifaro.com/en/abs/resilient-functions-optimized-simplified-and-generalized-2406.194672024-07-01 https://scifaro.com/en/abs/distance-to-transitivity-new-parameters-for-taming-reachability-in-temporal-graphs-2406.195142024-07-01 https://scifaro.com/en/abs/the-periodic-structure-of-local-consistency-2406.196852024-11-01 https://scifaro.com/en/abs/on-the-approximability-of-graph-visibility-problems-2407.004092024-07-02 https://scifaro.com/en/abs/superconstant-inapproximability-of-decision-tree-learning-2407.014022024-07-02 https://scifaro.com/en/abs/an-xor-lemma-for-deterministic-communication-complexity-2407.018022024-07-03 https://scifaro.com/en/abs/specification-and-automatic-verification-of-computational-reductions-2407.040372024-07-08 https://scifaro.com/en/abs/encoding-of-algebraic-geometry-codes-with-quasi-linear-complexity-o-n-log-n-2407.046182024-07-08 https://scifaro.com/en/abs/determination-problems-for-orbit-closures-and-matrix-groups-2407.046262025-11-18 https://scifaro.com/en/abs/partial-minimum-branching-program-size-problem-is-eth-hard-2407.046322024-07-08 https://scifaro.com/en/abs/from-graph-properties-to-graph-parameters-tight-bounds-for-counting-on-small-subgraphs-2407.068012024-07-10 https://scifaro.com/en/abs/counting-small-induced-subgraphs-hardness-via-fourier-analysis-2407.070512025-12-11 https://scifaro.com/en/abs/coordinating-7-billion-humans-is-hard-2407.072462024-07-11 https://scifaro.com/en/abs/approximate-degree-composition-for-recursive-functions-2407.083852025-01-22 https://scifaro.com/en/abs/on-equivalence-of-parameterized-inapproximability-of-k-median-k-max-coverage-and-2-csp-2407.089172024-07-15 https://scifaro.com/en/abs/limitations-of-affine-integer-relaxations-for-solving-constraint-satisfaction-problems-2407.090972026-01-09 https://scifaro.com/en/abs/simple-linear-loops-algebraic-invariants-and-applications-2407.091542024-11-14 https://scifaro.com/en/abs/circuits-and-backdoors-five-shades-of-the-seth-2407.096832025-10-14 https://scifaro.com/en/abs/explicit-commutative-roabps-from-partial-derivatives-2407.101432024-07-16 https://scifaro.com/en/abs/complexity-of-2d-snake-cube-puzzles-2407.103232024-07-16 https://scifaro.com/en/abs/pseudorandomness-symmetry-smoothing-ii-2407.121102024-07-18 https://scifaro.com/en/abs/geometric-and-computational-hardness-of-bilevel-programming-2407.123722025-01-29 https://scifaro.com/en/abs/quasi-linear-size-pcps-with-small-soundness-from-hdx-2407.127622024-11-08 https://scifaro.com/en/abs/liquid-amortization-proving-amortized-complexity-with-liquidhaskell-functional-pearl-2407.136712024-07-19 https://scifaro.com/en/abs/the-complexity-of-p3-h-arrowing-and-beyond-2407.151932024-07-23 https://scifaro.com/en/abs/the-existential-theory-of-the-reals-as-a-complexity-class-a-compendium-2407.180062024-07-26 https://scifaro.com/en/abs/semi-classical-subspaces-the-no-synchronization-law-and-more-2407.182012024-11-14 https://scifaro.com/en/abs/the-computational-complexity-of-factored-graphs-2407.191022024-12-02 https://scifaro.com/en/abs/np-completeness-of-neighborhood-balanced-colorings-2407.197932024-07-30 https://scifaro.com/en/abs/constant-cost-communication-is-not-reducible-to-k-hamming-distance-2407.202042025-05-07 https://scifaro.com/en/abs/data-debugging-is-np-hard-for-classifiers-trained-with-sgd-2408.013652024-08-05 https://scifaro.com/en/abs/on-the-complexity-of-the-conditional-independence-implication-problem-with-bounded-cardinalities-2408.025502024-08-06 https://scifaro.com/en/abs/algorithms-for-the-diverse-k-sat-problem-the-geometry-of-satisfying-assignments-2408.034652025-06-04 https://scifaro.com/en/abs/on-the-np-hardness-approximation-curve-for-max-2lin-2-2408.048322024-08-13 https://scifaro.com/en/abs/the-complexity-of-strong-conflict-free-vertex-connection-k-colorability-2408.058652024-08-15 https://scifaro.com/en/abs/optimal-proof-systems-for-complex-sets-are-hard-to-find-2408.074082025-07-03 https://scifaro.com/en/abs/domination-in-diameter-two-graphs-and-the-2-club-cluster-vertex-deletion-parameter-2408.084182024-08-19 https://scifaro.com/en/abs/parallel-repetition-for-3-player-xor-games-2408.093522024-08-20 https://scifaro.com/en/abs/revisiting-tree-canonization-using-polynomials-2408.103382024-11-25 https://scifaro.com/en/abs/csps-with-few-alien-constraints-2408.129092024-08-28 https://scifaro.com/en/abs/a-parametric-version-of-the-hilbert-nullstellensatz-2408.130272024-10-22 https://scifaro.com/en/abs/lossy-catalytic-computation-2408.146702024-08-28 https://scifaro.com/en/abs/on-approximability-of-satisfiable-k-csps-v-2408.153772026-05-27 https://scifaro.com/en/abs/direct-sum-theorems-beyond-query-complexity-2408.155702025-01-16 https://scifaro.com/en/abs/partial-and-weighted-matrix-multiplication-2408.157282024-08-29 https://scifaro.com/en/abs/hypercontractivity-on-hdx-ii-symmetrization-and-q-norms-2408.166872025-02-18 https://scifaro.com/en/abs/query-complexity-lower-bounds-for-local-list-decoding-and-hard-core-predicates-even-for-small-rate-and-huge-lists-2409.017082024-09-04 https://scifaro.com/en/abs/the-randomized-query-complexity-of-finding-a-tarski-fixed-point-on-the-boolean-hypercube-2409.037512025-07-16 https://scifaro.com/en/abs/on-the-computational-power-of-c-random-strings-2409.044482025-04-15 https://scifaro.com/en/abs/two-sided-lossless-expanders-in-the-unbalanced-setting-2409.045492025-02-11 https://scifaro.com/en/abs/a-quantum-pigeonhole-principle-and-two-semidefinite-relaxations-of-communication-complexity-2409.045922024-09-10 https://scifaro.com/en/abs/fully-characterizing-lossy-catalytic-computation-2409.050462024-09-10 https://scifaro.com/en/abs/how-to-verify-any-reasonable-distribution-property-computationally-sound-argument-systems-for-distributions-2409.065942024-09-11 https://scifaro.com/en/abs/boosting-uniformity-in-quasirandom-groups-fast-and-simple-2409.069322024-09-12 https://scifaro.com/en/abs/approximately-counting-maximal-independent-set-is-equivalent-to-sat-2409.070352024-09-16 https://scifaro.com/en/abs/fast-simulation-of-cellular-automata-by-self-composition-2409.070652025-11-04 https://scifaro.com/en/abs/improved-hardness-and-approximations-for-cardinality-based-minimum-s-t-cuts-problems-in-hypergraphs-2409.072012025-04-08 https://scifaro.com/en/abs/almost-catalytic-computation-2409.072082024-11-25 https://scifaro.com/en/abs/journalists-emotions-and-the-introduction-of-generative-ai-chatbots-a-large-scale-analysis-of-tweets-before-and-after-the-launch-of-chatgpt-2409.087612024-09-16 https://scifaro.com/en/abs/complexity-and-algorithms-for-swap-median-and-relation-to-other-consensus-problems-2409.097342025-04-29 https://scifaro.com/en/abs/new-direct-sum-tests-2409.104642024-09-17 https://scifaro.com/en/abs/the-sample-complexity-of-smooth-boosting-and-the-tightness-of-the-hardcore-theorem-2409.115972024-09-19 https://scifaro.com/en/abs/computational-dynamical-systems-2409.121792024-09-19 https://scifaro.com/en/abs/a-topological-proof-of-the-hell-ne-v-s-et-v-r-il-dichotomy-2409.126272025-01-14 https://scifaro.com/en/abs/optimal-coding-for-randomized-kolmogorov-complexity-and-its-applications-2409.127442024-09-20 https://scifaro.com/en/abs/fast-decision-tree-learning-solves-hard-coding-theoretic-problems-2409.130962024-09-27 https://scifaro.com/en/abs/parameterized-local-search-for-max-c-cut-2409.133802024-09-23 https://scifaro.com/en/abs/parameterised-holant-problems-2409.135792025-05-05 https://scifaro.com/en/abs/transformers-in-uniform-tc-0-2409.136292025-01-06 https://scifaro.com/en/abs/np-completeness-and-physical-zero-knowledge-proofs-for-zeiger-2409.143082025-03-04 https://scifaro.com/en/abs/faster-mixing-of-higher-dimensional-random-reversible-circuits-2409.146142025-02-13 https://scifaro.com/en/abs/some-thoughts-on-symbolic-transfer-entropy-2409.147452024-09-24 https://scifaro.com/en/abs/disjoint-covering-of-bipartite-graphs-with-s-clubs-2409.147832026-04-21 https://scifaro.com/en/abs/the-complexity-of-counting-turns-in-the-line-based-dial-a-ride-problem-2409.151922026-05-01 https://scifaro.com/en/abs/on-the-complexity-of-neural-computation-in-superposition-2409.153182026-02-27 https://scifaro.com/en/abs/hardness-of-approximate-sperner-and-applications-to-envy-free-cake-cutting-2409.157132024-09-25 https://scifaro.com/en/abs/non-boolean-omv-one-more-reason-to-believe-lower-bounds-for-dynamic-problems-2409.159702025-09-03 https://scifaro.com/en/abs/asymptotically-optimal-hardness-for-k-set-packing-and-k-matroid-intersection-2409.178312024-09-27 https://scifaro.com/en/abs/trading-determinism-for-time-the-k-reach-problem-2409.184692025-04-16 https://scifaro.com/en/abs/algorithms-and-complexity-for-monitoring-edge-geodetic-sets-in-graphs-2409.190672025-05-27 https://scifaro.com/en/abs/better-boosting-of-communication-oracles-or-not-2410.008382024-10-15 https://scifaro.com/en/abs/perfect-sampling-from-rapidly-mixing-markov-chains-2410.008822024-12-09 https://scifaro.com/en/abs/characterizing-and-testing-principal-minor-equivalence-of-matrices-2410.019612024-10-04 https://scifaro.com/en/abs/inapproximability-of-finding-sparse-vectors-in-codes-subspaces-and-lattices-2410.026362025-06-26 https://scifaro.com/en/abs/asymptotically-optimal-inapproximability-of-maxmin-k-cut-reconfiguration-2410.034162025-04-01 https://scifaro.com/en/abs/logical-expressibility-of-syntactic-nl-for-complementarity-monotonicity-and-maximization-2410.041172025-11-07 https://scifaro.com/en/abs/complexity-results-for-a-cops-and-robber-game-on-directed-graphs-2410.048972024-10-08 https://scifaro.com/en/abs/stochastic-process-turing-machines-2410.071312025-08-05 https://scifaro.com/en/abs/improved-condensers-for-chor-goldreich-sources-2410.081422024-10-11 https://scifaro.com/en/abs/tractability-results-for-integration-in-subspaces-of-the-wiener-algebra-2410.090602025-03-06 https://scifaro.com/en/abs/relative-error-monotonicity-testing-2410.092352025-09-03 https://scifaro.com/en/abs/toward-better-depth-lower-bounds-strong-composition-of-xor-and-a-random-function-2410.101892025-01-30 https://scifaro.com/en/abs/on-the-low-weight-polynomial-multiple-problem-2410.102242024-10-15 https://scifaro.com/en/abs/computing-eulerian-magnitude-homology-2410.103762024-10-15 https://scifaro.com/en/abs/p-time-algorithms-for-typical-eo-problems-2410.115572025-04-28 https://scifaro.com/en/abs/np-hardness-of-testing-equivalence-to-sparse-polynomials-and-to-constant-support-polynomials-2410.122512024-10-17 https://scifaro.com/en/abs/a-positional-mathbf-pi-0-3-complete-objective-2410.146882024-10-22 https://scifaro.com/en/abs/on-the-formalization-of-the-notion-of-a-concurrent-algorithm-2410.178212026-01-21 https://scifaro.com/en/abs/lower-bounds-for-convexity-testing-2410.179582024-10-24 https://scifaro.com/en/abs/the-communication-complexity-of-approximating-matrix-rank-2410.200942024-10-29 https://scifaro.com/en/abs/solving-polynomial-equations-over-finite-fields-2410.201622024-10-29 https://scifaro.com/en/abs/improving-the-leading-constant-of-matrix-multiplication-2410.205382024-10-29 https://scifaro.com/en/abs/a-universal-bound-on-the-space-complexity-of-directed-acyclic-graph-computations-2410.205472024-10-29 https://scifaro.com/en/abs/small-shadow-partitions-2410.220402024-10-30 https://scifaro.com/en/abs/optimal-inapproximability-of-promise-equations-over-finite-groups-2411.016302025-10-06 https://scifaro.com/en/abs/closing-the-complexity-gap-of-the-double-distance-problem-2411.016912025-07-23 https://scifaro.com/en/abs/some-easy-optimization-problems-have-the-overlap-gap-property-2411.018362025-06-25 https://scifaro.com/en/abs/parks-a-doubly-infinite-family-of-np-complete-puzzles-and-generalizations-of-a002464-2411.022512024-11-05 https://scifaro.com/en/abs/one-way-functions-and-polynomial-time-dimension-2411.023922025-02-11 https://scifaro.com/en/abs/eulerian-orientations-and-hadamard-codes-a-novel-connection-via-counting-2411.026122026-02-12 https://scifaro.com/en/abs/conditional-complexity-hardness-monotone-circuit-size-matrix-rigidity-and-tensor-rank-2411.029362026-03-10 https://scifaro.com/en/abs/algebraic-metacomplexity-and-representation-theory-2411.034442025-02-10 https://scifaro.com/en/abs/condensing-and-extracting-against-online-adversaries-2411.041152025-11-13 https://scifaro.com/en/abs/on-the-classical-and-quantum-fine-grained-complexity-of-approximate-cvp-and-max-cut-2411.041242026-03-03 https://scifaro.com/en/abs/the-computational-complexity-of-variational-inequalities-and-applications-in-game-theory-2411.043922024-11-08 https://scifaro.com/en/abs/complexity-theory-of-orbit-closure-intersection-for-tensors-reductions-completeness-and-graph-isomorphism-hardness-2411.046392025-12-03 https://scifaro.com/en/abs/super-unique-tarski-is-in-ueopl-2411.056662024-11-18 https://scifaro.com/en/abs/exploring-the-reductions-between-ssp-np-complete-problems-and-developing-a-compendium-website-displaying-the-results-2411.057962024-11-12 https://scifaro.com/en/abs/randomized-black-box-pit-for-small-depth-regular-non-commutative-circuits-2411.065692025-02-11 https://scifaro.com/en/abs/hyperplanes-avoiding-problem-and-integer-points-counting-in-polyhedra-2411.070302026-04-16 https://scifaro.com/en/abs/low-degree-local-correction-over-the-boolean-cube-2411.073742024-11-14 https://scifaro.com/en/abs/multiparty-communication-complexity-of-collision-finding-2411.074002024-11-13 https://scifaro.com/en/abs/nearly-linear-time-seeded-extractors-with-short-seeds-2411.074732026-02-10 https://scifaro.com/en/abs/feasibly-constructive-proof-of-schwartz-zippel-lemma-and-the-complexity-of-finding-hitting-sets-2411.079662024-11-13 https://scifaro.com/en/abs/a-zero-knowledge-pcp-theorem-2411.079722024-11-13 https://scifaro.com/en/abs/locally-sampleable-uniform-symmetric-distributions-2411.081832025-02-27 https://scifaro.com/en/abs/on-the-complexity-of-hazard-free-formulas-2411.090262025-06-17 https://scifaro.com/en/abs/new-techniques-for-constructing-rare-case-hard-functions-2411.095972025-02-11 https://scifaro.com/en/abs/hardness-amplification-via-group-theory-2411.096192024-11-15 https://scifaro.com/en/abs/bounded-degree-qbf-and-positional-games-2411.100932024-11-19 https://scifaro.com/en/abs/monotone-contractions-2411.101072025-03-28 https://scifaro.com/en/abs/towards-geometry-preserving-reductions-between-constraint-satisfaction-problems-and-other-problems-in-np-2411.104532024-11-19 https://scifaro.com/en/abs/near-optimal-averaging-samplers-and-matrix-samplers-2411.108702025-08-18 https://scifaro.com/en/abs/gadgetless-lifting-beats-round-elimination-improved-lower-bounds-for-pointer-chasing-2411.109962024-11-19 https://scifaro.com/en/abs/improved-pir-schemes-using-matching-vectors-and-derivatives-2411.116112024-11-19 https://scifaro.com/en/abs/near-optimal-time-sparsity-trade-offs-for-solving-noisy-linear-equations-2411.125122024-11-20 https://scifaro.com/en/abs/strong-xor-lemma-for-information-complexity-2411.130152025-06-17 https://scifaro.com/en/abs/independent-roman-domination-parameterized-by-distance-to-cluster-2411.131412024-11-21 https://scifaro.com/en/abs/parameterized-complexity-of-the-star-decomposition-problem-2411.133482025-06-10 https://scifaro.com/en/abs/truly-supercritical-trade-offs-for-resolution-cutting-planes-monotone-circuits-and-weisfeiler-leman-2411.142672024-11-22 https://scifaro.com/en/abs/supercritical-tradeoffs-for-monotone-circuits-2411.142682024-11-22 https://scifaro.com/en/abs/a-k-frac-q-q-2-lower-bound-for-odd-query-locally-decodable-codes-from-bipartite-kikuchi-graphs-2411.142762025-08-26 https://scifaro.com/en/abs/switching-graph-matrix-norm-bounds-from-i-i-d-to-random-regular-graphs-2411.143142024-11-22 https://scifaro.com/en/abs/improved-lower-bounds-for-all-odd-query-locally-decodable-codes-2411.143612024-11-22 https://scifaro.com/en/abs/on-optimal-testing-of-linearity-2411.144312024-11-22 https://scifaro.com/en/abs/reducibility-among-np-hard-graph-problems-and-boundary-classes-2411.145532025-08-11 https://scifaro.com/en/abs/depth-first-search-for-tensor-rank-and-border-rank-over-finite-fields-2411.146762024-11-25 https://scifaro.com/en/abs/on-approximability-of-satisfiable-k-csps-vi-2411.151332024-11-25 https://scifaro.com/en/abs/on-approximability-of-satisfiable-k-csps-vii-2411.151362024-11-25 https://scifaro.com/en/abs/finding-bugs-in-short-proofs-the-metamathematics-of-resolution-lower-bounds-2411.155152026-03-25 https://scifaro.com/en/abs/asymptotic-tensor-rank-is-characterized-by-polynomials-2411.157892024-11-26 https://scifaro.com/en/abs/pathways-to-tractability-for-geometric-thickness-2411.158642024-11-26 https://scifaro.com/en/abs/on-the-complexity-of-combinatorial-optimization-on-fixed-structures-2411.169632024-11-27 https://scifaro.com/en/abs/social-distancing-induced-coronavirus-optimization-algorithm-covo-application-to-multimodal-function-optimization-and-noise-removal-2411.172822024-11-27 https://scifaro.com/en/abs/derandomizing-multivariate-polynomial-factoring-for-low-degree-factors-2411.173302026-03-02 https://scifaro.com/en/abs/outer-ap-rac-graphs-2411.175652024-11-27 https://scifaro.com/en/abs/the-greedy-coin-change-problem-2411.181372024-11-28 https://scifaro.com/en/abs/parameterized-complexity-of-fair-many-to-one-matchings-2411.183672024-11-28 https://scifaro.com/en/abs/on-the-complexity-of-recoverable-robust-optimization-in-the-polynomial-hierarchy-2411.185902024-11-28 https://scifaro.com/en/abs/the-complexity-of-order-finding-for-roabps-2411.189812024-12-02 https://scifaro.com/en/abs/refuting-the-direct-sum-conjecture-for-total-functions-in-deterministic-communication-complexity-2411.190032026-04-15 https://scifaro.com/en/abs/limit-sure-reachability-for-small-memory-policies-in-pomdps-is-np-complete-2412.009412025-06-16 https://scifaro.com/en/abs/unconditional-proofs-of-quantumness-between-small-space-machines-2412.026622026-04-21 https://scifaro.com/en/abs/on-one-way-functions-and-the-average-time-complexity-of-almost-optimal-compression-2412.033922025-01-24 https://scifaro.com/en/abs/an-even-simpler-hard-variant-of-not-all-equal-3-sat-2412.033952024-12-06 https://scifaro.com/en/abs/reduction-from-the-partition-problem-dynamic-lot-sizing-problem-with-polynomial-complexity-2412.050172025-12-24 https://scifaro.com/en/abs/modern-hopfield-networks-require-chain-of-thought-to-solve-mathsf-nc-1-hard-problems-2412.055622026-01-26 https://scifaro.com/en/abs/the-computational-limits-of-state-space-models-and-mamba-via-the-lens-of-circuit-complexity-2412.061482025-02-21 https://scifaro.com/en/abs/query-complexity-with-unknowns-2412.063952024-12-10 https://scifaro.com/en/abs/direct-sums-for-parity-decision-trees-2412.065522025-06-03 https://scifaro.com/en/abs/exact-algorithms-for-multiagent-path-finding-with-communication-constraints-on-tree-like-structures-2412.085562025-06-02 https://scifaro.com/en/abs/nondeterministic-auxiliary-depth-bounded-storage-automata-and-semi-unbounded-fan-in-cascading-circuits-2412.091862024-12-13 https://scifaro.com/en/abs/solving-multiagent-path-finding-on-highly-centralized-networks-2412.094332025-06-03 https://scifaro.com/en/abs/how-to-fit-large-complexity-classes-into-tfnp-2412.099842025-05-26 https://scifaro.com/en/abs/linear-equations-with-min-and-max-operators-computational-complexity-2412.122282024-12-18 https://scifaro.com/en/abs/a-note-on-quantum-lower-bounds-for-local-search-via-congestion-and-expansion-2412.133452024-12-19 https://scifaro.com/en/abs/computational-complexity-of-game-boy-games-2412.154692024-12-23 https://scifaro.com/en/abs/distance-vector-domination-2412.156632024-12-23 https://scifaro.com/en/abs/parameterized-complexity-of-d-r-domination-via-modular-decomposition-2412.156712025-03-18 https://scifaro.com/en/abs/boolean-functions-with-minimal-spectral-sensitivity-2412.160882025-02-21 https://scifaro.com/en/abs/polynomial-and-analytic-methods-for-classifying-complexity-of-planar-graph-homomorphisms-2412.171222024-12-24 https://scifaro.com/en/abs/pushing-blocks-via-checkable-gadgets-pspace-completeness-of-push-1f-and-block-box-dude-2412.200792024-12-31 https://scifaro.com/en/abs/functional-lower-bounds-in-algebraic-proofs-symmetry-lifting-and-barriers-2412.201142024-12-31 https://scifaro.com/en/abs/on-extremal-properties-of-k-cnf-capturing-threshold-functions-2412.204932024-12-31 https://scifaro.com/en/abs/special-coverings-of-sets-and-boolean-functions-2501.000082025-04-01 https://scifaro.com/en/abs/hazard-free-decision-trees-2501.008312025-01-03 https://scifaro.com/en/abs/a-parameterized-linear-formulation-of-the-integer-hull-2501.023472025-10-21 https://scifaro.com/en/abs/new-pseudorandom-generators-and-correlation-bounds-using-extractors-2501.026532025-01-07 https://scifaro.com/en/abs/local-enumeration-the-not-all-equal-case-2501.028862025-01-07 https://scifaro.com/en/abs/inverse-intersections-for-boolean-satisfiability-problems-2501.032812025-05-20 https://scifaro.com/en/abs/on-complexity-of-restricted-fragments-of-decision-dnnf-2501.037102026-03-06 https://scifaro.com/en/abs/parameterized-complexity-of-segment-routing-2501.038712025-01-08 https://scifaro.com/en/abs/modular-counting-csp-reductions-and-algorithms-2501.042242025-01-24 https://scifaro.com/en/abs/mim-width-is-paranp-complete-2501.056382025-01-13 https://scifaro.com/en/abs/col-is-pspace-complete-on-triangular-grids-2501.065742025-01-28 https://scifaro.com/en/abs/determining-distances-and-consensus-between-mutation-trees-2501.075292025-01-14 https://scifaro.com/en/abs/towards-the-pseudorandomness-of-expander-random-walks-for-read-once-acc0-circuits-2501.077522025-01-23 https://scifaro.com/en/abs/hardness-of-clique-approximation-for-monotone-circuits-2501.095452025-01-17 https://scifaro.com/en/abs/non-crossing-h-graphs-a-generalization-of-proper-interval-graphs-admitting-fpt-algorithms-2501.111922025-10-27 https://scifaro.com/en/abs/optimizing-for-aggressive-style-strategies-in-flesh-and-blood-is-np-hard-2501.116832025-03-04 https://scifaro.com/en/abs/nonuniform-deterministic-finite-automata-over-finite-algebraic-structures-2501.122602025-01-22 https://scifaro.com/en/abs/complexity-of-jelly-no-and-hanano-games-with-various-constraints-2501.122822026-04-14 https://scifaro.com/en/abs/efficient-algorithm-for-sparse-fourier-transform-of-generalized-q-ary-functions-2501.123652025-08-05 https://scifaro.com/en/abs/interactive-oracle-proofs-of-proximity-to-codes-on-graphs-2501.143372025-05-14 https://scifaro.com/en/abs/explaining-the-ubiquity-of-phase-transitions-in-decision-problems-2501.145692025-01-27 https://scifaro.com/en/abs/compilation-and-fast-model-counting-beyond-cnf-2502.004342025-02-04 https://scifaro.com/en/abs/some-structural-complexity-results-for-exists-mathbb-r-2502.006802025-02-04 https://scifaro.com/en/abs/biased-linearity-testing-in-the-1-regime-2502.019002025-02-05 https://scifaro.com/en/abs/the-text-fp-text-np-versus-p-dichotomy-for-eo-2502.020122025-04-28 https://scifaro.com/en/abs/upper-and-lower-bounds-on-t-1-and-t-2-decision-tree-model-2502.020222025-02-05 https://scifaro.com/en/abs/new-sufficient-algebraic-conditions-for-local-consistency-over-homogeneous-structures-of-finite-duality-2502.020902025-02-05 https://scifaro.com/en/abs/the-algebraic-cost-of-a-boolean-sum-2502.024422025-07-18 https://scifaro.com/en/abs/space-bounded-online-kolmogorov-complexity-is-additive-2502.027772025-07-15 https://scifaro.com/en/abs/improved-debordering-of-waring-rank-2502.031502025-02-06 https://scifaro.com/en/abs/completeness-theorems-for-k-sum-and-geometric-friends-deciding-fragments-of-integer-linear-arithmetic-2502.045812025-02-10 https://scifaro.com/en/abs/computational-complexity-of-polynomial-subalgebras-2502.052782025-07-18 https://scifaro.com/en/abs/induced-disjoint-paths-without-an-induced-minor-2502.052892025-02-11 https://scifaro.com/en/abs/the-complexity-of-blocking-all-solutions-2502.053482025-02-11 https://scifaro.com/en/abs/from-an-odd-arity-signature-to-a-holant-dichotomy-2502.055972025-02-11 https://scifaro.com/en/abs/featpca-a-feature-subspace-based-principal-component-analysis-technique-for-enhancing-clustering-of-single-cell-rna-seq-data-2502.056472025-02-11 https://scifaro.com/en/abs/a-parameterized-study-of-secluded-structures-in-directed-graphs-2502.060482025-12-16 https://scifaro.com/en/abs/a-quadratic-lower-bound-for-stable-roommates-solvability-2502.064642025-02-12 https://scifaro.com/en/abs/symmetric-algebraic-circuits-and-homomorphism-polynomials-2502.067402026-03-17 https://scifaro.com/en/abs/equations-over-finite-monoids-with-infinite-promises-2502.067622026-05-06 https://scifaro.com/en/abs/reductions-between-code-equivalence-problems-2502.079162025-11-27 https://scifaro.com/en/abs/weighted-pseudorandom-generators-for-read-once-branching-programs-via-weighted-pseudorandom-reductions-2502.082722025-07-22 https://scifaro.com/en/abs/oracle-separations-for-rph-2502.092792025-10-08 https://scifaro.com/en/abs/realizing-graphs-with-cut-constraints-2502.093582025-02-14 https://scifaro.com/en/abs/differentially-private-compression-and-the-sensitivity-of-lz77-2502.095842025-09-25 https://scifaro.com/en/abs/membership-and-conjugacy-in-inverse-semigroups-2502.101032025-08-07 https://scifaro.com/en/abs/maxmin-separation-problems-fpt-algorithms-for-st-separator-and-odd-cycle-transversal-2502.104492025-02-18 https://scifaro.com/en/abs/faster-search-for-tensor-decomposition-over-finite-fields-2502.123902025-02-19 https://scifaro.com/en/abs/eliminating-majority-illusions-2502.143532025-02-21 https://scifaro.com/en/abs/an-exposition-of-recent-list-size-bounds-of-frs-codes-2502.143582025-02-21 https://scifaro.com/en/abs/low-degree-conjecture-implies-sharp-computational-thresholds-in-stochastic-block-model-2502.150242025-04-29 https://scifaro.com/en/abs/on-the-hardness-of-the-drone-delivery-problem-2502.151942025-02-25 https://scifaro.com/en/abs/list-decoding-quotient-reed-muller-codes-2502.156502025-02-24 https://scifaro.com/en/abs/computing-the-polytope-diameter-is-even-harder-than-np-hard-already-for-perfect-matchings-2502.163982025-11-04 https://scifaro.com/en/abs/tarski-lower-bounds-from-multi-dimensional-herringbones-2502.166792025-07-15 https://scifaro.com/en/abs/when-can-we-solve-the-weighted-low-rank-approximation-problem-in-truly-subquadratic-time-2502.169122025-02-25 https://scifaro.com/en/abs/restricted-csps-and-f-free-digraph-algorithmics-2502.175962025-02-26 https://scifaro.com/en/abs/simulating-time-with-square-root-space-2502.177792025-02-26 https://scifaro.com/en/abs/property-testing-in-bounded-degree-hypergraphs-2502.183822025-03-14 https://scifaro.com/en/abs/low-rank-matrix-rigidity-tight-lower-bounds-and-hardness-amplification-2502.195802025-02-28 https://scifaro.com/en/abs/polynomial-time-classical-versus-quantum-algorithms-for-representation-theoretic-multiplicities-2502.202532025-10-21 https://scifaro.com/en/abs/reduction-of-the-group-isomorphism-problem-to-the-group-automorphism-problem-2503.011802025-03-04 https://scifaro.com/en/abs/temporal-cycle-detection-and-acyclic-temporization-2503.026942025-03-05 https://scifaro.com/en/abs/parameterized-algorithms-for-matching-integer-programs-with-additional-rows-and-columns-2503.055482025-10-20 https://scifaro.com/en/abs/minimum-cost-flow-decomposition-on-arc-coloured-networks-2503.058952025-03-11 https://scifaro.com/en/abs/on-the-complexity-of-solving-equations-over-the-symmetric-group-s-4-2503.072852025-03-11 https://scifaro.com/en/abs/evolomino-is-np-complete-2503.076112025-11-11 https://scifaro.com/en/abs/the-computational-complexity-of-positive-non-clashing-teaching-in-graphs-2503.076652025-03-12 https://scifaro.com/en/abs/computational-complexity-and-integer-programming-formulation-of-the-oredango-puzzle-2503.103932025-03-14 https://scifaro.com/en/abs/pcp-free-apx-hardness-of-nearest-codeword-and-minimum-distance-2503.111312025-06-26 https://scifaro.com/en/abs/computational-complexity-of-finding-subgroups-of-a-given-order-2503.112382026-02-26 https://scifaro.com/en/abs/semi-streaming-algorithms-for-graph-property-certification-2503.129962025-03-18 https://scifaro.com/en/abs/deciding-if-a-dag-is-interesting-is-hard-2503.133982025-03-18 https://scifaro.com/en/abs/boolean-circuit-complexity-and-two-dimensional-cover-problems-2503.141172025-03-19 https://scifaro.com/en/abs/recognizing-and-realizing-temporal-reachability-graphs-2503.157712025-03-21 https://scifaro.com/en/abs/query-efficient-fixpoints-of-ell-p-contractions-2503.160892025-03-31 https://scifaro.com/en/abs/graph-colouring-is-hard-on-average-for-polynomial-calculus-and-nullstellensatz-2503.170222025-03-24 https://scifaro.com/en/abs/range-avoidance-in-boolean-circuits-via-turan-type-bounds-2503.171142025-07-15 https://scifaro.com/en/abs/privacy-preserving-hamming-distance-computation-with-property-preserving-hashing-2503.178442025-03-25 https://scifaro.com/en/abs/upper-and-lower-bounds-for-the-linear-ordering-principle-2503.191882026-03-31 https://scifaro.com/en/abs/primes-via-zeros-interactive-proofs-for-testing-primality-of-natural-classes-of-ideals-2503.200712025-03-27 https://scifaro.com/en/abs/lattice-based-crypto-breaks-in-a-superposition-of-spacetimes-2503.214002025-04-02 https://scifaro.com/en/abs/time-hierarchies-for-sublogarithmic-space-quantum-computation-2503.215822025-05-07 https://scifaro.com/en/abs/average-case-hardness-of-parity-problems-orthogonal-vectors-k-sum-and-more-2503.219512025-03-31 https://scifaro.com/en/abs/the-moment-polytope-of-matrix-multiplication-is-not-maximal-2503.226332025-03-31 https://scifaro.com/en/abs/integer-multiplication-is-at-least-as-hard-as-matrix-transposition-2503.228482025-04-01 https://scifaro.com/en/abs/disjunctive-complexity-2503.229972025-04-01 https://scifaro.com/en/abs/on-the-difficulty-of-order-constrained-pattern-matching-with-applications-to-feature-matching-based-malware-detection-2503.231762025-04-01 https://scifaro.com/en/abs/simple-general-magnification-of-circuit-lower-bounds-2503.240612025-06-24 https://scifaro.com/en/abs/is-graph-local-complementation-inherently-sequential-2503.241442025-09-22 https://scifaro.com/en/abs/lifting-for-arbitrary-gadgets-2503.243512025-04-01 https://scifaro.com/en/abs/sat-problem-and-limit-of-solomonoff-s-inductive-reasoning-theory-2504.003182025-04-02 https://scifaro.com/en/abs/improved-round-by-round-soundness-iops-via-reed-muller-codes-2504.003462025-04-02 https://scifaro.com/en/abs/dichotomies-for-csp-on-graphs-that-forbid-a-clique-as-a-minor-2504.013542025-04-03 https://scifaro.com/en/abs/improved-bounds-for-coin-flipping-leader-election-and-random-selection-2504.018562026-04-30 https://scifaro.com/en/abs/recovery-reductions-conjectures-and-barriers-2504.018992025-09-09 https://scifaro.com/en/abs/sublinear-time-algorithms-for-abelian-group-isomorphism-and-basis-construction-2504.023872025-11-19 https://scifaro.com/en/abs/mind-the-gap-not-for-svp-hardness-under-eth-2504.026952026-04-22 https://scifaro.com/en/abs/a-lower-bound-on-conservative-elementary-object-systems-coverability-2504.035912025-04-07 https://scifaro.com/en/abs/the-probability-spaces-of-quicksort-2504.041332025-06-23 https://scifaro.com/en/abs/meta-mathematics-of-computational-complexity-theory-2504.044162025-04-08 https://scifaro.com/en/abs/ineffectiveness-for-search-and-undecidability-of-pcsp-meta-problems-2504.046392026-05-26 https://scifaro.com/en/abs/finding-large-k-colorable-induced-subgraphs-in-bull-chair-free-and-bull-e-free-graphs-2504.049842025-04-15 https://scifaro.com/en/abs/polynomial-time-pit-from-almost-necessary-assumptions-2504.060442025-08-19 https://scifaro.com/en/abs/hardness-of-4-colourings-g-colourable-graphs-2504.075922025-04-11 https://scifaro.com/en/abs/deterministic-factorization-of-constant-depth-algebraic-circuits-in-subexponential-time-2504.080632025-06-17 https://scifaro.com/en/abs/collapsing-catalytic-classes-2504.084442025-04-14 https://scifaro.com/en/abs/relative-error-testing-of-conjunctions-and-decision-lists-2504.089872025-04-15 https://scifaro.com/en/abs/testing-juntas-and-junta-subclasses-with-relative-error-2504.093122025-04-15 https://scifaro.com/en/abs/bipartite-matching-is-in-catalytic-logspace-2504.099912025-04-15 https://scifaro.com/en/abs/a-pseudorandom-generator-for-functions-of-low-degree-polynomial-threshold-functions-2504.109042025-04-22 https://scifaro.com/en/abs/circuit-metaconstruction-in-logspace-for-rice-like-complexity-lower-bounds-in-ans-and-sgrs-2504.113482025-04-16 https://scifaro.com/en/abs/meta-theorem-for-hardness-on-fcp-problem-2504.118592025-04-17 https://scifaro.com/en/abs/reachability-in-geometrically-d-dimensional-vass-2504.123022025-04-18 https://scifaro.com/en/abs/dichotomy-for-orderings-2504.132682026-01-09 https://scifaro.com/en/abs/polynomial-time-tractable-problems-over-the-p-adic-numbers-2504.135362025-04-21 https://scifaro.com/en/abs/forgetting-in-short-and-heterogeneous-sequences-of-belief-revisions-2504.139862025-05-19 https://scifaro.com/en/abs/holant-dichotomy-on-domain-size-3-a-geometric-perspective-2504.140742025-04-22 https://scifaro.com/en/abs/a-note-on-the-complexity-of-defensive-domination-2504.143902025-10-02 https://scifaro.com/en/abs/rank-bounds-and-pit-for-sigma-3-pi-sigma-pi-d-circuits-via-a-non-linear-edelstein-kelly-theorem-2504.147292025-04-28 https://scifaro.com/en/abs/deterministic-depth-4-pit-and-normalization-2504.151432025-06-16 https://scifaro.com/en/abs/key-agreement-exists-if-and-only-if-the-interactive-vs-non-interactive-kolmogorov-problem-is-not-in-iobpp-a-short-proof-2504.163112025-04-24 https://scifaro.com/en/abs/catalytic-computing-and-register-programs-beyond-log-depth-2504.174122025-04-25 https://scifaro.com/en/abs/on-the-degree-automatability-of-sum-of-squares-proofs-2504.177562025-04-25 https://scifaro.com/en/abs/worst-case-and-average-case-hardness-of-hypercycle-and-database-problems-2504.186402025-04-29 https://scifaro.com/en/abs/modp-multi-objective-directional-prompting-2504.187222025-04-29 https://scifaro.com/en/abs/hardness-of-finding-kings-and-strong-kings-2504.193862025-04-29 https://scifaro.com/en/abs/on-the-complexity-of-identifying-groups-without-abelian-normal-subgroups-parallel-first-order-and-gi-hardness-2504.197772025-04-29 https://scifaro.com/en/abs/probabilistic-and-causal-satisfiability-constraining-the-model-2504.199442025-04-29 https://scifaro.com/en/abs/closure-properties-and-characterizations-of-totp-2504.202622025-07-18 https://scifaro.com/en/abs/improved-bounds-on-the-space-complexity-of-circuit-evaluation-2504.209502025-06-23 https://scifaro.com/en/abs/multicut-problems-in-almost-planar-graphs-the-dependency-of-complexity-on-the-demand-pattern-2504.216242026-01-27 https://scifaro.com/en/abs/computational-complexity-of-uap-reverse-engineering-a-formal-analysis-of-automaton-identification-and-data-complexity-2505.000512025-05-02 https://scifaro.com/en/abs/one-way-communication-complexity-of-minimum-vertex-cover-in-general-graphs-2505.001642025-05-13 https://scifaro.com/en/abs/on-the-space-complexity-of-online-convolution-2505.001812026-02-10 https://scifaro.com/en/abs/the-planted-orthogonal-vectors-problem-2505.002062025-09-16 https://scifaro.com/en/abs/the-tape-reconfiguration-problem-and-its-consequences-for-dominating-set-reconfiguration-2505.009882025-05-05 https://scifaro.com/en/abs/more-efficient-sifting-for-grid-norms-and-applications-to-multiparty-communication-complexity-2505.015872025-05-06 https://scifaro.com/en/abs/on-optimal-distinguishers-for-planted-clique-2505.019902025-07-22 https://scifaro.com/en/abs/pls-completeness-of-string-permutations-2505.026222025-07-18 https://scifaro.com/en/abs/a-critique-of-lin-s-on-text-np-versus-text-conp-and-frege-systems-2505.056582025-05-12 https://scifaro.com/en/abs/safety-analysis-in-the-ngac-model-2505.064062025-05-13 https://scifaro.com/en/abs/battle-sheep-is-pspace-complete-2505.064142025-05-13 https://scifaro.com/en/abs/on-finding-randomly-planted-cliques-in-arbitrary-graphs-2505.067252025-05-13 https://scifaro.com/en/abs/cluster-vertex-deletion-problems-on-cubic-graphs-2505.074432025-05-13 https://scifaro.com/en/abs/short-and-useful-quantum-proofs-for-sublogarithmic-space-verifiers-2505.084622025-05-14 https://scifaro.com/en/abs/busout-is-np-complete-2505.091652025-05-15 https://scifaro.com/en/abs/phase-transitions-in-decision-problems-over-odd-sized-alphabets-2505.092822025-05-15 https://scifaro.com/en/abs/new-results-in-canonical-polyadic-decomposition-over-finite-fields-2505.098242025-11-11 https://scifaro.com/en/abs/a-fine-grained-complexity-view-on-propositional-abduction-algorithms-and-lower-bounds-2505.102012025-05-16 https://scifaro.com/en/abs/algebraic-pseudorandomness-in-vnc-0-2505.106752025-08-19 https://scifaro.com/en/abs/complexity-of-firefighting-on-graphs-2505.110822026-04-15