Treffer 201 - 220 von 1.231

201

New Upper Bounds for Maximum Satisfiability: New upper bounds for maximum satisfiability
Peter Rossmanith ; Rolf Niedermeier
Journal of Algorithms. 36:63-88

Complexity of computatio... MAXSAT Analysis of algorithms a... 0211 other engineering a... 0102 computer and inform... 02 engineering and techn...
Fachzeitschrift
Zu den Favoriten
202

Safe recursion with higher types and BCK-algebra
Martin Hofmann
Annals of Pure and Applied Logic. 104:113-166

BCK-algebras, BCI-algebr... Complexity of computatio... Realisability Higher-type and set recu... Logic Polynomial time
Fachzeitschrift
Zu den Favoriten
203

Counting Modulo Quantifiers on Finite Structures: Counting modulo quantifiers on finite structures
Juha Nurmonen
Information and Computation. 160:62-87

elementary equivalence counting modulo quantifi... Complexity of computatio... Computational Theory and... Descriptive complexity a... Model theory of finite s...
Fachzeitschrift
Zu den Favoriten
204

Higher type recursion, ramification and polynomial time
Karl-Heinz Niggl ; Helmut Schwichtenberg ; Stephen J. Bellantoni
Annals of Pure and Applied Logic. 104:17-30

Complexity of computatio... Proof theory in general... polynomial-time computab... ramified recursion Logic Theory of programming la...
Fachzeitschrift
Zu den Favoriten
205

Space Complexity in Propositional Calculus: Space complexity in propositional calculus
Eli Ben-Sasson ; Avi Wigderson ; Michael Alekhnovich ; et al.
SIAM Journal on Computing. 31:1184-1211

Complexity of proofs Complexity of computatio... resolution 0102 computer and inform... 01 natural sciences Mechanization of proofs...
Fachzeitschrift
Zu den Favoriten
206

New Worst-Case Upper Bounds for SAT: New worst-case upper bounds for SAT
Edward A. Hirsch
Journal of Automated Reasoning. 24:397-420

Mechanization of proofs... Complexity of computatio... worst-case upper bounds Analysis of algorithms a... 0211 other engineering a... transformation rule
Fachzeitschrift
Zu den Favoriten
207

Linear matrix period in max-plus algebra
Martin Gavalec
Linear Algebra and its Applications. 307:167-182

Complexity of computatio... Numerical Analysis Algebra and Number Theor... Matrices over special ri... Linear matrix period 0211 other engineering a...
Fachzeitschrift
Zu den Favoriten
208

Three generators for minimal writing-space computations
Serge Burckel ; Marianne Morillon
RAIRO - Theoretical Informatics and Applications. 34:131-138

Complexity of computatio... Combinatorics in compute... 0102 computer and inform... Boolean functions 0101 mathematics minimal writing-space co...
Fachzeitschrift
Zu den Favoriten
209

Speeding up Algorithms on Atomic Representations of Herbrand Models via New Redundancy Criteria: Speeding up algorithms on atomic representations of Herbrand models via new redundancy criteria
Reinhard Pichler
Journal of Symbolic Computation. 29:213-257

Complexity of computatio... Algebra and Number Theor... Analysis of algorithms a... atomic representation 0102 computer and inform... 02 engineering and techn...
Fachzeitschrift
Zu den Favoriten
210

On some tractable classes in deduction and abduction
Alvaro del Val
Artificial Intelligence. 116:297-313

Complexity of computatio... Tractable inference Entailment abduction Automated reasoning 0102 computer and inform...
Fachzeitschrift
Zu den Favoriten
211

Bounding the unsatisfiability threshold of random 3-SAT
Svante Janson ; Malvina Vamvakari ; Yannis C. Stamatiou
Random Structures and Algorithms. 17:103-116

Complexity of computatio... Classical propositional... random 3-SAT Combinatorial probabilit... Analysis of algorithms a... generating functions
Fachzeitschrift
Zu den Favoriten
212

Complexity Results for First-Order Two-Variable Logic with Counting: Complexity results for first-order two-variable logic with counting
Lidia Tendera ; Wiesław Szwast ; Leszek Pacholski
SIAM Journal on Computing. 29:1083-1117

Complexity of computatio... computational complexity NEXPTIME-complete Analysis of algorithms a... satisfiability problem Classical first-order lo...
Fachzeitschrift
Zu den Favoriten
213

The Nondeterministic Information Logic NIL is PSPACE-complete: The nondeterministic information logic NIL is PSPACE-complete
Demri, Stéphane ; Laboratoire Leibniz (Leibniz - IMAG) ; Université Joseph Fourier - Grenoble 1 (UJF)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS) ; et al.
Fundamenta Informaticae. 42:211-234

Complexity of proofs Logic in computer scienc... Logic in artificial inte... Complexity of computatio... computational complexity [INFO.INFO-LO]Computer S...
Fachzeitschrift
Zu den Favoriten
214

Separating Complexity Classes Using Autoreducibility: Separating complexity classes using autoreducibility
Buhrman, H.M. ; Fortnow, L. ; van Melkebeek, D. ; et al.
SIAM Journal on Computing. 29:1497-1520

Complexity of computatio... completeness FOS: Mathematics Complexity classes (hier... Mathematics - Logic 0102 computer and inform...
Fachzeitschrift
Zu den Favoriten
215

Matching upper and lower bounds for simulations of several linear tapes on one multidimensional tape
Martin Hühne ; Martin Dietzfelbinger
Computational Complexity. 8:371-392

Turing machine Complexity of computatio... Analysis of algorithms a... 0102 computer and inform... Models of computation (T... 0101 mathematics
Fachzeitschrift
Zu den Favoriten
216

On the Restraining Power of Guards: On the restraining power of guards
Erich Grädel
Journal of Symbolic Logic. 64:1719-1742

Complexity of computatio... Decidability of theories... loosely guarded fragment... guarded fragments of fir... finite model property Undecidability and degre...
Fachzeitschrift
Zu den Favoriten
217

Logics that define their own semantics
H. Imhof
Archive for Mathematical Logic. 38:491-513

Complexity of computatio... Logic in computer scienc... Logic with extra quantif... Abstract model theory PTIME Model theory of finite s...
Fachzeitschrift
Zu den Favoriten
218

Computing the Rabin Index of a Parity Automaton: Computing the Rabin index of a parity automaton
Carton, Olivier ; Maceiras, R ; Carton, Olivier
RAIRO - Theoretical Informatics and Applications. 33:495-505

Complexity of computatio... parity automaton 0202 electrical engineer... Formal languages and aut... 0102 computer and inform... 02 engineering and techn...
Fachzeitschrift
Zu den Favoriten
219

Choiceless polynomial time
Andreas Blass ; Yuri Gurevich ; Saharon Shelah
Annals of Pure and Applied Logic. 100:141-187

FOS: Computer and inform... Computer Science - Logic... polynomial time Logic 0102 computer and inform... Unordered structures
Fachzeitschrift
Zu den Favoriten
220

LOGSPACE and PTIME characterized by programming languages
Jones, Neil D.
Theoretical Computer Science. 228:151-174

Read-only or cons-free p... Complexity of computatio... Complexity classes (hier... PTIME Complexity 0102 computer and inform...
Fachzeitschrift
Zu den Favoriten

Filter