Showing 241 - 260 of 1,231

241

Sentences over Integral Domains and Their Computational Complexities: Sentences over integral domains and their computational complexities
Shih Ping Tung
Information and Computation. 149:99-133

algebraic integer rings Decidability and field t... Complexity of computatio... Analysis of algorithms a... Hilbertian fields Hilbert's irreducibility...
Academic journal
Save to List
242

The complexity of theory revision
Russell Greiner
Artificial Intelligence. 107:175-217

Complexity of computatio... Logic in artificial inte... Analysis of algorithms a... Computational learning t... Inductive logic programm... 0102 computer and inform...
Academic journal
Save to List
243

Lifting independence results in bounded arithmetic
Jan Krajíček ; Mario Chiari
Archive for Mathematical Logic. 38:123-138

First-order arithmetic a... Complexity of computatio... lifting method Ramsey's theorem Complexity classes (hier... 0101 mathematics
Academic journal
Save to List
244

A minimal code list
Harley Flanders ; Herbert Fischer
Theoretical Computer Science. 215:345-348

Complexity of computatio... Complexity and performan... Code list Analysis of algorithms a... Automatic differentiatio... Complexity
Academic journal
Save to List
245

Ranking Primitive Recursions: The Low Grzegorczyk Classes Revisited: Ranking primitive recursions: The low Grzegorczyk classes revisited
Stephen J. Bellantoni ; Karl-Heinz Niggl
SIAM Journal on Computing. 29:401-415

Complexity of computatio... predicativity computational complexity ramified recursion polynomial time linear space
Academic journal
Save to List
246

The Complexity of Modellability in Finite and Computable Signatures of a Constraint Logic for Head-Driven Phrase Structure Grammar: The complexity of modellability in finite and computable signatures of a constraint logic for head-driven phrase structure grammar
Bjørn Aldag ; Kiril Simov ; Paul John King
Journal of Logic, Language and Information. 8:83-110

Complexity of computatio... Decidability of theories... modellability in a signa... Analysis of algorithms a... Logic of natural languag... constraint logics
Academic journal
Save to List
247

About Segment Complexity of Turing Reductions: About segment complexity of Turing reductions
Valeriy K. Bulitko
Mathematical Logic Quarterly. 45:561-571

Complexity of computatio... Other Turing degree stru... Other degrees and reduci... Kolmogorov complexity hierarchy of relations jump inversion
Academic journal
Save to List
248

Towards the Actual Relationship Between NP and Exponential Time: Towards the actual relationship between NP and exponential time
Gerhard Lischke
Mathematical Logic Quarterly. 45:31-49

exponential time Complexity of computatio... immune set sparse set 0202 electrical engineer... Complexity classes (hier...
Academic journal
Save to List
249

Combinatorics of Monotone Computations: Combinatorics of monotone computations
Stasys Jukna
Combinatorica. 19:65-85

Complexity of computatio... Combinatorics in compute... Structure of proofs 0102 computer and inform... Models of computation (T... 01 natural sciences
Academic journal
Save to List
250

Lower bounds for the polynomial calculus
Alexander A. Razborov
Computational Complexity. 7:291-324

Complexity of proofs Complexity of computatio... 0102 computer and inform... Gröbner bases other bases for ideals a... polynomial calculus proo...
Academic journal
Save to List
251

Finite Variable Logics in Descriptive Complexity Theory: Finite variable logics in descriptive complexity theory
Grohe, Martin
Bulletin of Symbolic Logic. 4:345-398

Complexity of computatio... finite variable theories Model theory of finite s... 0102 computer and inform... finite variable logics 16. Peace & justice
Academic journal
Save to List
252

Some results on cut-elimination, provable well-orderings, induction and reflection
Toshiyasu Arai
Annals of Pure and Applied Logic. 95:93-184

Complexity of proofs Proof theory in general... computation of proof-the... Logic bar induction pruning
Academic journal
Save to List
253

Feasible graphs with standard universe
Department of Mathematics, University of Florida, Gainesville, FL 32611, USA ( host institution ) ; Cenzer, Douglas ( author ) ; Remmel, Jeffrey B. ( author )
Annals of Pure and Applied Logic. 94:21-35

Complexity of computatio... isomorphism problem Logic computable trees recursive graphs 68R10
Academic journal
Save to List
254

A restricted computation model on Scott domains and its partial primitive recursive functionals
Karl-Heinz Niggl
Archive for Mathematical Logic. 37:443-481

computability Complexity of computatio... parallelism parallel typed while pro... Semantics in the theory... simultaneous course-of-v...
Academic journal
Save to List
255

Witnessing functions in bounded arithmetic and search problems
Mario Chiari ; Jan Krajíček
Journal of Symbolic Logic. 63:1095-1115

search problems First-order arithmetic a... Complexity of computatio... separation computational complexity bounded arithmetic
Academic journal
Save to List
256

Forcing on bounded arithmetic II: Forcing on bounded arithmetic. II
Masahiro Yasumoto ; Gaisi Takeuti
Journal of Symbolic Logic. 63:860-868

Complexity of computatio... Other aspects of forcing... Models of arithmetic and... bounded arithmetic NP=co-NP 16. Peace & justice
Academic journal
Save to List
257

Planar Integer Linear Programming is NC Equivalent to Euclidean GCD: Planar integer linear programming is NC equivalent to Euclidean GCD
Yu Lin-Kriz ; D. F. Shallcross ; Victor Y. Pan
SIAM Journal on Computing. 27:960-971

Complexity of computatio... greatest common divisor 0211 other engineering a... Complexity classes (hier... Distributed algorithms 0102 computer and inform...
Academic journal
Save to List
258

Embedding Logics into Product Logic: Embedding logics into product logic
Jan Krajíček ; David Švejda ; Petr Hájek ; et al.
Studia Logica. 61:35-47

arithmetical hierarchy Complexity of computatio... 0102 computer and inform... Fuzzy logic logic of vagueness 01 natural sciences
Academic journal
Save to List
259

embedding logics into product logic: Embedding logics into product logic
Jan Krajíček ; David Švejda ; Petr Hájek ; et al.
Studia Logica. 61(1):35-47

arithmetical hierarchy Complexity of computatio... product logic satisfiability Many-valued logic Computational difficulty...
Academic journal
Save to List
260

Computational model theory: an overview: Computational model theory: An overview
Moshe Y. Vardi
Logic Journal of IGPL. 6:601-624

Complexity of computatio... relational machine Research exposition (mon... expressibility Database theory infinitary logics
Academic journal
Save to List

Filter