Search Results - nonnumerical algorithms and (problem OR problems)—complexity of proof procedures*
-
1
Authors: et al.
Contributors: et al.
Source: Lecture Notes in Computer Science ISBN: 9783319492582
Subject Terms: [INFO.INFO-DC]Computer Science [cs]/Distributed, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.0: Complexity of proof procedures, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], ACM: D.: Software/D.4: OPERATING SYSTEMS/D.4.5: Reliability/D.4.5.2: Fault-tolerance, Parallel, 01 natural sciences, and Cluster Computing [cs.DC], ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.1: Computations on discrete structures, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS/C.2.4: Distributed Systems/C.2.4.1: Distributed applications, [INFO]Computer Science [cs], ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.1: Specifying and Verifying and Reasoning about Programs/F.3.1.3: Mechanical verification, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.3: Studies of Program Constructs/F.3.3.4: Type structure
File Description: application/pdf
Access URL: https://link.springer.com/article/10.1007/s00224-017-9828-z
https://hal.archives-ouvertes.fr/hal-01894618
https://doi.org/10.1007/s00224-017-9828-z
https://dblp.uni-trier.de/db/journals/mst/mst63.html#BalabonskiDRTU19
https://rd.springer.com/chapter/10.1007/978-3-319-49259-9_2
https://doi.org/10.1007/978-3-319-49259-9_2
https://hal.archives-ouvertes.fr/hal-01491813
https://dblp.uni-trier.de/db/conf/sss/sss2016.html#BalabonskiDRTU16
https://link.springer.com/chapter/10.1007/978-3-319-49259-9_2
http://dblp.uni-trier.de/db/conf/sss/sss2016.html#BalabonskiDRTU16
https://hal.science/hal-01894618v1/document
https://doi.org/10.1007/s00224-017-9828-z
https://hal.science/hal-01894618v1
https://hal.sorbonne-universite.fr/hal-01491813v1
https://doi.org/10.1007/978-3-319-49259-9_2 -
2
Authors:
Contributors:
Subject Terms: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Complexity of proof procedures General Terms, Algorithms, Theory Additional Key Words and Phrases, Proof complexity, parameterized complexity, Resolution, Prover-Delayer games ACM Reference Format
File Description: application/pdf
-
3
Authors:
Contributors:
Subject Terms: Categories and Subject Descriptors H.2.3 [Database management systems, Languages— query languages, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems— Complexity of proof procedures General Terms Algorithms, Theory Keywords XPath, trees, satisfiability
File Description: application/pdf
-
4
Authors: et al.
Contributors: et al.
Source: Lecture Notes in Computer Science ISBN: 9783319096971
Subject Terms: ddc:004, Data processing Computer science, Models of Computation (F.4.1), Unbounded-action devices (e.g., cellular automata, circuits, networks of machines), Classes defined by grammars or automata (e.g., context-free languages, regular sets, recursive sets), 0102 computer and information sciences, 02 engineering and technology, Routing and layout, 01 natural sciences, Classes defined by resource-bounded automata, Algebraic language theory, Self-modifying machines (e.g., neural networks), Relations among complexity classes, 0202 electrical engineering, electronic engineering, information engineering, Decision problems, Pattern matching, Complexity of proof procedures, Bounded-action devices (e.g., Turing machines, random access machines), Machine-independent complexity, computational complexity, Automata (e.g., finite, push-down, resource-bounded), Formal Languages (D.3.1), almost-equivalence, 4. Education, Relations between models, hyper-minimization, Computability theory, 16. Peace & justice, Reducibility and completeness, Geometrical problems and computations, Relations among complexity measures, Operations on languages, Computations on discrete structures, Sorting and searching, Sequencing and scheduling, biautomata, Complexity hierarchies, Complexity Measures and Classes (F.2) (REVISED), Nonnumerical Algorithms and Problems (E.2-5, G.2, H.2-3)
File Description: application/pdf
Access URL: http://geb.uni-giessen.de/geb/volltexte/2014/11056/pdf/Ifig_Report1401.pdf
http://www.informatik.uni-giessen.de/reports/Report1401.pdf
https://link.springer.com/chapter/10.1007/978-3-319-09698-8_26
https://rd.springer.com/chapter/10.1007/978-3-319-09698-8_26
http://geb.uni-giessen.de/geb/volltexte/2014/11056/ -
5
Authors: et al.
Contributors: et al.
Subject Terms: and Protection, D.4.6 [Operating Systems, Security and Protection—Access controls, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Complexity of proof procedures General Terms, Security, Theory, Languages Additional Key Words and Phrases, access control, trust management, distributed system security, logic
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.119.4238; http://www.cs.utsa.edu/~winsboro/index_files/Papers/Safety_JACM_AcceptedVersion.pdf
-
6
Authors:
Source: Journal of the ACM; Aug2012, Vol. 59 Issue 4, p1-34, 34p
Subject Terms: MATHEMATICAL logic, ALGORITHMS, COMPUTATIONAL complexity, POLYNOMIALS, PARAMETERIZATION, PARAMETER estimation
-
7
Authors: et al.
Contributors: et al.
Subject Terms: Categories and Subject Descriptors D.4.6 [Operating Systems, Security and Protection—Access controls, K.6.5 [Management of Computing and Information Systems, Security and Protection, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Complexity of proof procedures General Terms Security, Theory Keywords Access Control, Fault-tolerant, Policy Design
File Description: application/pdf
-
8
Authors:
Contributors:
Subject Terms: Mathematical Logic—Modal Logic, Computational Logic, F.2.2. [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Complexity of Proof Procedures General Terms, Algorithms, Languages, Theory Additional Key Words and Phrases, Shallow models, resolution, coalgebra
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.939; http://tocl.acm.org/accepted/352schroeder.pdf
-
9
Authors:
Contributors:
Source: http://arxiv.org/pdf/0805.1464v1.pdf.
Subject Terms: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Complexity of proof procedures, F.4.1 [Mathematical Logic and Formal Languages, Mathematical Logic—Proof theory, Mechanical theorem proving General Terms, Theory Additional Key Words and Phrases, Arithmetic, deduction modulo, higher-order logic, prooflength speed-ups, term
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.312.3589; http://arxiv.org/pdf/0805.1464v1.pdf
-
10
Authors:
Contributors:
Subject Terms: Mathematical Logic—Modal Logic, Computational Logic, F.2.2. [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Complexity of Proof Procedures General Terms, Algorithms, Languages, Theory Additional Key Words and Phrases, Shallow models, resolution, coalgebra
File Description: application/pdf
-
11
Authors:
Contributors:
Subject Terms: Categories and Subject Descriptors, D.4.6 [Operating Systems, Security and Protection—Access controls, F.4.3 [Mathematical Logic And Formal Languages, Formal Languages, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Complexity of proof procedures, K.6.5 [Management of Computing and Information Systems, Security and Protection General Terms, Security, Theory, Verification
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.320.4211; http://www.cs.purdue.edu/homes/ninghui/papers/algebra_jacm.pdf
-
12
Authors:
Contributors:
Subject Terms: Categories and Subject Descriptors, F.4.1 [Mathematical Logic and Formal Languages, Mathematical Logic--computational logic, lambda calculus and related systems, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems-- complexity of proof procedures General Terms, Theory Additional Key Words and Phrases, elementary recursive functions, complexity, lambda calculus, second order logic
File Description: application/postscript
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.5408; http://www.tcs.ifi.lmu.de/~jjohanns/papers/elf.ps.gz
-
13
Authors: et al.
Contributors: et al.
Subject Terms: Categories and Subject Descriptors D.4.6 [Operating Systems, Security and Protection—Access controls, K.6.5 [Management of Computing and Information Systems, Security and Protection, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Complexity of proof procedures General Terms Security, Theory Keywords role-based access control
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.320.4355; http://www.cs.purdue.edu/homes/ninghui/papers/sod_ccs04.pdf
-
14
Authors: et al.
Contributors: et al.
Subject Terms: ddc:004, Data processing Computer science, cyclic languages, commutative languages, Routing and layout, Parallel rewriting systems (e.g., developmental systems, L-systems), Grammars and Other Rewriting Systems (D.3.1), Grammar types (e.g., context-free, context-sensitive), Relations among complexity classes, Decision problems, Pattern matching, Thue systems, Complexity of proof procedures, Parsing, Machine-independent complexity, Brzozowski´s minimization algorithm, deterministic and nondeterministic biautomata, Reducibility and completeness, Geometrical problems and computations, Relations among complexity measures, Computations on discrete structures, Sorting and searching, Sequencing and scheduling, Complexity hierarchies, Complexity Measures and Classes (F.2) (REVISED), Nonnumerical Algorithms and Problems (E.2-5, G.2, H.2-3)
File Description: application/pdf
Access URL: http://geb.uni-giessen.de/geb/volltexte/2014/11054/
-
15
Authors:
Contributors:
Subject Terms: Nonnumerical Algorithms and Problems|complexity of proof procedures General terms, Algorithms, Theory Additional Key Words and Phrases, Data ow frameworks, data ow analysis, bidirectional data ows
File Description: application/postscript
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.3128; http://www.iitb.ernet.in:8000/~uday/t1271.ps
-
16
Authors: Bonacina, I.
Source: Leibniz International Proceedings in Informatics, LIPIcs.
Subject Terms: Resolution, Total space, Width, Automata theory, Optical resolving power, Trees (mathematics), Complexity measures, Complexity of proof procedures, K-CNF formulas, Nonnumerical algorithms and problems, Resolution refutation, Subject classification, Computational complexity
File Description: print
-
17
Authors:
Source: Journal of the ACM; Dec2015, Vol. 62 Issue 6, p44-44:35, 35p
-
18
Authors:
Source: ACM Transactions on Computational Logic; Aug2013, Vol. 14 Issue 3, p1-21, 21p
-
19
Authors: et al.
Contributors: et al.
Subject Terms: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Complexity of proof procedures General Terms, Algorithms, Theory Additional Key Words and Phrases, Proof complexity, parameterized complexity, Resolution, bounded-depth Frege ACM Reference Format
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.4930; http://people.cs.uchicago.edu/~razborov/files/parres.pdf
-
20
Authors:
Contributors:
Subject Terms: Nonnumerical Algorithms and Problems—Complexity of proof procedures, F.4.1 [Mathematical Logic and Formal Languages, Mathematical Logic—Computational logic, Modal logic, Model theory, Proof theory General Terms, Access Control, Logic, Complexity Additional Key Words and Phrases, derivation problem, infon, infon logic, intuitionistic logic, linear time
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.192.5704; http://www.acm.org/pubs/tocl/accepted/446gurevich.pdf
Full Text Finder 
Nájsť tento článok vo Web of Science