Search Results - "Descriptive complexity and finite models"

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

Classifying 1D elementary cellular automata with the 0–1 test for chaos: Classifying 1D elementary cellular automata with the 0-1 test for chaos

Authors: Mohammed Terry-Jack Simon O’Keefe

Source: Physica D: Nonlinear Phenomena. 453:133786

Subject Terms: Cellular automata (computational aspects), Chua complexity index, 0-1 test for chaos, cellular automata, chaos, Descriptive complexity and finite models, Dynamical aspects of cellular automata, complexity

File Description: application/xml

Access URL: https://zbmath.org/7722796
https://doi.org/10.1016/j.physd.2023.133786

The Rabin index of parity games: (Extended Abstract)

Authors: Huth, M. Kuo, J. H-P. Piterman, Nir

Source: Lecture Notes in Computer Science ISBN: 9783642341878
Electronic Proceedings in Theoretical Computer Science, Vol 119, Iss Proc. GandALF 2013, Pp 35-49 (2013)

Subject Terms: FOS: Computer and information sciences, 2010 MSC: 68Q17 (Computational difficulty of problems (lower bounds, etc.)), Specification and verification (program logics, model checking, etc.), 2010 MSC: 05C38 (Graph theory: paths and cycles), 02 engineering and technology, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, 2010 MSC: 03B70 (Logic in Compute Science), Computation Theory & Mathematics, Theoretical Computer Science, Graph theory: paths and cycles, Computer Science - Computer Science and Game Theory, QA1-939, 0202 electrical engineering, electronic engineering, information engineering, 08 Information And Computing Sciences, Logic in computer science, QA75.5-76.95, difficulty of approximation, 2010 MSC: 68Q19 (Descriptive complexity and finite models), 2010 MSC: 68Q60 (Specification and verification (program logics, model checking, Computer Science Applications, Computer Science - Computational Complexity, Computational Theory and Mathematics, completeness, Electronic computers. Computer science, Descriptive complexity and finite models, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Mathematics, Information Systems, Computer Science and Game Theory (cs.GT)

Access URL: https://arxiv.org/pdf/1307.4466
http://arxiv.org/abs/1307.4466
https://doaj.org/article/f7efda4de46149739d0870f90de91e18
https://link.springer.com/chapter/10.1007%2F978-3-642-34188-5_25
https://dblp.uni-trier.de/db/conf/hvc/hvc2011.html#HuthKP11a
https://arxiv.org/abs/1307.4466
https://arxiv.org/pdf/1307.4466v1
http://hdl.handle.net/10044/1/21559

MINIMALIZATIONS OF NFA USING THE UNIVERSAL AUTOMATON: Minimalizations of NFA using the universal automaton

Authors: Libor Polák

Source: Lecture Notes in Computer Science ISBN: 9783540243182

Subject Terms: 4. Education, Descriptive complexity and finite models, 0202 electrical engineering, electronic engineering, information engineering, Formal languages and automata, 0102 computer and information sciences, 02 engineering and technology, 16. Peace & justice, regular language, 01 natural sciences

File Description: application/xml

Access URL: https://zbmath.org/2228602
https://doi.org/10.1142/s0129054105003431
http://dblp.uni-trier.de/db/journals/ijfcs/ijfcs16.html#Polak05
https://www.worldscientific.com/doi/abs/10.1142/S0129054105003431
https://dblp.uni-trier.de/db/journals/ijfcs/ijfcs16.html#Polak05
https://rd.springer.com/chapter/10.1007/978-3-540-30500-2_37
https://dblp.uni-trier.de/db/conf/wia/ciaa2004.html#Polak04
https://link.springer.com/chapter/10.1007/978-3-540-30500-2_37

Magic Numbers for Symmetric Difference NFAs: Magic numbers for symmetric difference NFAs

Authors: Lynette van Zijl

Source: Lecture Notes in Computer Science ISBN: 9783540243182

Subject Terms: 4. Education, Descriptive complexity and finite models, 0202 electrical engineering, electronic engineering, information engineering, Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), Formal languages and automata, succinctness, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

File Description: application/xml

Access URL: https://zbmath.org/2228604
https://doi.org/10.1142/s0129054105003455
http://dblp.uni-trier.de/db/journals/ijfcs/ijfcs16.html#Zijl05
https://www.worldscientific.com/doi/abs/10.1142/S0129054105003455
https://dblp.uni-trier.de/db/journals/ijfcs/ijfcs16.html#Zijl05
https://doi.org/10.1142/S0129054105003455

Describing Parameterized Complexity Classes: Describing parameterized complexity classes

Authors: Flum, Jörg Grohe, Martin

Source: Lecture Notes in Computer Science ISBN: 9783540432838

Subject Terms: descriptive complexity theory, Computational Theory and Mathematics, Descriptive complexity and finite models, 0202 electrical engineering, electronic engineering, information engineering, Complexity classes (hierarchies, relations among complexity classes, etc.), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Theoretical Computer Science, Information Systems, Computer Science Applications

File Description: application/xml

Access URL: https://zbmath.org/2092755
https://doi.org/10.1016/s0890-5401(03)00161-5
https://dblp.uni-trier.de/db/conf/stacs/stacs2002.html#FlumG02
https://link.springer.com/chapter/10.1007%2F3-540-45841-7_29
https://rd.springer.com/chapter/10.1007/3-540-45841-7_29
https://doi.org/10.1007/3-540-45841-7_29

An Existential Locality Theorem: An existential locality theorem

Authors: Stefan Wöhrle Martin Grohe

Source: Lecture Notes in Computer Science ISBN: 9783540425540

Subject Terms: Existential first-order logic, Logic, Descriptive complexity and finite models, Model theory of finite structures, 0102 computer and information sciences, Locality, 0101 mathematics, Finite model theory, 01 natural sciences, Descriptive complexity

File Description: application/xml

Access URL: https://zbmath.org/2117328
https://doi.org/10.1016/j.apal.2004.01.005
https://www.sciencedirect.com/science/article/abs/pii/S016800720400020X
https://core.ac.uk/display/36499756
https://www.sciencedirect.com/science/article/pii/S016800720400020X
https://dblp.uni-trier.de/db/journals/apal/apal129.html#GroheW04
https://link.springer.com/chapter/10.1007/3-540-44802-0_8
https://dblp.uni-trier.de/db/conf/csl/csl2001.html#GroheW01
https://rd.springer.com/chapter/10.1007/3-540-44802-0_8
https://link.springer.com/content/pdf/10.1007%2F3-540-44802-0_8.pdf
https://philpapers.org/rec/GROAEL
https://core.ac.uk/display/22085460

Randomness is hard

Authors: Buhrman, H.M. Torenvliet, L.

Source: Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247). :249-260

Subject Terms: interactive proofs, Complexity of computation (including implicit computational complexity), CND complexity, Kolmogorov complexity, randomness, Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), Merlin-Arthur, Algorithmic information theory (Kolmogorov complexity, etc.), complexity classes, Descriptive complexity and finite models, Complexity classes (hierarchies, relations among complexity classes, etc.), Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), CD complexity, relativization, Arthur-Merlin

File Description: application/xml

Access URL: https://dare.uva.nl/personal/pure/en/publications/randomness-is-hard(e15bc823-88ae-4c84-b05d-5f59b1e7d7fc).html
https://hdl.handle.net/11245/1.153489
https://hdl.handle.net/11245/1.153487
https://dare.uva.nl/personal/pure/en/publications/randomness-is-hard(a1995f15-ca11-4396-9714-e75e62d1fa36).html
https://hdl.handle.net/11245/1.177596
https://doi.org/10.1137/S0097539799360148
https://dare.uva.nl/personal/pure/en/publications/randomness-is-hard(45e1b984-a1a1-4726-baed-7dcd13cb4da0).html
https://www.narcis.nl/publication/RecordID/oai%3Acwi.nl%3A1273
http://doi.ieeecomputersociety.org/10.1109/CCC.1998.694616
https://ieeexplore.ieee.org/document/694616/
https://dblp.uni-trier.de/db/conf/coco/coco1998.html#BuhrmanT98
https://epubs.siam.org/doi/pdf/10.1137/S0097539799360148
http://ieeexplore.ieee.org/document/694616/

On the Complexity of Single-Rule Datalog Queries: On the complexity of single-rule datalog queries.

Authors: Gottlob, G Papadimitriou, C

Source: Lecture Notes in Computer Science ISBN: 9783540664925

Subject Terms: Datalog, Linear recursion, Exponential time, Sirup: clause implication, Complexity, 0102 computer and information sciences, 02 engineering and technology, Single rule program, Expressive power, Logic programming, 01 natural sciences, Descriptive complexity, Theoretical Computer Science, Computer Science Applications, Subsumption, Computational Theory and Mathematics, Descriptive complexity and finite models, 0202 electrical engineering, electronic engineering, information engineering, Sirup clause implication, Information Systems

File Description: application/xml

Access URL: https://link.springer.com/chapter/10.1007%2F3-540-48242-3_13
https://dblp.uni-trier.de/db/conf/lpar/lpar99.html#GottlobP99
https://rd.springer.com/chapter/10.1007/3-540-48242-3_13
https://www.cs.ox.ac.uk/publications/publication213-abstract.html
https://link.springer.com/10.1007/3-540-48242-3_13
https://ora.ox.ac.uk/objects/uuid:aa9d7d27-53e1-4276-ac2d-8625e123aebe
https://doi.org/10.1016/s0890-5401(03)00012-9
https://ora.ox.ac.uk/objects/uuid:de527939-b128-4899-8120-94fea46af6b0

Program Schemes, Arrays, Lindström Quantifiers and Zero-One Laws: Program schemes, arrays, Lindström quantifiers and zero-one laws

Authors: Stewart, I.A.

Source: Lecture Notes in Computer Science ISBN: 9783540665366
Theoretical computer science, 2002, Vol.275(1-2), pp.283-310 [Peer Reviewed Journal]

Subject Terms: Program schemes, Logic in computer science, Logic with extra quantifiers and operators, Descriptive complexity, Complexity theory, Model theory of finite structures, complexity theory, 0102 computer and information sciences, Finite model theory, 01 natural sciences, Theoretical Computer Science, finite model theory, Descriptive complexity and finite models, Lindström quantifiers, Complexity classes (hierarchies, relations among complexity classes, etc.), Lindström quatifiers, 0101 mathematics, Zero-one laws, program schemes, zero-one laws, Computer Science(all)

File Description: application/xml; application/pdf

Access URL: http://dro.dur.ac.uk/606/1/606.pdf
https://dblp.uni-trier.de/db/journals/tcs/tcs275.html#Stewart02
https://doi.org/10.1016/S0304-3975(01)00183-9
https://dro.dur.ac.uk/606/
https://www.sciencedirect.com/science/article/pii/S0304397501001839
https://dblp.uni-trier.de/db/conf/csl/csl99.html#Stewart99
https://link.springer.com/chapter/10.1007%2F3-540-48168-0_27
https://rd.springer.com/chapter/10.1007/3-540-48168-0_27
https://link.springer.com/content/pdf/10.1007%2F3-540-48168-0_27.pdf
https://core.ac.uk/display/22383747

Logics which capture complexity classes over the reals

Authors: Klaus Meer Felipe Cucker

Source: Lecture Notes in Computer Science ISBN: 9783540633860

Subject Terms: descriptive complexity theory, Complexity of computation (including implicit computational complexity), Descriptive complexity and finite models, Turing machines and related notions, Complexity classes (hierarchies, relations among complexity classes, etc.), logical description of complexity classes, Model theory of finite structures, 0102 computer and information sciences, Models of computation (Turing machines, etc.), 0101 mathematics, 16. Peace & justice, 01 natural sciences, real number model of computation

File Description: application/xml

Access URL: https://zbmath.org/1310714
https://doi.org/10.2307/2586770
https://www.cambridge.org/core/journals/journal-of-symbolic-logic/article/logics-which-capture-complexity-classes-over-the-reals/D0DDB1777115F89F8EA82A2A0DD425F8
https://projecteuclid.org/euclid.jsl/1183745711
http://projecteuclid.org/euclid.jsl/1183745711
https://dblp.uni-trier.de/db/journals/jsyml/jsyml64.html#CuckerM99
https://core.ac.uk/display/36571284
https://link.springer.com/content/pdf/10.1007%2FBFb0036180.pdf
https://link.springer.com/chapter/10.1007/BFb0036180
https://rd.springer.com/chapter/10.1007/BFb0036180
https://philpapers.org/rec/CUCLWC
https://dblp.uni-trier.de/db/conf/fct/fct97.html#CuckerM97

Descriptive Complexity Theories: Descriptive complexity theories.

Authors: Flum, Joerg

Source: Addi. Archivo Digital para la Docencia y la Investigación
instname
Universidad del País Vasco
Theoria, Vol 18, Iss 1, Pp 47-58 (2010)

Subject Terms: descriptive complexity, Descriptive complexity and finite models, B1-5802, Complexity classes (hierarchies, relations among complexity classes, etc.), Model theory of finite structures, survey, 0102 computer and information sciences, Philosophy (General), 0101 mathematics, 01 natural sciences

File Description: application/pdf; application/xml

Access URL: http://hdl.handle.net/10810/39236
https://zbmath.org/2001368
https://doaj.org/article/6c3df69f29694ba188714ad1bf8cbef9
https://www.jstor.org/stable/23918436
https://ojs.ehu.eus/index.php/THEORIA/article/download/409/534
http://philsci-archive.pitt.edu/10538/1/409%2D728%2D1%2DPB.pdf
http://philsci-archive.pitt.edu/10538/
https://dialnet.unirioja.es/descarga/articulo/499189.pdf
http://www.ehu.eus/ojs/index.php/THEORIA/article/download/409/534

An Algebra for Pomsets: Extended abstract

Authors: Stéphane Grumbach Tova Milo

Source: Lecture Notes in Computer Science ISBN: 9783540589075

Subject Terms: Logic in computer science, Computational Theory and Mathematics, Database theory, Descriptive complexity and finite models, PTIME queries, relational databases, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Theoretical Computer Science, Information Systems, Computer Science Applications

File Description: application/xml

Access URL: https://zbmath.org/1853039
https://doi.org/10.1006/inco.1998.2777
https://dblp.uni-trier.de/db/journals/iandc/iandc150.html#GrumbachM99
https://core.ac.uk/display/82206264
https://dlnext.acm.org/doi/10.1006/inco.1998.2777
https://www.sciencedirect.com/science/article/abs/pii/S0890540198927778
https://www.sciencedirect.com/science/article/pii/S0890540198927778
https://rd.springer.com/chapter/10.1007/3-540-58907-4_16
https://link.springer.com/chapter/10.1007%2F3-540-58907-4_16
https://core.ac.uk/display/22831320
https://dblp.uni-trier.de/db/conf/icdt/icdt95.html#GrumbachM95
https://link.springer.com/content/pdf/10.1007%2F3-540-58907-4_16.pdf

Metafinite Model Theory: Metafinite model theory

Authors: Erich Grädel Yuri Gurevich

Source: Lecture Notes in Computer Science ISBN: 9783540601784

Subject Terms: descriptive complexity, metafinite structures, Computational Theory and Mathematics, Descriptive complexity and finite models, Applications of model theory, Model theory of finite structures, 0102 computer and information sciences, Models of computation (Turing machines, etc.), 0101 mathematics, 01 natural sciences, Theoretical Computer Science, Information Systems, Computer Science Applications

File Description: application/xml

Access URL: https://dblp.uni-trier.de/db/journals/iandc/iandc140.html#GradelG98
https://research.microsoft.com/en-us/um/people/gurevich/opera/109.pdf
https://core.ac.uk/display/82010155
https://www.sciencedirect.com/science/article/abs/pii/S0890540197926754
https://www.microsoft.com/en-us/research/publication/109-metafinite-model-theory/
https://link.springer.com/chapter/10.1007%2F3-540-60178-3_92
https://link.springer.com/chapter/10.1007/3-540-60178-3_92
https://dblp.uni-trier.de/db/conf/lcc/lcc94.html#GradelG94
https://link.springer.com/content/pdf/10.1007%2F3-540-60178-3_92.pdf
https://rd.springer.com/chapter/10.1007/3-540-60178-3_92

DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY: Descriptional complexity of NFA of different ambiguity

Authors: Hing Leung

Source: International Journal of Foundations of Computer Science. 16:975-984

Subject Terms: Descriptive complexity and finite models, 0202 electrical engineering, electronic engineering, information engineering, Formal languages and automata, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, nondeterministic finite automata

File Description: application/xml

Access URL: https://zbmath.org/2228600
https://doi.org/10.1142/s0129054105003418

THE PHENOMENON OF NON-RECURSIVE TRADE-OFFS: The phenomenon of non-recursive trade-offs

Authors: Martin Kutrib

Source: International Journal of Foundations of Computer Science. 16:957-973

Subject Terms: multihead finite automata, Descriptive complexity and finite models, 0202 electrical engineering, electronic engineering, information engineering, Formal languages and automata, 0102 computer and information sciences, 02 engineering and technology, descriptional complexity, 01 natural sciences

File Description: application/xml

Access URL: https://zbmath.org/2228599
https://doi.org/10.1142/s0129054105003406

The first order definability of graphs with separators via the Ehrenfeucht game

Authors: Oleg Verbitsky

Source: Theoretical Computer Science. 343:158-176

Subject Terms: First order definability, graph separators, 05C60, Model theory of finite structures, Mathematics - Logic, 0102 computer and information sciences, 01 natural sciences, planar graphs, Planar graphs, geometric and topological aspects of graph theory, Theoretical Computer Science, Basic properties of first-order languages and structures, 03C13, Descriptive complexity and finite models, FOS: Mathematics, Graph separators, Mathematics - Combinatorics, Combinatorics (math.CO), Planer graphs, Games involving graphs, first-order definability, 0101 mathematics, Logic (math.LO), Ehrenfeucht game, Computer Science(all)

File Description: application/xml

Access URL: http://arxiv.org/abs/math/0401361
https://dblp.uni-trier.de/db/journals/tcs/tcs343.html#Verbitsky05
https://core.ac.uk/display/82595278
https://www.sciencedirect.com/science/article/pii/S0304397505003142

ON THE DESCRIPTIONAL COMPLEXITY OF METALINEAR CD GRAMMAR SYSTEMS: On the descriptional complexity of metalinear CD grammar systems

Authors: Bettina Sunckel

Source: International Journal of Foundations of Computer Science. 16:1011-1025

Subject Terms: Descriptive complexity and finite models, Grammars and rewriting systems, decidability, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, non-recursive trade-off, 01 natural sciences

File Description: application/xml

Access URL: https://zbmath.org/2228603
https://doi.org/10.1142/s0129054105003443
https://dblp.uni-trier.de/db/journals/ijfcs/ijfcs16.html#Sunckel05
http://dblp.uni-trier.de/db/journals/ijfcs/ijfcs16.html#Sunckel05
https://www.worldscientific.com/doi/abs/10.1142/S0129054105003443

A CHARACTERIZATION OF THE ARITHMETICAL HIERARCHY BY LANGUAGE EQUATIONS: A characterization of the arithmetical hierarchy by language equations

Authors: Alexander Okhotin

Source: International Journal of Foundations of Computer Science. 16:985-998

Subject Terms: descriptive complexity, First-order arithmetic and fragments, decision problem, Descriptive complexity and finite models, 0202 electrical engineering, electronic engineering, information engineering, Formal languages and automata, 0102 computer and information sciences, 02 engineering and technology, Automata and formal grammars in connection with logical questions, 01 natural sciences, Hierarchies of computability and definability

File Description: application/xml

Access URL: https://www.worldscientific.com/doi/abs/10.1142/S012905410500342X
http://dblp.uni-trier.de/db/journals/ijfcs/ijfcs16.html#Okhotin05
https://dblp.uni-trier.de/db/journals/ijfcs/ijfcs16.html#Okhotin05

NON-RECURSIVE TRADE-OFFS FOR TWO-WAY MACHINES: Non-recursive trade-offs for two-way machines

Authors: Christos A. Kapoutsis

Source: International Journal of Foundations of Computer Science. 16:943-956

Subject Terms: Descriptive complexity and finite models, multi-counter automata, Formal languages and automata, 0102 computer and information sciences, descriptional complexity, 0101 mathematics, 01 natural sciences

File Description: application/xml

Access URL: https://zbmath.org/2228598
https://doi.org/10.1142/s012905410500339x
https://dblp.uni-trier.de/db/journals/ijfcs/ijfcs16.html#Kapoutsis05
http://dblp.uni-trier.de/db/journals/ijfcs/ijfcs16.html#Kapoutsis05
https://www.worldscientific.com/doi/abs/10.1142/S012905410500339X