Treffer 161 - 180 von 1.231

161

Analytic sets in Descriptive Set Theory and NP sets in Complexity Theory: Analytic sets in descriptive set theory and NP sets in complexity theory
SuresonClaude
Fundamenta Informaticae. 50:77-110

Complexity of computatio... co-analytic set Kleene hierarchy nondeterministic polynom... circuits Complexity classes (hier...
Fachzeitschrift
Zu den Favoriten
162

Lattice Embeddings for Abstract Bounded Reducibilities: Lattice embeddings for abstract bounded reducibilities
Wolfgang Merkle
SIAM Journal on Computing. 31:1119-1155

Complexity of computatio... Other degrees and reduci... Complexity classes (hier... embeddings of partial or... resource-bounded reducib... abstract reducibilities
Fachzeitschrift
Zu den Favoriten
163

The Minimization Problem for Boolean Formulas: The minimization problem for Boolean formulas
Gerd Wechsung ; Edith Hemaspaandra
SIAM Journal on Computing. 31:1948-1958

Complexity of computatio... Boolean formula minimiza... parallel access computational complexity 0202 electrical engineer... Computational difficulty...
Fachzeitschrift
Zu den Favoriten
164

A term rewriting characterization of the functions computable in polynomial space
Isabel Oitavem
Archive for Mathematical Logic. 41:35-47

Logic in computer scienc... Complexity of computatio... recursion schemes recursive functions term rewriting Grammars and rewriting s...
Fachzeitschrift
Zu den Favoriten
165

The Efficiency of Resolution and Davis--Putnam Procedures: The efficiency of resolution and Davis-Putnam procedures
Paul Beame ; Richard M. Karp ; Michael Saks ; et al.
SIAM Journal on Computing. 31:1048-1075

Complexity of proofs Complexity of computatio... Analysis of algorithms a... random formulas resolution 0102 computer and inform...
Fachzeitschrift
Zu den Favoriten
166

Minimal pairs and complete problems
Robert I. Soare ; Klaus Ambos-Spies ; Steven Homer
Lecture Notes in Computer Science ISBN: 9783540522829

minimal pair Complexity of computatio... NP-complete sets polynomial many-one redu... Other degrees and reduci... oracle dependent
Fachzeitschrift
Zu den Favoriten
167

Finite-model theory—a personal perspective: Finite-model theory -- A personal perspective
Ronald Fagin
Lecture Notes in Computer Science ISBN: 9783540535072

descriptive complexity t... Complexity of computatio... expository paper Random graphs (graph-the... zero-one- laws Model theory of finite s...
Buch
Zu den Favoriten
168

Computational complexity of quantifier-free negationless theory of field of rational numbers
Nikolai Kossovski
Annals of Pure and Applied Logic. 113:175-180

Complexity of computatio... Decidability and field t... Decidability of theories... Logic decidability quantifier-free theory o...
Fachzeitschrift
Zu den Favoriten
169

Complexity of t-tautologies
Baaz M. ; Hájek P. ; Montagna F. ; et al.
Annals of Pure and Applied Logic. 113:3-11

NP completeness Complexity of computatio... Decidability of theories... triangular norm Logic Computational difficulty...
Fachzeitschrift
Zu den Favoriten
170

The Complexity of Regularity in Grammar Logics and Related Modal Logics: The complexity of regularity in grammar logics and related modal logics
Demri, Stéphane ; Demri, Stéphane
Journal of Logic and Computation. 11:933-960

[INFO.INFO-LO] Computer... Analysis of algorithms a... description logic regular grammar logic translation Formal languages and aut...
Fachzeitschrift
Zu den Favoriten
171

The set of the true regular protothetics formulas with partially ordered quantifiers is NEXPTIME-complete
Anatoly Petrovich Beltiukov
Annals of Pure and Applied Logic. 113:53-58

Complexity of computatio... propositional formulas computational complexity partially ordered quanti... Logic nondeterministic exponen...
Fachzeitschrift
Zu den Favoriten
172

Which bases admit non-trivial shrinkage of formulae?
Hana Chockler ; Uri Zwick
Computational Complexity. 10:28-40

nonlinear lower bounds parity function Complexity of computatio... random restrictions Switching theory, applic... Boolean functions
Fachzeitschrift
Zu den Favoriten
173

Average case complexity for finite Boolean functions
A.V. Chashkin
Discrete Applied Mathematics. 114:43-59

Complexity of computatio... Analysis of algorithms a... Applied Mathematics 0211 other engineering a... average case complexity Complexity
Fachzeitschrift
Zu den Favoriten
174

On an infinite sequence of improving Boolean bases
D.U. Cherukhin
Discrete Applied Mathematics. 114:95-108

Complexity of computatio... 0209 industrial biotechn... Analysis of algorithms a... Applied Mathematics finite complete bases Complexity
Fachzeitschrift
Zu den Favoriten
175

Lower bounds for the complexity of restrictions of Boolean functions
A.V. Chashkin
Discrete Applied Mathematics. 114:61-93

Complexity of computatio... circuit size complexity Analysis of algorithms a... Applied Mathematics Switching theory, applic... Boolean functions
Fachzeitschrift
Zu den Favoriten
176

The Helping Hierarchy: The helping hierarchy
CINTIOLI, Patrizio ; SILVESTRI R.
RAIRO - Theoretical Informatics and Applications. 35:367-377

Complexity of computatio... Complexity classes (hier... 0102 computer and inform... Models of computation (T... 0101 mathematics 01 natural sciences
Fachzeitschrift
Zu den Favoriten
177

Index sets and parametric reductions
Michael R. Fellows ; Rodney G. Downey
Archive for Mathematical Logic. 40:329-348

Complexity of computatio... index sets polynomial reducibilitie... Other degrees and reduci... Complexity classes (hier... parameterized computatio...
Fachzeitschrift
Zu den Favoriten
178

Two variable first-order logic over ordered domains
Martin Otto
Journal of Symbolic Logic. 66:685-702

Complexity of computatio... Analysis of algorithms a... satisfiability problem finite satisfiability decidability complexity of decision p...
Fachzeitschrift
Zu den Favoriten
179

On the computational content of intuitionistic propositional proofs
Samuel R. Buss ; Pavel Pudlák
Annals of Pure and Applied Logic. 109:49-64

Complexity of proofs propositional proof syst... Complexity of computatio... polynomial time Logic disjunction property
Fachzeitschrift
Zu den Favoriten
180

On Genericity and Ershov's Hierarchy: On genericity and Ershov's hierarchy
Amy Gale ; Rodney G. Downey
MLQ. 47:161-182

Complexity of computatio... strings Recursively (computably)... 1-generic sets computably enumerable se... density functions
Fachzeitschrift
Zu den Favoriten

Filter