Výsledky vyhledávání - "F.1.3 [Computation by Abstract Devices] Complexity Measures and Classes"

Categories and Subject Descriptors F.1.3 [Computation by Abstract Devices]: Complexity Measures and Classes General Terms Theory

Přispěvatelé: The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.math.cas.cz/~pudlak/wires.ps.

Témata: gates, etc

Popis souboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.747; http://www.math.cas.cz/~pudlak/wires.ps

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.747
http://www.math.cas.cz/~pudlak/wires.ps

On the (Im)possibility of Obfuscating Programs.

Autoři: BARAK, BOAZ GOLDREICH, ODED IMPAGLIAZZO, RUSSELL a další

Zdroj: Journal of the ACM; Apr2012, Vol. 59 Issue 2, p6.1-6.48, 48p

Témata: DATA encryption, COMPUTER operating system security measures, CRYPTOGRAPHY software, COMPUTATIONAL complexity, MATHEMATICAL proofs, MACHINE theory, COMPILERS (Computer programs)

The NP-Completeness Column: The Many Limits on Approximation.

Autoři: Johnson, David S.

Zdroj: ACM Transactions on Algorithms; 2006, Vol. 2 Issue 3, p473-489, 17p

Témata: ALGORITHMS, MATHEMATICAL optimization, SURETYSHIP & guaranty, MATHEMATICAL analysis

People: GAREY, M. R., FREEMAN, W. H.

Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors.

Autoři: GROHE, MARTIN

Zdroj: Journal of the ACM; Oct2012, Vol. 59 Issue 5, p27-64, 64p

Témata: POLYNOMIALS, GRAPH theory, FIXED point theory, ALGORITHMS, COMBINATORICS, EMBEDDED computer systems

Approximating the Partition Function of the Ferromagnetic Potts Model.

Autoři: GOLDBERG, LESLIE ANN JERRUM, MARK

Zdroj: Journal of the ACM; Oct2012, Vol. 59 Issue 5, p25-31, 31p

Témata: PARTITION functions, PARALLEL algorithms, FERROMAGNETIC materials, PROBABILITY theory, DISTRIBUTION (Probability theory), APPROXIMATION theory

On P vs. NP and Geometric Complexity Theory.

Autoři: MULMULEY, KETAN D.

Zdroj: Journal of the ACM; Apr2011, Vol. 58 Issue 2, p5:1-5:26, 26p

Témata: COMPUTER research, ALGEBRAIC geometry, COMPUTATIONAL complexity, PARADOX, MATHEMATICAL decomposition, THEORY, HYPOTHESIS

Lower Bounds for Processing Data with Few Random Accesses to External Memory.

Autoři: GROHE, MARTIN HERNICH, ANDRÉ SCHWEIKARDT, NICOLE

Zdroj: Journal of the ACM; May2009, Vol. 56 Issue 3, p12:1-12:58, 58p, 7 Diagrams

Témata: XML (Extensible Markup Language), HARD disks, SQL, COMPUTER storage devices, DATA disk drives, INFORMATION storage & retrieval systems, DATABASES, ALGORITHMS, RELATIONAL databases

The Complexity of Online Memory Checking.

Autoři: NAOR, MONI ROTHBLUM, GUY N.

Zdroj: Journal of the ACM; Jan2009, Vol. 56 Issue 1, p2:1-2:46, 46p

Témata: DATA encryption, COMPUTER network security, CRYPTOGRAPHY, COMPUTER science research, DIGITAL signatures, CLIENT/SERVER computing, INTERNET servers

The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Side.

Autoři: Grohe, Martin

Zdroj: Journal of the ACM; Mar2007, Vol. 54 Issue 1, p1-24, 24p, 2 Illustrations

Témata: HOMOMORPHISMS, CONSTRAINT satisfaction, MATHEMATICS, ARTIFICIAL intelligence, MATHEMATICAL functions

Conjunctive Queries over Trees.

Autoři: Gottlob, Georg Koch, Christoph Schulz, Klaus U.

Zdroj: Journal of the ACM; Mar2006, Vol. 53 Issue 2, p238-272, 35p

Témata: QUERYING (Computer science), TREES, BINARY principle (Linguistics), POLYNOMIALS, LINGUISTIC analysis

An Implicit Characterization of PSPACE.

Autoři: Gaboardi, Marco Marion, Jean-Yves Della Rocca, Simona Ronchi

Zdroj: ACM Transactions on Computational Logic; Apr2012, Vol. 13 Issue 2, p18:1-18:36, 36p

Témata: LAMBDA calculus, MATHEMATICAL logic, BOOLEAN algebra, CONDITIONALS (Logic), POLYNOMIALS, TURING machines, MACHINE theory, DETERMINISTIC algorithms

On the Relative Strength of Pebbling and Resolution.

Autoři: Nordström, Jakob

Zdroj: ACM Transactions on Computational Logic; Apr2012, Vol. 13 Issue 2, p16:1-16:43, 43p

Témata: FREE resolutions (Algebra), COMPUTATIONAL complexity, MATHEMATICAL formulas, GRAPH theory, COMPUTER simulation, PROOF theory

Complexity of Conservative Constraint Satisfaction Problems.

Autoři: BULATOV, ANDREI A.

Zdroj: ACM Transactions on Computational Logic; Jul2011, Vol. 12 Issue 4, p24-24:66, 66p

Témata: COMPUTATIONAL complexity, CONSTRAINT satisfaction, MATHEMATICAL variables, NP-complete problems, GRAPH coloring, POLYNOMIALS, DIRECTED graphs, HOMOMORPHISMS

S-T Connectivity on Digraphs with a Known Stationary Distribution.

Autoři: KAI-MIN CHUNG REINGOLD, OMER VADHAN, SALIL

Zdroj: ACM Transactions on Algorithms; 2011, Vol. 7 Issue 3, p30-30:21, 21p

Témata: DIRECTED graphs, GRAPH connectivity, DISTRIBUTION (Probability theory), ALGORITHMS, RANDOM walks, POLYNOMIALS, PROBLEM solving

Pure Pointer Programs with Iteration.

Autoři: Hofmann, Martin Schöpp, Ulrich

Zdroj: ACM Transactions on Computational Logic; Jul2010, Vol. 11 Issue 4, p26:1-26:23, 23p, 2 Diagrams

Témata: GRAPH algorithms, DATA analysis, MATHEMATICAL analysis, MATHEMATICAL optimization, MATHEMATICS education

A New Function Algebra of EXPTIME Functions by Safe Nested Recursion.

Autoři: Arai, Toshiyasu Eguchi, Naohi

Zdroj: ACM Transactions on Computational Logic; Aug2009, Vol. 10 Issue 4, p24-24:19, 19p

Témata: FUNCTION algebras, POLYNOMIALS, RECURSION theory, EXPONENTIAL functions, DIFFERENTIAL equations

Compacting Cuts: A New Linear Formulation for Minimum Cut.

Autoři: Carr, Robert D. Konjevod, Goran Little, Greg a další

Zdroj: ACM Transactions on Algorithms; 2009, Vol. 5 Issue 3, p27-27.16, 16p

Témata: LINEAR programming, NP-complete problems, MATHEMATICAL optimization, INTEGER programming, GRAPH theory, COMPUTATIONAL complexity

The Geometry of Linear Higher-Order Recursion.

Autoři: Lago, Ugo Dal

Zdroj: ACM Transactions on Computational Logic; Feb2009, Vol. 10 Issue 2, p8-8.38, 38p, 6 Diagrams, 6 Charts

Témata: RECURSION theory, MATHEMATICAL logic, LINEAR dependence (Mathematics), POLYNOMIALS, LAMBDA calculus

A Logical Characterization of the Counting Hierarchy.

Autoři: KONTINEN, JUHA

Zdroj: ACM Transactions on Computational Logic; Jan2009, Vol. 10 Issue 1, p7-7:21, 21p

Témata: HIERARCHIES, POLYNOMIALS, MATHEMATICAL logic, RATIONAL numbers, REAL numbers

First-Order Queries on Structures of Bounded Degree are Computable with Constant Delay.

Autoři: Durand, Arnaud Grandjean, Etienne

Zdroj: ACM Transactions on Computational Logic; Aug2007, Vol. 8 Issue 4, p1-19, 19p, 3 Diagrams, 1 Graph

Témata: COMPUTATIONAL complexity, ELECTRONIC data processing, COMBINATORIAL enumeration problems, FIRST-order logic, MATHEMATICAL logic, CREATIVE ability