FRINK Linked Data Fragments server

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

• W1574276522 abstract "A logical operational semantics of full Prolog.- Syntactic theories.- On kleene algebras and closed semirings.- Interactive computations of optimal solutions.- Restricted branching programs and their computational power.- Dynamic hashing strategies.- One-way functions in complexity theory.- Type inference problems: A survey.- Counting the number of solutions.- Implementation of parallel graph reduction by explicit annotation and program transformation.- Interrogative complexity of ?-languages' recognition.- On the power of uniform families of constant depth threshold circuits.- Separating sets of hyperrectangles.- On preemptive scheduling of periodic, real-time tasks on one processor.- Retractions in comparing prolog semantics (extended abstract).- Using inductive counting to simulate nondeterministic computation.- Some properties of zerotesting bounded one-way multicounter machines.- On fast algorithms for two servers.- Decomposition of semi commutations.- Parallel construction of minimal suffix and factor automata.- Affine automata: A technique to generate complex images.- The complexity of symmetric functions in parity normal forms.- Event structures, causal trees, and refinements.- Query languages which express all PTIME queries for trees and unicyclic graphs.- Comparisons among classes of Y-tree systolic automata.- On checking versus evaluation of multiple queries.- Generalized kolmogorov complexity in relativized separations.- A first-order logic for partial recursive functions.- Speed-up theorem without tape compression.- On possibilities of one-way synchronized and alternating automata.- Unrestricted resolution versus N-resolution.- Quality criteria for partial order semantics of place/transition-nets.- Tree-stack automata.- Specification & verification of higher order processes.- The membership problem for context-free chain code picture languages.- Optimal algorithms for dissemination of information in some interconnection networks.- A hierarchy of compositional models of I/O-automata (Extended Abstract).- Minimal nontrivial space complexity of probabilistic one- way turing machines.- On the complexity of genuinely polynomial computation.- Pumping lemmrs for tree languages generated by rewrite systems.- Vector language: Simple description of hard instances.- Separating ?L from L, NL, co-NL and AL (=P) for Oblivious turing machines of linear access time.- The use of graphs of elliptical influence in visual hierarchical clustering.- Characterizing unambiguous augmented pushdown automata by circuits.- Rational ?-transductions.- Splitsort-an adaptive sorting algorithm.- Equational calculi for many-sorted algebras with empty carrier sets.- Semi-commutation and deterministic petri nets.- Internal labellings in lambda-calculus.- A sup-preserving completion of ordered partial algebras.- ATIME(n) is closed under Counting.- Investigation of finitary calculi for the temporal logics by means of infinitary calculi.- Typed horn logic (extended abstract).- Results on the glory of the past.- A stronger version of parikh theorem.- The parallel complexity of some constructions in combinatorial group theory (abstract).- Gentzen type axiomatization for PAL.- Distance automata having large finite distance or finite ambiguity.- Bottom-up-heap sort, a new variant of heap sort beating on average quick sort (if n is not very small).- Symmetric functions in AC 0 can be computed in constant depth with very small size.- The k-section of treewidth restricted graphs.- Computing large polynomial powers very fast in parallel." @default.
• W1574276522 created "2016-06-24" @default.
• W1574276522 creator A5020028001 @default.
• W1574276522 date "1990-09-21" @default.
• W1574276522 modified "2023-09-26" @default.
• W1574276522 title "Mathematical Foundations of Computer Science 1990: Banska Bystrica, Czechoslovakia, August 27-31, 1990 Proceedings" @default.
• W1574276522 hasPublicationYear "1990" @default.
• W1574276522 type Work @default.
• W1574276522 sameAs 1574276522 @default.
• W1574276522 citedByCount "0" @default.
• W1574276522 crossrefType "book" @default.
• W1574276522 hasAuthorship W1574276522A5020028001 @default.
• W1574276522 hasConcept C11413529 @default.
• W1574276522 hasConcept C118615104 @default.
• W1574276522 hasConcept C132525143 @default.
• W1574276522 hasConcept C132569581 @default.
• W1574276522 hasConcept C134026603 @default.
• W1574276522 hasConcept C176181172 @default.
• W1574276522 hasConcept C203776342 @default.
• W1574276522 hasConcept C311688 @default.
• W1574276522 hasConcept C33923547 @default.
• W1574276522 hasConcept C41008148 @default.
• W1574276522 hasConcept C43517604 @default.
• W1574276522 hasConcept C80444323 @default.
• W1574276522 hasConceptScore W1574276522C11413529 @default.
• W1574276522 hasConceptScore W1574276522C118615104 @default.
• W1574276522 hasConceptScore W1574276522C132525143 @default.
• W1574276522 hasConceptScore W1574276522C132569581 @default.
• W1574276522 hasConceptScore W1574276522C134026603 @default.
• W1574276522 hasConceptScore W1574276522C176181172 @default.
• W1574276522 hasConceptScore W1574276522C203776342 @default.
• W1574276522 hasConceptScore W1574276522C311688 @default.
• W1574276522 hasConceptScore W1574276522C33923547 @default.
• W1574276522 hasConceptScore W1574276522C41008148 @default.
• W1574276522 hasConceptScore W1574276522C43517604 @default.
• W1574276522 hasConceptScore W1574276522C80444323 @default.
• W1574276522 hasLocation W15742765221 @default.
• W1574276522 hasOpenAccess W1574276522 @default.
• W1574276522 hasPrimaryLocation W15742765221 @default.
• W1574276522 hasRelatedWork W1484350719 @default.
• W1574276522 hasRelatedWork W1498064541 @default.
• W1574276522 hasRelatedWork W1510598887 @default.
• W1574276522 hasRelatedWork W1514759120 @default.
• W1574276522 hasRelatedWork W1522881798 @default.
• W1574276522 hasRelatedWork W1550568949 @default.
• W1574276522 hasRelatedWork W1552324588 @default.
• W1574276522 hasRelatedWork W1563300162 @default.
• W1574276522 hasRelatedWork W1599600353 @default.
• W1574276522 hasRelatedWork W1600939987 @default.
• W1574276522 hasRelatedWork W1806736452 @default.
• W1574276522 hasRelatedWork W1877933577 @default.
• W1574276522 hasRelatedWork W1904075281 @default.
• W1574276522 hasRelatedWork W420489366 @default.
• W1574276522 hasRelatedWork W564557643 @default.
• W1574276522 hasRelatedWork W567452227 @default.
• W1574276522 hasRelatedWork W573820141 @default.
• W1574276522 hasRelatedWork W604668415 @default.
• W1574276522 hasRelatedWork W620282137 @default.
• W1574276522 hasRelatedWork W628979560 @default.
• W1574276522 isParatext "false" @default.
• W1574276522 isRetracted "false" @default.
• W1574276522 magId "1574276522" @default.
• W1574276522 workType "book" @default.