Suchergebnisse - F.1.3 [Computation by Abstract Devices] Complexity Measures and Classes
-
1
Autoren:
Weitere Verfasser:
Schlagwörter: Categories and Subject Descriptors, E.3 [Data Encryption, Public-key Cryptosystems, F.1.3 [Computation by Abstract Devices, Complexity Measures and Classes—Complexity hierarchies, Relations among complexity classes, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures General Terms, Theory, Security, Algorithms Additional Key Words and Phrases, complexity theory, public-key cryptography, secret-key agreement, digital signatures, interactive proof systems, zero-knowledge protocols, one-way functions
Dateibeschreibung: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.6969; http://arxiv.org/pdf/cs/0111056v2.pdf
-
2
Weitere Verfasser: The Pennsylvania State University CiteSeerX Archives
Dateibeschreibung: application/postscript
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.747; http://www.math.cas.cz/~pudlak/wires.ps
-
3
Autoren:
Weitere Verfasser:
Schlagwörter: Categories and Subject Descriptors H.2.4 [Database Management, Languages—Query languages, F.1.3 [Computation by Abstract Devices, Complexity measures and classes, G.2.2 [Discrete Mathematics
Dateibeschreibung: application/pdf
-
4
Autoren:
Weitere Verfasser:
Schlagwörter: Categories and Subject Descriptors F.4.1 [Mathematical Logic and Formal Languages, Mathematical Logic, F.1.3 [Computation by Abstract Devices, Complexity Measures and Classes General Terms Logic, algorithmic, databases
Dateibeschreibung: application/pdf
-
5
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: Categories and Subject Descriptors, F.1.1 [Computation by Abstract Devices, Models of Computation, F.1.3 [Computation by Abstract Devices, Complexity Measures and Classes, F.4.1 [Mathematical Logic and Formal Languages, Mathematical Logic, F.4.3 [Mathematical Logic and Formal Languages, Formal Languages, H.2.3 [Database Management, Languages General Terms, Languages, Theory
Dateibeschreibung: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.4997; http://alpha.uhasselt.be/~fneven/papers/unrankedtocl.pdf
-
6
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: Categories and Subject Descriptors F.1.3 [Computation by Abstract Devices, Complexity Measures and Classes, F.1.1 [Computation by Abstract Devices, Models of Computation General Terms Theory, Languages Keywords complexity, data streams / real-time data, query processing / query optimization, semi-structured data
Dateibeschreibung: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.5812; http://arxiv.org/pdf/cs/0703081v1.pdf
-
7
Autoren:
Weitere Verfasser:
Schlagwörter: Categories and Subject Descriptors, F.4.1 [Mathematical Logic and Formal Languages, Mathematical Logic, F.1.3 [Computation by Abstract Devices, Complexity Measures and Classes General Terms, Logic, algorithmic Additional Key Words and Phrases, Monadic Second-Order, bounded tree-width, enumeration ACM Reference Format
Dateibeschreibung: application/pdf
-
8
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: and concurrency, F.1.3 [Computation by Abstract Devices, Complexity Measures and Classes—reducibility and completeness, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—sequencing and scheduling General Terms, Algorithms, Performance, The
Dateibeschreibung: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.192.670; http://www.cs.yale.edu/publications/techreports/tr1423.pdf
-
9
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: Microcomputers, F.1.3 [Computation by Abstract Devices, Complexity Measures and Classes General Terms Algorithms, Performance, Design Keywords Scratchpad Memory, Optimization Algorithm, Dynamic Programming, Embedded Design, Memory Hierarchy, Power Saving, Design Automation, Executable Patching, Post-Compiler Processing
Dateibeschreibung: application/pdf
-
10
Autoren:
Weitere Verfasser:
Schlagwörter: Mathematical Logic—Logic and constraint programming, G.2.1 [Discrete Mathematics, Combinatorics—Combinatorial algorithms, F.1.3 [Computation by Abstract Devices, Complexity Measures and Classes—Reducibility and completeness General Terms, Algorithms, Theory Additional Key Words and Phrases, complexity, Constraint Satisfaction Problem, dichotomy theorem, homomorphism
Dateibeschreibung: application/pdf
-
11
Autoren:
Weitere Verfasser:
Schlagwörter: Categories and Subject Descriptors, F.4.1 [Mathematical Logic and Formal Languages, Mathematical Logic--Logic and constraint programming, G.2.1 [Discrete Mathematics, Combinatorics--Combinatorial algorithms, F.1.3 [Computation by Abstract Devices, Complexity Measures and Classes--Reducibility and completeness General Terms, Algorithms, Theory Additional Key Words and Phrases, Constraint Satisfaction problem, homomorphism problem, complexity, dichotomy theorem
Dateibeschreibung: application/postscript
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.9544; http://www.cs.sfu.ca/~abulatov/papers/consfull.ps
-
12
Autoren:
Weitere Verfasser:
Schlagwörter: Categories and Subject Descriptors, F.4.1 [Mathematical Logic and Formal Languages, Mathematical Logic— Logic and constraint programming, G.2.1 [Discrete Mathematics, Combinatorics—Combinatorial algorithms, F.1.3 [Computation by Abstract Devices, Complexity Measures and Classes—Reducibility and completeness General Terms, Algorithms, Theory Additional Key Words and Phrases, Constraint Satisfaction problem, counting problems, com- plexity
Dateibeschreibung: application/pdf
-
13
Autoren: et al.
Quelle: Journal of the ACM; Apr2012, Vol. 59 Issue 2, p6.1-6.48, 48p
-
14
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: Categories and Subject Descriptors, F.1.3 [Computation by Abstract Devices, Complexity Measures and Classes—Reducibility and completeness, Relations among complexity classes, F.2.2 [Analysis of Algo- rithms and Problem Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures, F.4.1 [Mathematical Logic and Formal Languages
Dateibeschreibung: application/pdf
-
15
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: Categories and Subject Descriptors, F.1.1 [Computation by Abstract Devices, Models of Computation, F.1.3 [Computation by Abstract Devices, Complexity Measures and Classes, F.4.1 [Mathematical Logic and Formal Languages, Mathematical Logic, F.4.3 [Mathematical Logic and Formal Languages, Formal Languages, H.2.3 [Database Management, Languages General Terms, Languages, Theory
Dateibeschreibung: application/pdf
-
16
Autoren:
Weitere Verfasser:
Schlagwörter: Mathematical Logic—Lambda calculus and related systems, F.1.3 [Computation by Abstract Devices, Complexity Measures and Classes—Machine-independent complexity General Terms, Languages, Performance, Theory Additional Key Words and Phrases, Geometry of interaction, implicit computational complexity, linear
Dateibeschreibung: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.130.5986; http://tocl.acm.org/accepted/330dallago.pdf
-
17
Autoren:
Weitere Verfasser:
Schlagwörter: Categories and Subject Descriptors F.4.1 [Mathematical Logic and Formal Languages, Mathematical Logic, F.1.3 [Computation by Abstract Devices, Complexity Measures and Classes General Terms Logic, algorithmic, databases
Dateibeschreibung: application/pdf
-
18
Autoren:
Weitere Verfasser:
Schlagwörter: Categories and Subject Descriptors, E.3 [Data Encryption, F.1.3 [Computation by Abstract Devices, Complexity Measures and Classes, F.2 [Analysis of Algorithms and Problem Com- plexity, G.3 [Probability and Statistics, G.4 [Mathematical Software] General Terms, Algorithms, Security, Theory Additional Key Words and Phrases, Pseudo-random functions, factoring, decision Diffie–Hellman, constant-depth threshold circuits, natural proofs, learning theory
Dateibeschreibung: application/pdf
-
19
Autoren:
Weitere Verfasser:
Schlagwörter: Categories and Subject Descriptors, F.1.3 [Computation by Abstract Devices, Complexity Measures and Classes—Reducibility and Completeness, F.4.1 [Mathematical Logic and Formal Languages, Mathematical Logic—Computability Theory, Computational Logic General Terms, Theory Additional Key Words and Phrases, Computability logic, computational complexity, game semantics, interactive
Dateibeschreibung: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.5211; http://tocl.acm.org/accepted/bauer_pspace.pdf
-
20
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: Categories and Subject Descriptors, F.4.1 [Mathematical Logic and Formal Languages, Mathematical Logic, F.1.3 [Computation by Abstract Devices, Complexity Measures and Classes General Terms, Logic, algorithmic Additional Key Words and Phrases, Monadic Second-Order, bounded tree-width, enumeration 1. INTRODUCTION
Dateibeschreibung: application/pdf
Nájsť tento článok vo Web of Science 
Full Text Finder