On the Complexity of Computing the Order of Repetition of a String

doi 10.1142/9789812792464_0015
Full Text
Abstract

Available in full text

Date
Authors
Publisher

WORLD SCIENTIFIC

Related search

On the Complexity of String Folding

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1996English

On the Complexity of Computing Treebreadth

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

The Order of Complexity of Visuomotor Learning

BMC Neuroscience
NeuroscienceCellularMolecular Neuroscience
2017English

On the Complexity of Computing an Equilibrium in Combinatorial Auctions

2014English

Higher Order String Effects and the Properties of the Pomeron

Physical Review D
AstronomyPhysics
2018English

On Complexity of Complete First-Order Theories

Mathematical Logic Quarterly
Logic
1982English

Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order

ACM SIGPLAN Notices
Computer Science
2015English

Parallel Optimization of String Mode Matching Algorithm Based on Multi-Core Computing

Journal of Software Engineering
Software
2015English

Computing the Polyadic Decomposition of Nonnegative Third Order Tensors

Signal Processing
ControlSystems EngineeringPattern RecognitionElectronic EngineeringComputer VisionElectricalSignal ProcessingSoftware
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy