Search results

From MaRDI portal
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • 2021-04-19 Paper Stable matchings with covering constraints: a complete computational trichotomy 2020-04-01 Paper Correction to: ``A connection between sports...
    10 bytes (16 words) - 01:06, 12 December 2023
  • Approximating Pairwise Correlations in the Ising Model 2019-12-16 Paper A Complexity Trichotomy for Approximately Counting List H -Colorings 2019-12-06 Paper Uniform...
    10 bytes (19 words) - 02:08, 10 December 2023
  • Modulo 2 2019-12-06 Paper A Complexity Trichotomy for Approximately Counting List H -Colorings 2019-12-06 Paper The Complexity of Approximately Counting...
    10 bytes (19 words) - 20:44, 9 December 2023
  • general size 2023-07-26 Paper Complexity classification of the eight-vertex model 2023-07-17 Paper A complexity trichotomy for \(k\)-regular asymmetric...
    10 bytes (18 words) - 02:08, 10 December 2023
  • 2023-08-04 Paper Worst-case expansions of complete theories 2023-06-19 Paper MOST(?) THEORIES HAVE BOREL COMPLETE REDUCTS 2023-02-27 Paper COUNTING SIBLINGS...
    10 bytes (18 words) - 14:04, 8 December 2023
  • An approximation trichotomy for Boolean \#CSP 2010-05-25 Paper The Complexity of Weighted Boolean #CSP 2009-11-06 Paper The complexity of weighted Boolean...
    10 bytes (18 words) - 20:41, 9 December 2023
  • 2020-05-27 Paper Stable matchings with covering constraints: a complete computational trichotomy 2020-04-01 Paper Parameterized algorithms for generalizations...
    10 bytes (17 words) - 03:04, 7 October 2023
  • Paper Complexity of Counting the Optimal Solutions 2008-07-10 Paper Complexity of clausal constraints over chains 2008-04-03 Paper On the Complexity of Computing...
    10 bytes (16 words) - 17:43, 9 December 2023
  • Publication Date of Publication Type Complexity profiles and generic Muchnik reducibility 2023-12-21 Paper Limit computability and ultrafilters 2023-09-13...
    10 bytes (16 words) - 06:10, 7 October 2023
  • Paper Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis 2019-05-15 Paper Strong partial clones and the time complexity of SAT...
    10 bytes (16 words) - 09:53, 7 October 2023
  • you? Best responses to factored strategies 2021-04-27 Paper Universal and complete sets in martingale theory 2020-05-11 Paper The Shapley value, the proper...
    10 bytes (17 words) - 17:26, 8 December 2023
  • Frontier of Data Complexity in Team Semantics 2022-12-08 Paper https://portal.mardi4nfdi.de/entity/Q5013879 2021-12-03 Paper Descriptive complexity of \#P functions:...
    10 bytes (17 words) - 03:13, 25 September 2023
  • IDEALS 2021-10-27 Paper Transfinite sequences of topologies, descriptive complexity, and approximating equivalence relations 2021-07-12 Paper Concentration...
    10 bytes (16 words) - 17:25, 8 December 2023
  • regular, again 2021-10-25 Paper Monocolored topological complete graphs in colorings of uncountable complete graphs 2021-09-22 Paper Mutual stationarity and singular...
    10 bytes (17 words) - 10:23, 8 December 2023
  • Paper Strong duality in Horn minimization 2017-11-22 Paper Parameterized complexity of sparse linear complementarity problems 2017-10-10 Paper https://portal...
    10 bytes (16 words) - 20:12, 24 September 2023
  • org/abs/1602.08230 zbMATH Keywords matching; stable marriage; complete complexity trichotomy; covering constraints Mathematics Subject Classification ID...
    15 bytes (60 words) - 10:26, 30 January 2024
  • reconfiguration; combinatorial reconfiguration; complexity index; integer linear systems; integer linear system; complexity trichotomy Mathematics Subject Classification...
    15 bytes (91 words) - 15:33, 29 April 2024
  • theory; trichotomy; Boolean; robust satisfiability Mathematics Subject Classification ID 68Q25: Analysis of algorithms and problem complexity 90C09: Boolean...
    15 bytes (53 words) - 16:49, 7 February 2024
  • theory; trichotomy; Boolean; robust satisfiability Mathematics Subject Classification ID 68Q25: Analysis of algorithms and problem complexity 68Q17: Computational...
    15 bytes (82 words) - 07:26, 30 January 2024
  • sets Simple theories Defining the Turing jump The polynomial topological complexity of Fatou-Julia sets A Borel reductibility theory for classes of countable...
    15 bytes (279 words) - 15:14, 3 February 2024
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)