Filters








11,062 Hits in 2.0 sec

Kaffeehausliteraten und Exilliteratur im Kontext von Marc Augés Pariser Bistro: Kracauer, Roth und Kesten

Jan T. Schlosser
2019 Recherches germaniques  
Marc Augés Pariser Bistro Die Kaffeehausliteraten Siegfried Kracauer, Joseph Roth und Hermann Kesten Siegfried Kracauer ging im Februar 1933 ins Exil nach Paris.  ...  Kesten und Roth verbindet das Bestreben, in einer Zeit der Auflösung Ordnung herstellen zu wollen. Der Humanist und Optimist Kesten antizipiert wesentliche Gedanken Marc Augés.  ... 
doi:10.4000/rg.2165 fatcat:lhvg2anivrcc7phvbmie27gmia

Dieter Roth. Processing the world + Dieter Roth & Arnulf Rainer: Collaborations + Die Kakausener Gemeine

Jean-Marc Huitorel
2014 Critique d'art  
De 1971 à 1993, les deux amis, en effet, Dieter Roth. Processing the world + Dieter Roth & Arnulf Rainer: Collaboratio...  ...  Dieter Roth. Processing the world + Dieter Roth & Arnulf Rainer: Collaboratio... Critique d'art , Toutes les notes de lecture en ligne | 2015  ... 
doi:10.4000/critiquedart.15455 fatcat:xh2upxuc5zhm7cljqlxzkei3ma

Laurent Roth, Petit Prince à la caméra

Marc-Antoine Vaugeois
2021 Entrelacs  
Laurent Roth, Petit Prince à la caméra Marc-Antoine Vaugeois 1 « S'il vous plaît… dessine-moi un mouton !  ...  Une maison de famille (2004).Raoul Coutard et Mireille Perrier dans Les Yeux brûlés (1986). 3 AUTEUR MARC-ANTOINE VAUGEOISRéalisateur, acteur et critique de cinéma.  ... 
doi:10.4000/entrelacs.6177 fatcat:ydmsgb662vchdp46orq6kngmne

Titelei/Inhaltsverzeichnis [chapter]

Jens Prütting, Günter H. Roth, Marc-Philippe Weller
2017 Handels- und Gesellschaftsrecht  
Marc-Philippe Weller ist Direktor am Institut für ausländisches und internationales Privat-und Wirtschaftsrecht der Universität Heidelberg. Juniorprofessor Dr. Jens Prütting, LL.M. oec.  ... 
doi:10.15358/9783800655649-i fatcat:l46qhek2mvewjipax2kfbvfdyy

Titelei/Inhaltsverzeichnis [chapter]

Günter H. Roth, Marc-Philippe Weller, Jens Prütting
2020 Handels- und Gesellschaftsrecht  
o Systematisch spricht für die Notwendigkeit einer Willensaus- übung auch die Rest-und Auffangfunktion des § 5 HGB. 4 KKRD/Roth HGB § 15 Rn. 4. 5 MüKoHGB/Krebs § 15 Rn. 54. 6 EBJS/Kindler HGB §  ... 
doi:10.15358/9783800663897-i fatcat:luyu3wgmh5ggdig2vrr4lts4vi

Parameterized Counting of Partially Injective Homomorphisms

Marc Roth
2021 Algorithmica  
AbstractWe study the parameterized complexity of the problem of counting graph homomorphisms with given partial injectivity constraints, i.e., inequalities between pairs of vertices, which subsumes counting of graph homomorphisms, subgraph counting and, more generally, counting of answers to equi-join queries with inequalities. Our main result presents an exhaustive complexity classification for the problem in fixed-parameter tractable and $$\#\mathsf {W[1]}$$ # W [ 1 ] -complete cases. The
more » ... f relies on the framework of linear combinations of homomorphisms as independently discovered by Chen and Mengel (PODS 16) and by Curticapean, Dell and Marx in the recent breakthrough result regarding the exact complexity of the subgraph counting problem (STOC 17). Moreover, we invoke Rota's NBC-Theorem to obtain an explicit criterion for fixed-parameter tractability based on treewidth. The abstract classification theorem is then applied to the problem of counting locally injective graph homomorphisms from small pattern graphs to large target graphs. As a consequence, we are able to fully classify its parameterized complexity depending on the class of allowed pattern graphs.
doi:10.1007/s00453-021-00805-y fatcat:oetq4yn2nnhy7ovyr47zgch6am

Parameterized counting of trees, forests and matroid bases [article]

Cornelius Brand, Marc Roth
2016 arXiv   pre-print
We investigate the complexity of counting trees, forests and bases of matroids from a parameterized point of view. It turns out that the problems of computing the number of trees and forests with k edges are # W[1]-hard when parameterized by k. Together with the recent algorithm for deterministic matrix truncation by Lokshtanov et al. (ICALP 2015), the hardness result for k-forests implies # W[1]-hardness of the problem of counting bases of a matroid when parameterized by rank or nullity, even
more » ... f the matroid is restricted to be representable over a field of characteristic 2. We complement this result by pointing out that the problem becomes fixed parameter tractable for matroids represented over a fixed finite field.
arXiv:1611.01823v1 fatcat:mzq5iqfqsrgufczdc2seww63km

Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices [article]

Marc Roth
2017 arXiv   pre-print
We present a framework for the complexity classification of parameterized counting problems that can be formulated as the summation over the numbers of homomorphisms from small pattern graphs H_1,...,H_l to a big host graph G with the restriction that the coefficients correspond to evaluations of the M\"obius function over the lattice of a graphic matroid. This generalizes the idea of Curticapean, Dell and Marx [STOC 17] who used a result of Lov\'asz stating that the number of subgraph
more » ... s from a graph H to a graph G can be expressed as such a sum over the lattice of partitions of H. In the first step we introduce what we call graphically restricted homomorphisms that, inter alia, generalize subgraph embeddings as well as locally injective homomorphisms. We provide a complete parameterized complexity dichotomy for counting such homomorphisms, that is, we identify classes of patterns for which the problem is fixed-parameter tractable (FPT), including an algorithm, and prove that all other pattern classes lead to #W[1]-hard problems. The main ingredients of the proof are the complexity classification of linear combinations of homomorphisms due to Curticapean, Dell and Marx [STOC 17] as well as a corollary of Rota's NBC Theorem which states that the sign of the M\"obius function over a geometric lattice only depends on the rank of its arguments. We use the general theorem to classify the complexity of counting locally injective homomorphisms as well as homomorphisms that are injective in the r-neighborhood for constant r. Furthermore, we show that the former has "real" FPT cases by considering the subgraph counting problem restricted to trees on both sides. Finally we show that the dichotomy for counting graphically restricted homomorphisms readily extends to so-called linear combinations.
arXiv:1706.08414v1 fatcat:54q2ljvnp5ewboak3d67ij73oq

Counting Subgraphs in Somewhere Dense Graphs [article]

Marco Bressan, Leslie Ann Goldberg, Kitty Meeks, Marc Roth
2022 arXiv   pre-print
, Wellnitz; SODA 20), and in degenerate graphs (Bressan, Roth; FOCS 21), as well as counting k-independent sets in bipartite graphs (Curticapean et al.; Algorithmica 19).  ...  classifications subsume a wide variety of previous results on the matching and independent set problem, such as counting k-matchings in bipartite graphs (Curticapean, Marx; FOCS 14), in F-colourable graphs (Roth  ...  , Wellnitz; SODA 20) , and in degenerate graphs (Bressan, Roth; FOCS 21) , as well as counting k-independent sets in bipartite graphs (Curticapean et al. ; Algorithmica 19) .  ... 
arXiv:2209.03402v1 fatcat:fezwi657sna6dnsfyx5r72eqcq

DISE

Marc L. Corliss, E. Christopher Lewis, Amir Roth
2003 SIGARCH Computer Architecture News  
Amir Roth is supported by NSF award CCR-0238203.  ... 
doi:10.1145/871656.859660 fatcat:lrs2pmtkufe73lfiphmec656b4

Counting Small Induced Subgraphs Satisfying Monotone Properties [article]

Marc Roth and Johannes Schmitt and Philip Wellnitz
2020 arXiv   pre-print
Given a graph property Φ, the problem #IndSub(Φ) asks, on input a graph G and a positive integer k, to compute the number of induced subgraphs of size k in G that satisfy Φ. The search for explicit criteria on Φ ensuring that #IndSub(Φ) is hard was initiated by Jerrum and Meeks [J. Comput. Syst. Sci. 15] and is part of the major line of research on counting small patterns in graphs. However, apart from an implicit result due to Curticapean, Dell and Marx [STOC 17] proving that a full
more » ... ion into "easy" and "hard" properties is possible and some partial results on edge-monotone properties due to Meeks [Discret. Appl. Math. 16] and Dörfler et al. [MFCS 19], not much is known. In this work, we fully answer and explicitly classify the case of monotone, that is subgraph-closed, properties: We show that for any non-trivial monotone property Φ, the problem #IndSub(Φ) cannot be solved in time f(k)· |V(G)|^o(k/ log^1/2(k)) for any function f, unless the Exponential Time Hypothesis fails. By this, we establish that any significant improvement over the brute-force approach is unlikely; in the language of parameterized complexity, we also obtain a #W[1]-completeness result.
arXiv:2004.06595v1 fatcat:dhkmz5tw3bdipkdvr5645dcho4

Quand le corps envahit la scène : Corps et vieillissement dans Un homme de Philip Roth

Jean-Marc Talpin
2008 Champ psy  
À l'échelle de l'oeuvre, prolixe, de l'écrivain américain Philippe Roth, Un homme peut être lu avec l'hypothèse que Portnoy, le jeune héros de P. Roth jeune, a vieilli.  ...  Roth est né en 1933), d'autant plus qu'il explique dans un entretien qu'il a commencé à écrire ce livre le lendemain de l'enterrement de son ami l'écrivain Saul Bellow.  ...  RÉSUMÉ Le destin du corps dans le vieillissement marqué par une pathologie somatique grave et répétitive est étudié à partir du roman de Philippe Roth « Un homme ».  ... 
doi:10.3917/cpsy.050.0037 fatcat:gxdccuv2dfh45lld4ck3b7oar4

Counting Answers to Existential Questions [article]

Holger Dell, Marc Roth, Philip Wellnitz
2019 arXiv   pre-print
Conjunctive queries select and are expected to return certain tuples from a relational database. We study the potentially easier problem of counting all selected tuples, rather than enumerating them. In particular, we are interested in the problem's parameterized and data complexity, where the query is considered to be small or fixed, and the database is considered to be large. We identify two structural parameters for conjunctive queries that capture their inherent complexity: The dominating
more » ... ar size and the linked matching number. If the dominating star size of a conjunctive query is large, then we show that counting solution tuples to the query is at least as hard as counting dominating sets, which yields a fine-grained complexity lower bound under the Strong Exponential Time Hypothesis as well as a #W[2]-hardness result. Moreover, if the linked matching number of a conjunctive query is large, then we show that the structure of the query is so rich that arbitrary queries up to a certain size can be encoded into it; this essentially establishes #A[2]-completeness. Using ideas stemming from Lov\'asz, we lift complexity results from the class of conjunctive queries to arbitrary existential or universal formulas that might contain inequalities and negations on constraints over the free variables. As a consequence, we obtain a complexity classification that generalizes previous results of Chen, Durand, and Mengel (ToCS 2015; ICDT 2015; PODS 2016) for conjunctive queries and of Curticapean and Marx (FOCS 2014) for the subgraph counting problem. Our proof also relies on graph minors, and we show a strengthening of the Excluded-Grid-Theorem which might be of independent interest: If the linked matching number is large, then not only can we find a large grid somewhere in the graph, but we can find a large grid whose diagonal has disjoint paths leading into an assumed node-well-linked set.
arXiv:1902.04960v2 fatcat:sm53qhw6dzanleeutgyztfxqdu

Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness [article]

Marc Roth, Johannes Schmitt
2018 arXiv   pre-print
We investigate the problem #IndSub(Φ) of counting all induced subgraphs of size k in a graph G that satisfy a given property Φ. This continues the work of Jerrum and Meeks who proved the problem to be #W[1]-hard for some families of properties which include, among others, (dis)connectedness [JCSS 15] and even- or oddness of the number of edges [Combinatorica 17]. Using the recent framework of graph motif parameters due to Curticapean, Dell and Marx [STOC 17], we discover that for monotone
more » ... ties Φ, the problem #IndSub(Φ) is hard for #W[1] if the reduced Euler characteristic of the associated simplicial (graph) complex of Φ is non-zero. This observation links #IndSub(Φ) to Karp's famous Evasiveness Conjecture, as every graph complex with non-vanishing reduced Euler characteristic is known to be evasive. Applying tools from the "topological approach to evasiveness" which was introduced in the seminal paper of Khan, Saks and Sturtevant [FOCS 83], we prove that #IndSub(Φ) is #W[1]-hard for every monotone property Φ that does not hold on the Hamilton cycle as well as for some monotone properties that hold on the Hamilton cycle such as being triangle-free or not k-edge-connected for k > 2. Moreover, we show that for those properties #IndSub(Φ) can not be solved in time f(k)· n^o(k) for any computable function f unless the Exponential Time Hypothesis (ETH) fails. In the final part of the paper, we investigate non-monotone properties and prove that #IndSub(Φ) is #W[1]-hard if Φ is any non-trivial modularity constraint on the number of edges with respect to some prime q or if Φ enforces the presence of a fixed isolated subgraph.
arXiv:1807.01920v1 fatcat:vm4x4zmuo5g5veh5uxn7io3ov4

Fine-grained dichotomies for the Tutte plane and Boolean #CSP [article]

Cornelius Brand, Holger Dell, Marc Roth
2016 arXiv   pre-print
Jaeger, Vertigan, and Welsh [15] proved a dichotomy for the complexity of evaluating the Tutte polynomial at fixed points: The evaluation is #P-hard almost everywhere, and the remaining points admit polynomial-time algorithms. Dell, Husfeldt, and Wahlén [9] and Husfeldt and Taslaman [12], in combination with Curticapean [7], extended the #P-hardness results to tight lower bounds under the counting exponential time hypothesis #ETH, with the exception of the line y=1, which was left open. We
more » ... ete the dichotomy theorem for the Tutte polynomial under #ETH by proving that the number of all acyclic subgraphs of a given n-vertex graph cannot be determined in time exp(o(n)) unless #ETH fails. Another dichotomy theorem we strengthen is the one of Creignou and Hermann [6] for counting the number of satisfying assignments to a constraint satisfaction problem instance over the Boolean domain. We prove that all #P-hard cases are also hard under #ETH. The main ingredient is to prove that the number of independent sets in bipartite graphs with n vertices cannot be computed in time exp(o(n)) unless #ETH fails. In order to prove our results, we use the block interpolation idea by Curticapean [7] and transfer it to systems of linear equations that might not directly correspond to interpolation.
arXiv:1606.06581v1 fatcat:ut6354ay3beuva7mnmg77352bu
« Previous Showing results 1 — 15 out of 11,062 results