Filters








161,136 Hits in 7.7 sec

Some modifications of auxiliary pushdown automata

G. Buntrock, F. Drewes, C. Lautemann, T. Mossakowski
1991 RAIRO - Theoretical Informatics and Applications  
ACKNOWLEDGEMENTS We thank Birgit Jenner and Bernd Kirsig for pointing out to us and discussing with us the notions of "begin" and "end" nondeterminism.  ...  The diagram also shows strict inclusions; their strictness will be proved in Section 3. For the sake of clarity, we have left out the tc B"-classes in the figure.  ...  Figure 1 , 1 -Inclusions among several classes. Every edge indicates inclusion of the lower class in the diagram in the upper class.  ... 
doi:10.1051/ita/1991250605451 fatcat:2uueqe4bivc6xenujsak6yjnlq

Page 6945 of Mathematical Reviews Vol. , Issue 95k [page]

1995 Mathematical Reviews  
Upward separation is a technique which allows one to relate certain structural properties of polynomial-time complexity classes to their exponential-time analogues.  ...  Upward separation is also shown to hold for some other counting classes such as @P, co-C=P, SPP and LWPP.  ... 

Finite Satisfiability of the Two-Variable Guarded Fragment with Transitive Guards and Related Variants [article]

Emanuel Kieronski, Lidia Tendera
2018 arXiv   pre-print
We improve the bounds and obtain optimal ones for all the fragments considered, in particular NExpTime for GF2 with equivalence guards, and 2ExpTime for GF2 with transitive guards.  ...  The construction yields a 2NExpTime-upper bound on the complexity of the finite satisfiability problem for these fragments.  ...  constructive criticism and valuable suggestions on earlier versions of this paper.  ... 
arXiv:1611.03267v3 fatcat:ow2qsosg7ncffayeexoe67aopm

Towards an Accurate Mathematical Model of Generic Nominally-Typed OOP [article]

Moez A. AbdelGawad
2016 arXiv   pre-print
e.g., Java wildcard types) and erased generics (e.g., Java type erasure).  ...  This extended abstract presents the concepts of 'nominal intervals' and 'full generication' that are likely to help in building GNOOP as an accurate mathematical model of generic nominally-typed OOP.  ...  F-bounded generics (where type variables of generic classes are used in their own bounds [14]) can then be interpreted using F-coalgebras [20, 29, 35] .  ... 
arXiv:1610.05114v3 fatcat:y2sevsf4c5af5ax7mwzkayltfu

Page 3197 of Mathematical Reviews Vol. , Issue 98E [page]

1998 Mathematical Reviews  
We compare their power and prove that they all coincide for a wide variety of classes.  ...  System Sci. 48 (1994), no. 1, 116-148; MR 95d:68047] to capture the power of a certain “exact” type of counting.  ... 

Page 1266 of Mathematical Reviews Vol. , Issue 99b [page]

1991 Mathematical Reviews  
These classes, and many more, can be de- fined by counting of a special type.  ...  NP and other classes of bounded significance exist.  ... 

Counting of Teams in First-Order Team Logics

Anselm Haak, Juha Kontinen, Fabian Müller, Heribert Vollmer, Fan Yang, Michael Wagner
2019 International Symposium on Mathematical Foundations of Computer Science  
We also study the function class generated by inclusion logic and relate it to the complexity class TotP ⊆ #P.  ...  A corollary of Fagin's characterization of NP by existential second-order logic is that #P can be logically described as the class of functions counting satisfying assignments to free relation variables  ...  Yang 19:3 The situation with inclusion logic and dependence logic is more complex due to their strong closure properties: satisfaction of formulae is closed under union for inclusion logic and is closed  ... 
doi:10.4230/lipics.mfcs.2019.19 dblp:conf/mfcs/HaakKMVY19 fatcat:msle7mcok5cyndnisqgsnzi4ii

Properties of probabilistic pushdown automata

Ioan I. Macarie, Mitsunori Ogihara
1998 Theoretical Computer Science  
Complete characterizations in terms of well-known complexity classes are given for the classes of languages recognized by polynomial time-bounded, logarithmic space-bounded auxiliary pushdown automata  ...  These models are analogous to their counterparts with nondeterministic and alternating states.  ...  Next we study relations among the closures under logspace reductions of these classes.  ... 
doi:10.1016/s0304-3975(98)00059-0 fatcat:wblsfvu4urfxhj4p2vz3pjopiy

Page 2779 of Mathematical Reviews Vol. , Issue 2002D [page]

2002 Mathematical Reviews  
We give an exhaustive answer to the question of which relativizable inclusions between partition classes can occur depending on the relation between their defin- ing posets.  ...  Summary: “This paper addresses the problems of counting proof trees (as introduced by Venkateswaran and Tompa) and counting proof circuits, a related but seemingly more natural question.  ... 

Bounded variable logics: two, three, and more

Martin Otto
1999 Archive for Mathematical Logic  
Consider the bounded variable logics L k 1! (with k variable symbols), and C k 1! (with k variables in the presence of counting quanti ers 9 >m ). These fragments of in nitary logic L 1!  ...  Apart from a uniform and intuitively appealing treatment of these equivalences, this approach relates some interesting issues for the case of an arbitrary number of variables to the case of just three  ...  Ott97a] in particular gives a detailed account that treats bounded variable logics and ordinary xed-point logics in parallel with their richer counting extensions.  ... 
doi:10.1007/s001530050127 fatcat:r4tmmrs3b5hwvb23q5v5pyvram

Fifty Years of the Spectrum Problem: Survey and New Results [article]

Arnaud Durand, Neil Jones, Johann Makowsky, Malika More
2009 arXiv   pre-print
Originally a number theoretic problem, it has been approached in terms of recursion theory, resource bounded complexity theory, classification by complexity of the defining sentences, and finally in terms  ...  One appendix paraphrases the contents of several early and not easily accesible papers by G. Asser, A. Mostowski, J. Bennett and S. Mo.  ...  y, the second of type x) and closed under Boolean operations and (polynomially) bounded quantifications for variables of type x only.  ... 
arXiv:0907.5495v1 fatcat:kc5qtdgiyvfxnkuuprlg26dqvu

Efficient type inclusion tests

Jan Vitek, R. Nigel Horspool, Andreas Krall
1997 Proceedings of the 12th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications - OOPSLA '97  
A type inclusion test determines whether one type is a subtype of another. Efficient type testing techniques exist for single subtyping, but not for languages with multiple subtyping.  ...  Finally, we compare our results with other constant-time type inclusion tests on a suite of 11 large benchmark hierarchies.  ...  of alternative techniques and uses of type inclusion tests; and the OOPSLA reviewers as their technical comments helped us improve this paper.  ... 
doi:10.1145/263698.263730 dblp:conf/oopsla/VitekHK97 fatcat:7q3f47iiercmngj4boaqglo6ma

Efficient type inclusion tests

Jan Vitek, R. Nigel Horspool, Andreas Krall
1997 SIGPLAN notices  
A type inclusion test determines whether one type is a subtype of another. Efficient type testing techniques exist for single subtyping, but not for languages with multiple subtyping.  ...  Finally, we compare our results with other constant-time type inclusion tests on a suite of 11 large benchmark hierarchies.  ...  of alternative techniques and uses of type inclusion tests; and the OOPSLA reviewers as their technical comments helped us improve this paper.  ... 
doi:10.1145/263700.263730 fatcat:dbivimmkbvet3i2oe77lcyorfi

Fifty years of the spectrum problem: survey and new results

Arnaud Durand, Neil D. Jones, Johann A. Makowsky, Malika More
2012 Bulletin of Symbolic Logic  
Originally a number theoretic problem, it has been approached by means of recursion theory, resource bounded complexity theory, classification by complexity of the defining sentences, and finally by means  ...  These innocent questions turned out to be seminal for the development of finite model theory and descriptive complexity.  ...  Immerman and S. Shelah for their fruitful comments which helped our preparation of this survey.  ... 
doi:10.2178/bsl.1804020 fatcat:mglcz7bnpbalrnqlixpzkzo6je

Database Perspectives on Blockchains [article]

Sara Cohen, Aviv Zohar
2018 arXiv   pre-print
, and integrity constraints and (2) the complexity of generating transactions that are mutually (in)consistent with given subsets of pending transactions.  ...  Solving these problems is critical to ensure that users can issue transactions consistent with their intentions. Finally, we chart important directions for future work.  ...  Let φ 1 ∧ · · · ∧ φ n be a 3-SAT formula, where φ i is a disjunction of variables or their negation from x 1 , . . . , x k .  ... 
arXiv:1803.06015v1 fatcat:xwkgdbh7ybfghd64ouw3boug7u
« Previous Showing results 1 — 15 out of 161,136 results