FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2182026046> ?p ?o ?g. }

• W2182026046 abstract "This work studies two of the most fundamental problems in computer science: satisfiability (SAT), and group isomorphism (GroupISO). We propose new approaches and concepts, introduce new techniques and we identify connections between these two problems. For SAT, our study focuses on exact algorithms. First, we investigate the performance of the current world record algorithm for general SAT, and show new lower bounds, introducing a new expansion property. We also conduct comprehensive research on practical instances parameterized by tree-width or path-width w. We give optimal, modulo our technique, optimal algorithms, new characterizations of small space computation using SAT of bounded width parameters, and propose a conjecture regarding lower bounds for time-space trade-o↵s. Specifically, Alekhnovitch and Razborov in 2002 gave an algorithm whose running time is 2wnO(1) and space 2wnO(1) and asked if anything can be done to reduce the space to polynomial. We give an algorithm that runs in time 2logn·wnO(1) and space nO(1), and we conjecture that removing the log n without blowing up the running space to exponential in w is impossible and show that the conjecture is closely related to the question of “NC vs SC”. In the setting of propositional proof complexity, we make progress in validating our conjecture by lifting a previous trade-o↵ lower bound result for resolution by Beam, Beck and Impagliazzo to the stronger polynomial calculus resolution. We bring tools developed in our study of SAT toGroupISO and obtain the following two results. First, we observe that GroupISO can be encoded as SAT instances of small width parameters by showing a nondeterministic algorithm which runs simultaneously in time nO(1) and space O(log2 n), where n is the number of group elements. Second, we compare the complexity of GroupISO and the well-known graph isomorphism problem (GraphISO), and give a new conditional separation. In an independent direction, we introduce a family of small-space heuristics. Finally, for GroupISO with the promise that the input groups are from a certain class, we extend the borderline of polynomial time tractable to groups with normal Hall subgroups and introduce techniques from representation theory into group isomorphism testing." @default.
• W2182026046 created "2016-06-24" @default.
• W2182026046 creator A5049161422 @default.
• W2182026046 date "2013-01-01" @default.
• W2182026046 modified "2023-09-27" @default.
• W2182026046 title "Towards Understanding Satisfiability, Group Isomorphism and Their Connections" @default.
• W2182026046 cites W1483894850 @default.
• W2182026046 cites W1490189322 @default.
• W2182026046 cites W1507717186 @default.
• W2182026046 cites W1510779330 @default.
• W2182026046 cites W1541824250 @default.
• W2182026046 cites W1558213091 @default.
• W2182026046 cites W1567053297 @default.
• W2182026046 cites W1593916827 @default.
• W2182026046 cites W1596185498 @default.
• W2182026046 cites W1854532547 @default.
• W2182026046 cites W1855717412 @default.
• W2182026046 cites W189831120 @default.
• W2182026046 cites W1920638964 @default.
• W2182026046 cites W1965022641 @default.
• W2182026046 cites W1968357081 @default.
• W2182026046 cites W1973322735 @default.
• W2182026046 cites W1980351200 @default.
• W2182026046 cites W1982129592 @default.
• W2182026046 cites W1994584977 @default.
• W2182026046 cites W1995725694 @default.
• W2182026046 cites W2004485491 @default.
• W2182026046 cites W2017205387 @default.
• W2182026046 cites W2020306558 @default.
• W2182026046 cites W2023033882 @default.
• W2182026046 cites W2027188157 @default.
• W2182026046 cites W2027562075 @default.
• W2182026046 cites W2029448190 @default.
• W2182026046 cites W2033405938 @default.
• W2182026046 cites W2033718868 @default.
• W2182026046 cites W2037526361 @default.
• W2182026046 cites W2039456297 @default.
• W2182026046 cites W2045583484 @default.
• W2182026046 cites W2048051309 @default.
• W2182026046 cites W2048154172 @default.
• W2182026046 cites W2049136377 @default.
• W2182026046 cites W2051700974 @default.
• W2182026046 cites W2051748083 @default.
• W2182026046 cites W2055472648 @default.
• W2182026046 cites W2057361103 @default.
• W2182026046 cites W2058258808 @default.
• W2182026046 cites W2060788193 @default.
• W2182026046 cites W2062702490 @default.
• W2182026046 cites W2062897452 @default.
• W2182026046 cites W2071260871 @default.
• W2182026046 cites W2074834475 @default.
• W2182026046 cites W2077723005 @default.
• W2182026046 cites W2077925882 @default.
• W2182026046 cites W2078637176 @default.
• W2182026046 cites W2079275582 @default.
• W2182026046 cites W2079926883 @default.
• W2182026046 cites W2084384424 @default.
• W2182026046 cites W2087083200 @default.
• W2182026046 cites W2090518395 @default.
• W2182026046 cites W2098642112 @default.
• W2182026046 cites W2099856971 @default.
• W2182026046 cites W2108637261 @default.
• W2182026046 cites W2109616743 @default.
• W2182026046 cites W2111829945 @default.
• W2182026046 cites W2113226559 @default.
• W2182026046 cites W2122782108 @default.
• W2182026046 cites W2125057414 @default.
• W2182026046 cites W2126442135 @default.
• W2182026046 cites W2127563879 @default.
• W2182026046 cites W2133527541 @default.
• W2182026046 cites W2139212134 @default.
• W2182026046 cites W2139442450 @default.
• W2182026046 cites W2143693959 @default.
• W2182026046 cites W2149719182 @default.
• W2182026046 cites W2156052684 @default.
• W2182026046 cites W2156088544 @default.
• W2182026046 cites W2159003936 @default.
• W2182026046 cites W2168704151 @default.
• W2182026046 cites W24061466 @default.
• W2182026046 cites W2963982514 @default.
• W2182026046 cites W2984546510 @default.
• W2182026046 cites W3101351575 @default.
• W2182026046 cites W3140964092 @default.
• W2182026046 cites W76787075 @default.
• W2182026046 hasPublicationYear "2013" @default.
• W2182026046 type Work @default.
• W2182026046 sameAs 2182026046 @default.
• W2182026046 citedByCount "0" @default.
• W2182026046 crossrefType "journal-article" @default.
• W2182026046 hasAuthorship W2182026046A5049161422 @default.
• W2182026046 hasConcept C111919701 @default.
• W2182026046 hasConcept C11413529 @default.
• W2182026046 hasConcept C114614502 @default.
• W2182026046 hasConcept C118615104 @default.
• W2182026046 hasConcept C134306372 @default.
• W2182026046 hasConcept C138268822 @default.
• W2182026046 hasConcept C154945302 @default.
• W2182026046 hasConcept C165464430 @default.
• W2182026046 hasConcept C168773769 @default.
• W2182026046 hasConcept C179799912 @default.

• next