Search Results - Complexity of computation (including implicit computational complexity)

Computational Complexity of Theories of a Binary Predicate with a Small Number of Variables: Computational complexity of theories of a binary predicate with a small number of variables

Authors: Rybakov, M.

Source: Doklady Mathematics. 106:458-461

Subject Terms: Complexity of computation (including implicit computational complexity), Church's theorem, Trakhtenbrot's theorem, undecidability, 0102 computer and information sciences, 0101 mathematics, dyadic logic, 01 natural sciences, first-order logic

File Description: application/xml

Computational Complexity of the Word Problem in Modal and Heyting Algebras with a Small Number of Generators: Computational complexity of the word problem in modal and Heyting algebras with a small number of generators

Authors: Rybakov, M.

Source: Russian Mathematics. 66:33-48

Subject Terms: word problem, Complexity of computation (including implicit computational complexity), finitely generated algebra, pseudo-Boolean algebra, Heyting algebra, 0102 computer and information sciences, 01 natural sciences, Other algebras related to logic, modal algebra, Descriptive complexity and finite models, Heyting algebras (lattice-theoretic aspects), Generalizations of Boolean algebras, 0101 mathematics, Modal logic (including the logic of norms)

File Description: application/xml

Access URL: https://zbmath.org/7644547
https://doi.org/10.3103/s1066369x22050061

Physical Computational Complexity and First-order Logic: Physical computational complexity and first-order logic

Authors: Richard Whyman

Source: Fundamenta Informaticae. 181:129-161

Subject Terms: Complexity of computation (including implicit computational complexity), computable analysis, Blum-Shub-Smale machines, 0102 computer and information sciences, 01 natural sciences, hypercomputation, Church-Turing thesis, Turing machines and related notions, Quantum computation, Complexity classes (hierarchies, relations among complexity classes, etc.), physical computation, atemporal computation, Computation over the reals, computable analysis, non-causal computation

File Description: application/xml

Access URL: https://dblp.uni-trier.de/db/journals/fuin/fuin181.html#Whyman21
https://content.iospress.com/articles/fundamenta-informaticae/fi2054

The Complexity of Decomposability of Computable Rings: The complexity of decomposability of computable rings

Authors: Wu, Huishan

Source: Notre Dame Journal of Formal Logic. 64

Subject Terms: Complexity of computation (including implicit computational complexity), block decomposable rings, decomposable rings, computable rings, Computable structure theory, computable model theory, Theory of numerations, effectively presented structures

File Description: application/xml

Access URL: https://zbmath.org/7690431
https://doi.org/10.1215/00294527-2023-0003

Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time: Implicit complexity over an arbitrary structure: sequential and parallel polynomial time

Authors: Bournez, Olivier Cucker, Felipe Jacobé de Naurois, Paulin et al.

Contributors: Bournez, Olivier Cucker, Felipe Jacobé de Naurois, Paulin et al.

Source: Journal of Logic and Computation. 15:41-58

Subject Terms: function algebras, implicit complexity, Complexity of computation (including implicit computational complexity), complexity theory, 0102 computer and information sciences, Models of computation (Turing machines, etc.), 01 natural sciences, Recursive functions and relations, subrecursive hierarchies, Shub, Smale model, Complexity classes (hierarchies, relations among complexity classes, etc.), [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Blum, 0101 mathematics, Abstract and axiomatic computability and recursion theory, Blum-Shub-Smale model

File Description: application/xml

Access URL: https://inria.hal.science/inria-00102942v1
https://hal.inria.fr/inria-00102942
https://dblp.uni-trier.de/db/journals/logcom/logcom15.html#BournezCNM05
https://academic.oup.com/logcom/article/15/1/41/950725

Theories with self-application and computational complexity: Theories with self-application and computational complexity.

Authors: Thomas Strahm

Source: Information and Computation. 185:263-297

Subject Terms: Bounded applicative theories, Complexity of computation (including implicit computational complexity), First-order arithmetic and fragments, computational complexity, Metamathematics of constructive systems, bounded arithmetic, 0102 computer and information sciences, 01 natural sciences, explicit mathematics, Theoretical Computer Science, Computer Science Applications, bounded induction, Explicit mathematics, Feasible functionals, Computational Theory and Mathematics, Bounded arithmetic, feasible functionals, Complexity classes (hierarchies, relations among complexity classes, etc.), 0101 mathematics, bounded applicative theories, Information Systems

File Description: application/xml

Access URL: https://zbmath.org/2056068
https://doi.org/10.1016/s0890-5401(03)00086-5
https://www.iam.unibe.ch/~strahm/download/pdf/comp.pdf
https://doi.org/10.1016/S0890-5401(03)00086-5
https://www.sciencedirect.com/science/article/abs/pii/S0890540103000865
http://home.inf.unibe.ch/~strahm/download/pdf/comp.pdf
https://www.sciencedirect.com/science/article/pii/S0890540103000865

Computational Complexity in Algebraic Systems: Computational complexity in algebraic systems

Authors: A. N. Rybalov

Source: Siberian Mathematical Journal. 45:1113-1123

Subject Terms: generalized computability, Complexity of computation (including implicit computational complexity), BSS-machines, complexity of computations, Complexity classes (hierarchies, relations among complexity classes, etc.), Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), 0102 computer and information sciences, 0101 mathematics, Abstract and axiomatic computability and recursion theory, 01 natural sciences

File Description: application/xml

Access URL: https://zbmath.org/5041649
https://link.springer.com/article/10.1023%2FB%3ASIMJ.0000048927.31169.8d
https://link.springer.com/content/pdf/10.1023/B:SIMJ.0000048927.31169.8d.pdf

The computational complexity of distance functions of two-dimensional domains

Authors: Ker-I Ko Arthur W. Chou

Source: Theoretical Computer Science. 337:360-369

Subject Terms: Complexity of computation (including implicit computational complexity), computational complexity, polynomial-time computability, Polynomial-time computability, distance function, 0102 computer and information sciences, Models of computation (Turing machines, etc.), 01 natural sciences, Distance function, NP, Theoretical Computer Science, Computational complexity, Two-dimensional domain, Complexity classes (hierarchies, relations among complexity classes, etc.), 0101 mathematics, P and NP, Constructive and recursive analysis, Computer Science(all)

File Description: application/xml

Access URL: https://zbmath.org/2184062
https://doi.org/10.1016/j.tcs.2004.11.016

On the computational complexity of Longley's H functional: On the computational complexity of Longley's \(H\) functional

Authors: James S. Royer

Source: Theoretical Computer Science. 318:225-241

Subject Terms: Realizability, Complexity of computation (including implicit computational complexity), Sequential computability, NP-hardness, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), 0102 computer and information sciences, 0101 mathematics, 01 natural sciences, Higher-type computational complexity, Theoretical Computer Science, Computer Science(all)

File Description: application/xml

Access URL: https://zbmath.org/2083411
https://doi.org/10.1016/j.tcs.2003.10.024
https://www.sciencedirect.com/science/article/pii/S0304397503005292
https://core.ac.uk/display/82525560
http://www.cis.syr.edu/~royer/archive/lh-a4.pdf
https://experts.syr.edu/en/publications/on-the-computational-complexity-of-longleys-h-functional
https://dblp.uni-trier.de/db/journals/tcs/tcs318.html#Royer04
https://doi.org/10.1016/j.tcs.2003.10.024

On the computational complexity of imperative programming languages

Authors: Karl-Heinz Niggl Lars Kristiansen

Source: Theoretical Computer Science. 318:139-161

Subject Terms: Complexity of computation (including implicit computational complexity), Implicit computational complexity, Theory of programming languages, Polynomial-time computability, 0102 computer and information sciences, 01 natural sciences, Recursive functions and relations, subrecursive hierarchies, Theoretical Computer Science, Imperative programming languages, Turing machines and related notions, Complexity classes (hierarchies, relations among complexity classes, etc.), 0101 mathematics, Grzegorczyk hierarchy, Subrecursion theory, Computer Science(all)

File Description: application/xml

Access URL: https://zbmath.org/2083407
https://doi.org/10.1016/j.tcs.2003.10.016

Computational complexity on computable metric spaces

Authors: Klaus Weirauch

Source: Mathematical Logic Quarterly. 49:3-21

Subject Terms: Complexity of computation (including implicit computational complexity), computational complexity, Applications of computability and recursion theory, Metric spaces, metrizability, 0102 computer and information sciences, 0101 mathematics, 01 natural sciences, Theory of numerations, effectively presented structures, computable metric spaces, Constructive and recursive analysis

File Description: application/xml

Access URL: http://eccc.hpi-web.de/report/2002/014/download/
https://onlinelibrary.wiley.com/doi/abs/10.1002/malq.200310001
https://dblp.uni-trier.de/db/journals/mlq/mlq49.html#Weihrauch03

Uniform computational complexity of the derivatives of C∞-functions: Uniform computational complexity of the derivatives of \(C^{\infty}\)-functions.

Authors: Markus Bläser

Source: Theoretical Computer Science. 284:199-206

Subject Terms: Computational complexity, Complexity of computation (including implicit computational complexity), Analysis of algorithms and problem complexity, C∞-function, \(C^\infty\)-functions, quasi-analytic functions, Derivative, 0102 computer and information sciences, Recursive analysis, 0101 mathematics, 01 natural sciences, Constructive and recursive analysis, Theoretical Computer Science, Computer Science(all)

File Description: application/xml

Access URL: https://www.sciencedirect.com/science/article/pii/S0304397501000627
https://dblp.uni-trier.de/db/journals/tcs/tcs284.html#Blaser02

The $\mu$ -measure as a tool for classifying computational complexity: The \(\mu\)-measure as a tool for classifying computational complexity

Authors: Karl-Heinz Niggl

Source: Archive for Mathematical Logic. 39:515-539

Subject Terms: Grzegorczyk classes, Complexity of computation (including implicit computational complexity), computational complexity, Heinermann class, Grammars and rewriting systems, Complexity classes (hierarchies, relations among complexity classes, etc.), primitive recursive functions, 0102 computer and information sciences, simply typed term systems, 0101 mathematics, polynomial time computable functions, 01 natural sciences, Recursive functions and relations, subrecursive hierarchies

File Description: application/xml

Access URL: https://link.springer.com/article/10.1007%2Fs001530050163

Ramified recurrence and computational complexity III: Higher type recurrence and elementary complexity: Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity

Authors: Daniel Leivant

Source: Annals of Pure and Applied Logic. 96:209-229

Subject Terms: Logic, applicative programs with recurrence operators, Ramified recurrence, 0102 computer and information sciences, 01 natural sciences, Free algebras, Kalmar-elementary functions, functionals, Complexity classes (hierarchies, relations among complexity classes, etc.), functional programs over free algebras, 0101 mathematics, Complexity of computation (including implicit computational complexity), Logic in computer science, computational complexity, ramified recurrence, higher type recurrence, Theory of programming languages, purely applicative higher-type programs, Functionals in proof theory, Models of computation (Turing machines, etc.), primitive recursion, Higher type functions, equational recurrence, Recursive functions and relations, subrecursive hierarchies, Computational complexity, higher type functions, Cut-elimination and normal-form theorems, Primitive recursion, feasibility

File Description: application/xml

Access URL: https://zbmath.org/1308104
https://doi.org/10.1016/s0168-0072(98)00040-2
https://dblp.uni-trier.de/db/journals/apal/apal96.html#Leivant99
https://www.sciencedirect.com/science/article/pii/S0168007298000402
https://doi.org/10.1016/S0168-0072(98)00040-2

Sentences over Integral Domains and Their Computational Complexities: Sentences over integral domains and their computational complexities

Authors: Shih Ping Tung

Source: Information and Computation. 149:99-133

Subject Terms: algebraic integer rings, Decidability and field theory, Complexity of computation (including implicit computational complexity), Analysis of algorithms and problem complexity, Hilbertian fields, Hilbert's irreducibility theorem, Model-theoretic algebra, 0102 computer and information sciences, time complexities of decision problems on diophantine equations, 01 natural sciences, Theoretical Computer Science, Computer Science Applications, Decidability of theories and sets of sentences, Computational Theory and Mathematics, quantifier free arithmetical formula, Hilbert domain, fraction field, arithmetical sentences, 0101 mathematics, integral domain, Model theory of fields, Information Systems

File Description: application/xml

Access URL: https://zbmath.org/1283687
https://doi.org/10.1006/inco.1998.2771
https://core.ac.uk/display/82399530
https://www.sciencedirect.com/science/article/pii/S0890540198927717
https://www.sciencedirect.com/science/article/abs/pii/S0890540198927717
https://dblp.uni-trier.de/db/journals/iandc/iandc149.html#Tung99

A Logarithmic Lower Bound for Oblivious RAM (for All Parameters): A logarithmic lower bound for oblivious RAM (for all parameters)

Authors: Ilan Komargodski Wei-Kai Lin

Source: Lecture Notes in Computer Science ISBN: 9783030842581

Subject Terms: Complexity of computation (including implicit computational complexity), Data structures, Data encryption (aspects in computer science), cell-probe complexity, Cryptography, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), lower bound, 16. Peace & justice, oblivious RAM

File Description: application/xml

Access URL: https://link.springer.com/chapter/10.1007/978-3-030-84259-8_20
https://dblp.uni-trier.de/db/conf/crypto/crypto2021-4.html#KomargodskiL21

Computational complexity of quantifier-free negationless theory of field of rational numbers

Authors: Nikolai Kossovski

Source: Annals of Pure and Applied Logic. 113:175-180

Subject Terms: Complexity of computation (including implicit computational complexity), Decidability and field theory, Decidability of theories and sets of sentences, Logic, decidability, quantifier-free theory of the field of rational numbers, universal negationless theory, 0101 mathematics, Other constructive mathematics, 01 natural sciences, binary rational numbers

File Description: application/xml

Access URL: https://www.sciencedirect.com/science/article/pii/S0168007201000574
https://philpapers.org/rec/KOSCCO
https://www.sciencedirect.com/science/article/abs/pii/S0168007201000574
https://dblp.uni-trier.de/db/journals/apal/apal113.html#Kossovski01

The computational complexity of hybrid temporal logics

Authors: Areces, C.E. Marx, M.J. Blackburn, P. et al.

Contributors: Areces, C.E. Marx, M.J. Blackburn, P. et al.

Source: Logic Journal of IGPL. 8:653-679

Subject Terms: Complexity of computation (including implicit computational complexity), computational complexity, temporal logic, satisfiability problem, 0202 electrical engineering, electronic engineering, information engineering, Temporal logic, 0102 computer and information sciences, 02 engineering and technology, hybrid logic, 01 natural sciences

File Description: application/xml

Access URL: https://inria.hal.science/inria-00000304v1
https://dare.uva.nl/personal/pure/en/publications/the-computational-complexity-of-hybrid-temporal-logics(8eb3634c-ba36-4d8f-ad1d-0dee469e06a5).html
https://hdl.handle.net/11245/1.177815
https://core.ac.uk/display/85848416
https://doi.org/10.1093/jigpal/8.5.653
https://academic.oup.com/jigpal/article-abstract/8/5/653/782933
https://www.loria.fr/~areces/content/papers/files/igpl00.pdf
https://philpapers.org/rec/ARETCC

Computational-Complexity of Arithmetical Sentences: Computational complexity of arithmetical sentences

Authors: Shih Ping Tung

Source: Information and Computation. 120:315-325

Subject Terms: Decidability (number-theoretic aspects), Complexity of computation (including implicit computational complexity), polynomial time, \(\forall \exists\) sentence, co-NP-complete, 0102 computer and information sciences, 01 natural sciences, Theoretical Computer Science, Computer Science Applications, Decidability of theories and sets of sentences, Computational Theory and Mathematics, \(\exists \forall\) sentence, decision problem, arithmetical sentence, 0101 mathematics, NP-complete, Information Systems

File Description: application/xml

Access URL: https://zbmath.org/797311
https://doi.org/10.1006/inco.1995.1116
https://core.ac.uk/display/82382645
https://dblp.uni-trier.de/db/journals/iandc/iandc120.html#Tung95b
https://www.sciencedirect.com/science/article/abs/pii/S0890540185711169

Implicit measurements of dynamic complexity properties and splittings of speedable sets

Authors: Michael A. Jahn

Source: Journal of Symbolic Logic. 64:1037-1064

Subject Terms: Blum's machine independent complexity theory, Complexity of computation (including implicit computational complexity), splittings of speedable sets, locality, Recursively (computably) enumerable sets and degrees, speedable computably enumerable set, 0102 computer and information sciences, 0101 mathematics, priority tree, 16. Peace & justice, 10. No inequality, 01 natural sciences

File Description: application/xml

Access URL: https://zbmath.org/1389455
https://doi.org/10.2307/2586618
https://projecteuclid.org/euclid.jsl/1183745869
https://www.jstor.org/stable/pdfplus/2586618.pdf
https://dblp.uni-trier.de/db/journals/jsyml/jsyml64.html#Jahn99
http://projecteuclid.org/euclid.jsl/1183745869