Log in

Relevant bibliographies by topics / Immermanns / Journal articles

To see the other types of publications on this topic, follow the link: Immermanns.

Journal articles on the topic 'Immermanns'

Author: Grafiati

Published: 4 June 2021

Last updated: 15 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 47 journal articles for your research on the topic 'Immermanns.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Cho, Kyuhee. "Zum Spannungsverhältnis von poetischem Ideal und sozialer Wirklichkeit - K. L. Immermanns Die Epigonen als Bildungsroman." Deutsche Sprach- und Literaturwissenschaft 28, no. 4 (December 31, 2020): 85–114. http://dx.doi.org/10.24830/kgd.28.4.5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Scheuermann, Barbara. "Immermanns „Münchhausen“ als Subtext von Raabes „Stopfkuchen“? Zu einem Konstrukt und seinem Weiterleben in der Raabe-Philologie." Jahrbuch der Raabe-Gesellschaft 53, no. 1 (September 2012): 27–50. http://dx.doi.org/10.1515/raabe-2012-0004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Minden, Michael. "Problems of Realism in Immermann's Die Epigonen." Oxford German Studies 16, no. 1 (January 1, 1985): 66–80. http://dx.doi.org/10.1179/007871985793323387.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Sammons, Jeffrey L., and Peter Hasubek. ""Widerspruch, du Herr der Welt!": Neue Studien zu Karl Immermann." German Quarterly 65, no. 1 (1992): 77. http://dx.doi.org/10.2307/406821.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Flum, Jörg, and Martin Grohe. "On fixed-point logic with counting." Journal of Symbolic Logic 65, no. 2 (June 2000): 777–87. http://dx.doi.org/10.2307/2586569.

Full text

Abstract:

One of the fundamental results of descriptive complexity theory, due to Immerman [13] and Vardi [18], says that a class of ordered finite structures is definable in fixed-point logic if, and only if, it is computable in polynomial time. Much effort has been spent on the problem of capturing polynomial time, that is, describing all polynomial time computable classes of not necessarily ordered finite structures by a logic in a similar way.The most obvious shortcoming of fixed-point logic itself on unordered structures is that it cannot count. Immerman [14] responded to this by adding counting constructs to fixed-point logic. Although it has been proved by Cai, Fürer, and Immerman [1] that the resulting fixed-point logic with counting, denoted by IFP+C, still does not capture all of polynomial time, it does capture polynomial time on several important classes of structures (on trees, planar graphs, structures of bounded tree-width [15, 9, 10]).The main motivation for such capturing results is that they may give a better understanding of polynomial time. But of course this requires that the logical side is well understood. We hope that our analysis of IFP+C-formulas will help to clarify the expressive power of IFP+C; in particular, we derive a normal form. Moreover, we obtain a problem complete for IFP+C under first-order reductions.

APA, Harvard, Vancouver, ISO, and other styles

6

Wehner, Ralf. ""... das sei nun alles für das Düsseldorfer Theater und dessen Heil..."." Die Musikforschung 55, no. 2 (September 22, 2021): 145–61. http://dx.doi.org/10.52412/mf.2002.h2.753.

Full text

Abstract:

In der Freemantle Collection der Brotherton Library, University of Leeds, befindet sich ein fünfseitiges Autograph von Felix Mendelssohn-Bartholdy, das bisher nicht identifiziert war. Dieses unbekannte Orchesterwerk des Komponisten ist eine kleine Bühnenmusik zu dem Vorspiel "Kurfürst Johann Wilhelm im Theater" von Karl Immermann, mit dem das Stadttheater Düsseldorf am 28. Oktober 1834 eröffnet wurde. Im ersten Teil werden einige Takte aus Mozarts "Don Giovanni" adaptiert, der zweite Teil bildete die Begleitmusik zu einem von Theodor Hildebrandt nach dem Kupferstich von Giovanni Volpato "Der Parnass von Raphael" entworfenen "lebenden Bild", das Schauspieler in Szene setzten.

APA, Harvard, Vancouver, ISO, and other styles

7

T Hella, Lauri, and Miikka S Vilander. "Formula size games for modal logic and μ-calculus." Journal of Logic and Computation 29, no. 8 (December 2019): 1311–44. http://dx.doi.org/10.1093/logcom/exz025.

Full text

Abstract:

Abstract We propose a new version of formula size game for modal logic. The game characterizes the equivalence of pointed Kripke models up to formulas of given numbers of modal operators and binary connectives. Our game is similar to the well-known Adler–Immerman game. However, due to a crucial difference in the definition of positions of the game, its winning condition is simpler, and the second player does not have a trivial optimal strategy. Thus, unlike the Adler–Immerman game, our game is a genuine two-person game. We illustrate the use of the game by proving a non-elementary succinctness gap between bisimulation invariant first-order logic $\textrm{FO}$ and (basic) modal logic $\textrm{ML}$. We also present a version of the game for the modal $\mu $-calculus $\textrm{L}_\mu $ and show that $\textrm{FO}$ is also non-elementarily more succinct than $\textrm{L}_\mu $.

APA, Harvard, Vancouver, ISO, and other styles

8

Klonowski, W. "Book review: Descriptive complexity, by Neil Immerman." Discrete Dynamics in Nature and Society 6, no. 1 (2001): 57–60. http://dx.doi.org/10.1155/s1026022601000061.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Kapoutsis, Christos A., and Lamana Mulaffer. "A Logical Characterization of Small 2NFAs." International Journal of Foundations of Computer Science 28, no. 05 (August 2017): 445–64. http://dx.doi.org/10.1142/s0129054117400019.

Full text

Abstract:

Let 2N be the class of families of problems solvable by families of two-way nondeterministic finite automata of polynomial size. We characterize 2N in terms of families of formulas of transitive-closure logic. These formulas apply the transitive-closure operator on a quantifier-free disjunctive normal form of first-order logic with successor and constants, where (i) apart from two special variables, all others are equated to constants in every clause, and (ii) no clause simultaneously relates these two special variables and refers to fixed input cells. We prove that automata with polynomially many states are as powerful as formulas with polynomially many clauses and polynomially large constants. This can be seen as a refinement of Immerman’s theorem that nondeterministic logarithmic space matches positive transitive-closure logic ([Formula: see text]).

APA, Harvard, Vancouver, ISO, and other styles

10

Cho, Kyu-Hee. ""Transitional literature as "something halved and double" - K. L. Immermann’s Die Epigonen as Zeitroman"." Hesse-Forschung 44 (December 30, 2020): 59–95. http://dx.doi.org/10.31133/hf.2020.12.44.59.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Seese, Detlef. "Linear time computable problems and first-order descriptions." Mathematical Structures in Computer Science 6, no. 6 (December 1996): 505–26. http://dx.doi.org/10.1017/s0960129500070079.

Full text

Abstract:

It is well known that every algorithmic problem definable by a formula of first-order logic can be solved in polynomial time, since all these problems are inL(see Aho and Ullman (1979) and Immerman (1987)). Using an old technique of Hanf (Hanf 1965) and other techniques developed to prove the decidability of formal theories in mathematical logic, it is shown that an arbitraryFO-problem over relational structures of bounded degree can be solved in linear time.

APA, Harvard, Vancouver, ISO, and other styles

12

Pakusa, Wied, Svenja Schalthöfer, and Erkal Selman. "Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time." ACM Transactions on Computational Logic 19, no. 2 (June 28, 2018): 1–27. http://dx.doi.org/10.1145/3154456.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Dawar, Anuj, David Richerby, and Benjamin Rossman. "Choiceless polynomial time, counting and the Cai–Fürer–Immerman graphs." Annals of Pure and Applied Logic 152, no. 1-3 (March 2008): 31–50. http://dx.doi.org/10.1016/j.apal.2007.11.011.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Dawar, Anuj, David Richerby, and Benjamin Rossman. "Choiceless Polynomial Time, Counting and the Cai–Fürer–Immerman Graphs." Electronic Notes in Theoretical Computer Science 143 (January 2006): 13–26. http://dx.doi.org/10.1016/j.entcs.2005.05.024.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Borges, Nerio, and Edwin Pin. "Universal first-order logic is superfluous in the second level of the polynomial-time hierarchy." Logic Journal of the IGPL 27, no. 6 (May 1, 2019): 895–909. http://dx.doi.org/10.1093/jigpal/jzz009.

Full text

Abstract:

Abstract In this paper we prove that $\forall \textrm{FO}$, the universal fragment of first-order logic, is superfluous in $\varSigma _2^p$ and $\varPi _2^p$. As an example, we show that this yields a syntactic proof of the $\varSigma _2^p$-completeness of value-cost satisfiability. The superfluity method is interesting since it gives a way to prove completeness of problems involving numerical data such as lengths, weights and costs and it also adds to the programme started by Immerman and Medina about the syntactic approach in the study of completeness.

APA, Harvard, Vancouver, ISO, and other styles

16

CHARALAMBIDIS, ANGELOS, CHRISTOS NOMIKOS, and PANOS RONDOGIANNIS. "The Expressive Power of Higher-Order Datalog." Theory and Practice of Logic Programming 19, no. 5-6 (September 2019): 925–40. http://dx.doi.org/10.1017/s1471068419000279.

Full text

Abstract:

AbstractA classical result in descriptive complexity theory states that Datalog expresses exactly the class of polynomially computable queries on ordered databases (Papadimitriou 1985; Grädel 1992; Vardi 1982; Immerman 1986; Leivant 1989). In this paper we extend this result to the case of higher-order Datalog. In particular, we demonstrate that on ordered databases, for all k ≥ 2, k-order Datalog captures (k − 1)-EXPTIME. This result suggests that higher-order extensions of Datalog possess superior expressive power and they are worthwhile of further investigation both in theory and in practice.

APA, Harvard, Vancouver, ISO, and other styles

17

Reinhardt, Hartmut. "Peter Hasubek, Carl Leberecht Immermann. Eine Biographie. Lang, Frankfurt/M. u. a. 2017. 689 S., € 99,95." Arbitrium 37, no. 3 (December 6, 2019): 375–82. http://dx.doi.org/10.1515/arb-2019-0028.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Bowen, Bleddyn E. "Richard H. Immerman,The Hidden Hand: A Brief History of the CIA." Intelligence and National Security 31, no. 2 (February 6, 2015): 297–301. http://dx.doi.org/10.1080/02684527.2015.1008207.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Geffert, Viliam. "Tally Versions of the Savitch and Immerman–Szelepcsényi Theorems for Sublogarithmic Space." SIAM Journal on Computing 22, no. 1 (February 1993): 102–13. http://dx.doi.org/10.1137/0222009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Mistry, Kaeten. "Richard H. Immerman and Petra Goedde, eds, The Oxford Handbook of the Cold War." European History Quarterly 47, no. 3 (July 2017): 552–53. http://dx.doi.org/10.1177/0265691417711663s.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Buss, Samuel. "Neil Immerman. Upper and lower bounds for first order expressibility. Journal of computer and system sciences, vol. 25 (1982), pp. 76–98. - Neil Immerman. Relational queries computable in polynomial time. Information and control, vol. 68 (1986), pp. 86–104. - Neil Immerman. Languages that capture complexity classes. SIAM journal on computing, vol. 16 (1987), pp. 760–778." Journal of Symbolic Logic 54, no. 1 (March 1989): 287–88. http://dx.doi.org/10.2307/2275034.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Blass, Andreas, Yuri Gurevich, and Saharon Shelah. "On polynomial time computation over unordered structures." Journal of Symbolic Logic 67, no. 3 (September 2002): 1093–125. http://dx.doi.org/10.2178/jsl/1190150152.

Full text

Abstract:

AbstractThis paper is motivated by the question whether there exists a logic capturing polynomial time computation over unordered structures. We consider several algorithmic problems near the border of the known, logically defined complexity classes contained in polynomial time. We show that fixpoint logic plus counting is stronger than might be expected, in that it can express the existence of a complete matching in a bipartite graph. We revisit the known examples that separate polynomial time from fixpoint plus counting. We show that the examples in a paper of Cai, Fürer, and Immerman, when suitably padded, are in choiceless polynomial time yet not in fixpoint plus counting. Without padding, they remain in polynomial time but appear not to be in choiceless polynomial time plus counting. Similar results hold for the multipede examples of Gurevich and Shelah, except that their final version of multipedes is, in a sense, already suitably padded. Finally, we describe another possible candidate, involving determinants, for the task of separating polynomial time from choiceless polynomial time plus counting.

APA, Harvard, Vancouver, ISO, and other styles

23

Bose, Meena. "Waging Peace: How Eisenhower Shaped an Enduring Cold War Strategyby Robert R. Bowie and Richard H. Immerman." Political Science Quarterly 114, no. 1 (March 1999): 163–64. http://dx.doi.org/10.2307/2658016.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

MENDELSOHN, BARAK. "Empire for Liberty: A History of American Imperialism from Benjamin Franklin to Paul Wolfowitzby Richard H. Immerman." Political Science Quarterly 126, no. 3 (September 2011): 504–5. http://dx.doi.org/10.1002/j.1538-165x.2011.tb02160.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Lindell, Steven. "Neil Immerman. Descriptive complexity. Graduate texts in computer science. Springer, New York, Berlin, and Heidelberg, 1999, xvi + 268 pp." Bulletin of Symbolic Logic 7, no. 4 (December 2001): 525–27. http://dx.doi.org/10.2307/2687799.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Thomas, Simon. "Theories with finitely many models." Journal of Symbolic Logic 51, no. 2 (June 1986): 374–76. http://dx.doi.org/10.1017/s0022481200031236.

Full text

Abstract:

If L is a first order language and n is a natural number, then Ln is the set of formulas which only make use of the variables x1,…,xn. While every finite structure is determined up to isomorphism by its theory in L, the same is no longer true in Ln. This simple observation is the source of a number of intriguing questions. For example, Poizat [2] has asked whether a complete theory in Ln which has at least two nonisomorphic finite models must necessarily also have an infinite one. The purpose of this paper is to present some counterexamples to this conjecture.Theorem. For each n ≤ 3 there are complete theories in L2n−2andL2n−1having exactly n + 1 models.In our notation and definitions, we follow Poizat [2]. To test structures for elementary equivalence in Ln, we shall use the modified Ehrenfeucht-Fraïssé games of Immerman [1]. For convenience, we repeat his definition here.Suppose that L is a purely relational language, each of the relations having arity at most n. Let and ℬ be two structures for L. Define the Ln game on and ℬ as follows. There are two players, I and II, and there are n pairs of counters a1, b1, …, an, bn. On each move, player I picks up any of the counters and places it on an element of the appropriate structure.

APA, Harvard, Vancouver, ISO, and other styles

27

Gardner, Paul F. "Richard H. Immerman, John Foster Dulles: Piety, Pragmatism, and Power in U.S. Foreign Policy. Wilmington, DE: Scholarly Resources, 1999. 221 pp. $19.95." Journal of Cold War Studies 4, no. 3 (July 2002): 123–25. http://dx.doi.org/10.1162/jcws.2002.4.3.123.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Grohe, Martin. "Finite Variable Logics in Descriptive Complexity Theory." Bulletin of Symbolic Logic 4, no. 4 (December 1998): 345–98. http://dx.doi.org/10.2307/420954.

Full text

Abstract:

Throughout the development of finite model theory, the fragments of first-order logic with only finitely many variables have played a central role. This survey gives an introduction to the theory of finite variable logics and reports on recent progress in the area.For each k ≥ 1 we let Lk be the fragment of first-order logic consisting of all formulas with at most k (free or bound) variables. The logics Lk are the simplest finite-variable logics. Later, we are going to consider infinitary variants and extensions by so-called counting quantifiers.Finite variable logics have mostly been studied on finite structures. Like the whole area of finite model theory, they have interesting model theoretic, complexity theoretic, and combinatorial aspects. For finite structures, first-order logic is often too expressive, since each finite structure can be characterized up to isomorphism by a single first-order sentence, and each class of finite structures that is closed under isomorphism can be characterized by a first-order theory. The finite variable fragments seem to be promising candidates with the right balance between expressive power and weakness for a model theory of finite structures. This may have motivated Poizat [67] to collect some basic model theoretic properties of the Lk. Around the same time Immerman [45] showed that important complexity classes such as polynomial time (PTIME) or polynomial space (PSPACE) can be characterized as collections of all classes of (ordered) finite structures definable by uniform sequences of first-order formulas with a fixed number of variables and varying quantifier-depth.

APA, Harvard, Vancouver, ISO, and other styles

29

Perron, Jean-Roch. "PURCELL, Susan Kaufman, IMMERMAN, Robert M. (Ed.). Japan and Latin America in the New Global Order. Boulder (Col), Lynne Rienner Publishers, 1992, 175 p." Études internationales 24, no. 2 (1993): 478. http://dx.doi.org/10.7202/703202ar.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Grohe, Martin. "Complete problems for fixed-point logics." Journal of Symbolic Logic 60, no. 2 (June 1995): 517–27. http://dx.doi.org/10.2307/2275847.

Full text

Abstract:

The notion of logical reducibilities is derived from the idea of interpretations between theories. It was used by Lovász and Gács [LG77] and Immerman [Imm87] to give complete problems for certain complexity classes and hence establish new connections between logical definability and computational complexity.However, the notion is also interesting in a purely logical context. For example, it is helpful to establish nonexpressibility results.We say that a class of τ-structures is a >complete problem for a logic under L-reductions if it is definable in [τ] and if every class definable in can be ”translated” into by L-formulae (cf. §4).We prove the following theorem:1.1. Theorem. There are complete problemsfor partial fixed-point logic andfor inductive fixed-point logic under quantifier-free reductions.The main step of the proof is to establish a new normal form for fixed-point formulae (which might be of some interest itself). To obtain this normal form we use theorems of Abiteboul and Vianu [AV91a] that show the equivalence between the fixed-point logics we consider and certain extensions of the database query language Datalog.In [Dah87] Dahlhaus gave a complete problem for least fixed-point logic. Since least fixed-point logic equals inductive fixed-point logic by a well-known result of Gurevich and Shelah [GS86], this already proves one part of our theorem.However, our class gives a natural description of the fixed-point process of an inductive fixed-point formula and hence sheds some light on completely different aspects of the logic than Dahlhaus's construction, which is strongly based on the features of least fixed-point formulae.

APA, Harvard, Vancouver, ISO, and other styles

31

Lak, Martijn. "BoekbesprekingRichard H. Immerman en Petra Goedde ed., The Oxford handbook of the Cold War (Oxford University Press; Oxford 2013) 704 p., krt., €135,- ISBN 9780199236961." Tijdschrift voor geschiedenis 127, no. 1 (April 1, 2014): 174–75. http://dx.doi.org/10.5117/tvgesch2014.1.lak.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Ninkovich, Frank. "Empire for Liberty: A History of American Imperialism from Benjamin Franklin to Paul Wolfowitz. By Richard H. Immerman. (Princeton, N.J.: Princeton University Press, 2010. Pp. ix, 257. $24.95.)." Historian 73, no. 4 (December 1, 2011): 825–26. http://dx.doi.org/10.1111/j.1540-6563.2011.00308_21.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Jacobs, Matthew F. "Beth Bailey and Richard H. Immerman , eds. Understanding the U.S. Wars in Iraq and Afghanistan. New York: New York University Press, 2015. 368 pages. Paper US$30.00 ISBN 9781479826902." Review of Middle East Studies 50, no. 2 (August 2016): 200–202. http://dx.doi.org/10.1017/rms.2016.152.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

McIntosh, Daniel. "Waging Peace: How Eisenhower Shaped an Enduring Cold War Strategy. Robert R. Bowie , Richard H. ImmermanJ. William Fulbright, Vietnam, and the Search for a Cold War Foreign Policy. Randall Bennett Woods." Journal of Politics 63, no. 2 (May 2001): 696–99. http://dx.doi.org/10.1086/jop.63.2.2691801.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

MORGAN, IWAN. "Robert R. Bowie and Richard H. Immerman, Waging Peace: How Eisenhower Shaped an Enduring Cold War Strategy (New York: Oxford University Press, 1998, £40). Pp. 317. ISBN 0 19 5062647." Journal of American Studies 34, no. 3 (December 2000): 509–51. http://dx.doi.org/10.1017/s0021875851246485.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Johns, Andrew L. "Empire for Liberty: A History of American Imperialism from Benjamin Franklin to Paul Wolfowitz, by Richard H. Immerman.Empire for Liberty: A History of American Imperialism from Benjamin Franklin to Paul Wolfowitz, by Richard H. Immerman. Princeton, New Jersey, Princeton University Press, 2010. xi, 271 pp. $24.95 US (cloth)." Canadian Journal of History 46, no. 2 (September 2011): 409–11. http://dx.doi.org/10.3138/cjh.46.2.409.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Schmitz-Emans, Monika. "Tilman Spreckelsen, Das Herz als Kompaß. Androiden im Werk Karl Immermanns." Arbitrium 18, no. 2 (2000). http://dx.doi.org/10.1515/arbi.2000.18.2.211.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Harms, Wolfgang. "Matthias Kamann, Epigonalität als ästhetisches Vermögen. Untersuchungen zu Texten Grabbes und Immermanns, Platens und Raabes, zur Literaturkritik des 19. Jahrhunderts und zum Werk Adalbert Stifters." Arbitrium 13, no. 2 (1995). http://dx.doi.org/10.1515/arbi.1995.13.2.234.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Roth, Udo. "Markus Fauser, Intertextualität als Poetik des Epigonalen. Immermann-Studien. 1999." Arbitrium 26, no. 3 (January 2008). http://dx.doi.org/10.1515/arbi.2008.107.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Neumann, Michael. "Karl Leberecht Immermann, Briefe. Textkritische und kommentierte Ausgabe in drei Bänden." Arbitrium 7, no. 3 (1989). http://dx.doi.org/10.1515/arbi.1989.7.3.336.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Fulda, Daniel. "Dorothee Kimmich, Wirklichkeit als Konstruktion. Studien zu Geschichte und Geschichtlichkeit bei Heine, Büchner, Immermann, Stendhal, Keller und Flaubert. 2002." Arbitrium 20, no. 3 (January 12, 2003). http://dx.doi.org/10.1515/arbi.2002.349.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

"Beth Bailey and Richard H. Immerman, editors.Understanding the U.S. Wars in Iraq and Afghanistan." American Historical Review 121, no. 2 (April 2016): 697.1–697. http://dx.doi.org/10.1093/ahr/121.2.697.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Fauser, Markus. "Burkhard Meyer-Sickendiek, Die Ästhetik der Epigonalität. Theorie und Praxis wiederholenden Schreibens im 19. Jahrhundert: Immermann – Keller – Stifter – Nietzsche. 2001." Arbitrium 19, no. 2 (January 2001). http://dx.doi.org/10.1515/arbi.2001.208.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Evdokimov, Sergei, and Ilia Ponomarenko. "On Highly Closed Cellular Algebras and Highly Closed Isomorphisms." Electronic Journal of Combinatorics 6, no. 1 (November 6, 1998). http://dx.doi.org/10.37236/1450.

Full text

Abstract:

We define and study $m$-closed cellular algebras (coherent configurations) and $m$-isomorphisms of cellular algebras which can be regarded as $m$th approximations of Schurian algebras (i.e. the centralizer algebras of permutation groups) and of strong isomorphisms (i.e. bijections of the point sets taking one algebra to the other) respectively. If $m=1$ we come to arbitrary cellular algebras and their weak isomorphisms (i.e. matrix algebra isomorphisms preserving the Hadamard multiplication). On the other hand, the algebras which are $m$-closed for all $m\ge 1$ are exactly Schurian ones whereas the weak isomorphisms which are $m$-isomorphisms for all $m\ge 1$ are exactly ones induced by strong isomorphisms. We show that for any $m$ there exist $m$-closed algebras on $O(m)$ points which are not Schurian and $m$-isomorphisms of cellular algebras on $O(m)$ points which are not induced by strong isomorphisms. This enables us to find for any $m$ an edge colored graph with $O(m)$ vertices satisfying the $m$-vertex condition and having non-Schurian adjacency algebra. On the other hand, we rediscover and explain from the algebraic point of view the Cai-Fürer-Immerman phenomenon that the $m$-dimensional Weisfeiler-Lehman method fails to recognize the isomorphism of graphs in an efficient way.

APA, Harvard, Vancouver, ISO, and other styles

45

Reschke, Renate. "Burkhard Meyer-Sickendiek: Die Ästhetik der Epigonalität. Theorie und Praxis wiederholenden Schreibens im 19. Jahrhundert: Immermann - Keller - Stifter - Nietzsche. A. Francke Verlag, Tübingen und Basel 2001, 352, 86,- DM." Nietzscheforschung 9, JG (January 2002). http://dx.doi.org/10.1524/nifo.2002.9.jg.393.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Dülffer, Jost. "Oxford Handbook, The Oxford Handbook of the Cold War. Ed. by Richard H. Immerman and Petra Goedde. Oxford, Oxford University Press 2013." Historische Zeitschrift 298, no. 3 (January 20, 2014). http://dx.doi.org/10.1515/hzhz-2014-0309.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

"john p. burke and fred i. greenstein. How Presidents Test Reality: Decisions on Vietnam, 1954 and 1965. Assisted by larry berman and richard immerman. New York: Russell Sage Foundation. 1989. Pp. vii, 331. $29.95." American Historical Review, February 1991. http://dx.doi.org/10.1086/ahr/96.1.291.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!