Showing 1 - 20 of 1,231

1

Computational Complexity of Theories of a Binary Predicate with a Small Number of Variables: Computational complexity of theories of a binary predicate with a small number of variables
Rybakov, M.
Doklady Mathematics. 106:458-461

Complexity of computatio... Church's theorem Trakhtenbrot's theorem undecidability 0102 computer and inform... 0101 mathematics
Academic journal
Save to List
2

A Logarithmic Lower Bound for Oblivious RAM (for All Parameters): A logarithmic lower bound for oblivious RAM (for all parameters)
Ilan Komargodski ; Wei-Kai Lin
Lecture Notes in Computer Science ISBN: 9783030842581

Complexity of computatio... Data structures Data encryption (aspects... cell-probe complexity Cryptography Computational difficulty...
Book
Save to List
3

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
Rybakov, M.
Russian Mathematics. 66:33-48

word problem Complexity of computatio... finitely generated algeb... pseudo-Boolean algebra Heyting algebra 0102 computer and inform...
Academic journal
Save to List
4

On the coprimeness relation from the viewpoint of monadic second-order logic
Speranski, Stanislav O. ; Pakhomov, Fedor N.
Izvestiya: Mathematics. 86:1225-1239

definability weak arithmetics Complexity of computatio... coprimeness monadic second-order log... Interpolation, preservat...
Academic journal
Save to List
5

Physical Computational Complexity and First-order Logic: Physical computational complexity and first-order logic
Richard Whyman
Fundamenta Informaticae. 181:129-161

Complexity of computatio... computable analysis Blum-Shub-Smale machines 0102 computer and inform... 01 natural sciences hypercomputation
Academic journal
Save to List
6

The Complexity of Decomposability of Computable Rings: The complexity of decomposability of computable rings
Wu, Huishan
Notre Dame Journal of Formal Logic. 64

Complexity of computatio... block decomposable rings decomposable rings computable rings Computable structure the... Theory of numerations, e...
Academic journal
Save to List
7

CONSISTENCY PROOF OF A FRAGMENT OF PV WITH SUBSTITUTION IN BOUNDED ARITHMETIC: Consistency proof of a fragment of PV with substitution in bounded arithmetic
Yoriyuki Yamagata
The Journal of Symbolic Logic. 83:1063-1090

FOS: Computer and inform... First-order arithmetic a... Complexity of computatio... Computer Science - Logic... computational complexity consistency proof
Academic journal
Save to List
8

One Query Reducibilities Between Partial Information Classes: One query reducibilities between partial information classes
Arfst Nickelsen ; Sebastian Bab
Lecture Notes in Computer Science ISBN: 9783540228233

Complexity of computatio... cheatable language Membership comparable Easily countable Formal languages and aut... 0102 computer and inform...
Book
Save to List
9

A Reducibility for the Dot-Depth Hierarchy: A reducibility for the dot-depth hierarchy
Victor L. Selivanov ; Klaus W. Wagner
Lecture Notes in Computer Science ISBN: 9783540228233

Complexity of computatio... Complete sets 0102 computer and inform... 01 natural sciences Hierarchies of computabi... Theoretical Computer Sci...
Book
Save to List
10

Space complexity of random formulae in resolution
BEN SASSON E. ; GALESI, NICOLA
Proceedings 16th Annual IEEE Conference on Computational Complexity. :42-51

Complexity of proofs Complexity of computatio... space complexity of refu... treelike resolution refu... 0102 computer and inform... lower bounds on the clau...
Academic journal
Save to List
11

Lower bounds and the hardness of counting properties
Mayur Thakur ; Lane A. Hemaspaandra
Foundations of Information Technology in the Era of Network and Mobile Computing ISBN: 9781475752755

Complexity of computatio... Counting properties UP Relativization Rice's Theorem Lower bounds
Academic journal
Save to List
12

Comparing Verboseness for Finite Automata and Turing Machines: Comparing verboseness for finite automata and Turing machines
Till Tantau
Lecture Notes in Computer Science ISBN: 9783540432838

Complexity of computatio... Complexity classes (hier... Modes of computation (no... Formal languages and aut... verboseness finite automata
Book
Save to List
13

Relating Automata-Theoretic Hierarchies to Complexity-Theoretic Hierarchies: Relating automata-theoretic hierarchies to complexity-theoretic hierarchies
Victor L. Selivanov
Lecture Notes in Computer Science ISBN: 9783540424871

Complexity of computatio... 4. Education fine hierarchy complexity theory Formal languages and aut... 0102 computer and inform...
Book
Save to List
14

There Are No Sparse NPw-Hard Sets: There are no sparse NP\(_{w}\)-hard sets
Dima Grigoriev ; Felipe Cucker
Lecture Notes in Computer Science ISBN: 9783540424963

Complexity of computatio... 4. Education structural complexity Complexity classes (hier... Computational difficulty... real number computations
Book
Save to List
15

Randomness is hard
Buhrman, H.M. ; Torenvliet, L.
Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247). :249-260

interactive proofs Complexity of computatio... CND complexity Kolmogorov complexity randomness Modes of computation (no...
Academic journal
Save to List
16

Almost complete sets: Almost complete sets.
Sebastiaan A. Terwijn ; Wolfgang Merkle ; Klaus Ambos-Spies ; et al.
Lecture Notes in Computer Science ISBN: 9783540671411

Completeness almost completeness Complexity of computatio... many-one reductions Weak completeness Resource-bounded measure
Academic journal
Save to List
17

The Global Power of Additional Queries to p-Random Oracles: The global power of additional queries to \(p\)-random oracles
Wolfgang Merkle
Lecture Notes in Computer Science ISBN: 9783540677154

Complexity of computatio... 4. Education random oracles 0102 computer and inform... 02 engineering and techn... 01 natural sciences
Book
Save to List
18

Extending Downward Collapse from 1-versus-2 Queries tom-versus-m+ 1 Queries: Extending downward collapse from 1-versus-2 queries to \(m\)-versus-\(m + 1\) queries
Edith Hemaspaandra ; Lane A. Hemaspaandra ; Harald Hempel
Lecture Notes in Computer Science ISBN: 9783540656913

Boolean hierarchy Complexity of computatio... 4. Education no-search easy-hard tech... Modes of computation (no... computational complexity...
Academic journal
Save to List
19

Restrictive acceptance suffices for equivalence problems
Lane A. Hemaspaandra ; Jörg Rothe ; Bernd Borchert
Lecture Notes in Computer Science ISBN: 9783540664123

FOS: Computer and inform... Complexity of computatio... Computer Science - Compu... 0202 electrical engineer... Complexity classes (hier... Modes of computation (no...
Book
Save to List
20

Computationally-Sound Proofs: Computationally sound proofs
Micali, S.
Logic Colloquium '95 ISBN: 9781107167902
Lecture Notes in Logic ISBN: 9783540639947
Johann A. Makowsky, Elena V. Ravve, eds., Logic Colloquium '95: Proceedings of the Annual European Summer Meeting of the Association of Symbolic Logic, held in Haifa, Israel, August 9-18, 1995 (Berlin: Springer-Verlag, 1998), 214-268

interactive proofs Complexity of computatio... Complexity classes (hier... random oracles Merkle trees 0102 computer and inform...
Book
Save to List

Filter