skip to main content
Idioma:
Primo Advanced Search
Primo Advanced Search Query Term
Primo Advanced Search Query Term
Primo Advanced Search Query Term
Primo Advanced Search prefilters
Busca Simples
Mostrar Somente
Refinado por: assunto: Combinatorics. Ordered Structures remover ACM Digital Library Complete remover assunto: Computer Science, Software Engineering remover Algorithmics. Computability. Computer Arithmetics remover
Result Number Material Type Add to My Shelf Action Record Details and Options
1
Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries
Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries
Material Type:
Artigo 		Adicionar ao Meu Espaço

Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries

MARX, Daniel

Journal of the ACM, 2013-11, Vol.60 (6), p.1-51 [Periódico revisado por pares]

New York, NY: Association for Computing Machinery

Texto completo disponível

Citações Citado por
2
Eigenvalue Bounds, Spectral Partitioning, and Metrical Deformations via Flows
Eigenvalue Bounds, Spectral Partitioning, and Metrical Deformations via Flows
Material Type:
Artigo 		Adicionar ao Meu Espaço

Eigenvalue Bounds, Spectral Partitioning, and Metrical Deformations via Flows

BISWAL, Punyashloka ; LEE, James R ; RAO, Satish

Journal of the ACM, 2010-03, Vol.57 (3), p.1-23 [Periódico revisado por pares]

New York, NY: Association for Computing Machinery

Texto completo disponível

Citações Citado por
3
Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors
Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors
Material Type:
Artigo 		Adicionar ao Meu Espaço

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

GROHE, Martin

Journal of the ACM, 2012-10, Vol.59 (5), p.1-64 [Periódico revisado por pares]

New York, NY: Association for Computing Machinery

Texto completo disponível

Citações Citado por
4
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
Material Type:
Artigo 		Adicionar ao Meu Espaço

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

GOEMANS, M. X ; WILLIAMSON, D. P

Journal of the ACM, 1995-11, Vol.42 (6), p.1115-1145 [Periódico revisado por pares]

New York, NY: Association for Computing Machinery

Texto completo disponível

Citações Citado por
5
Efficient Core Computation in Data Exchange
Efficient Core Computation in Data Exchange
Material Type:
Artigo 		Adicionar ao Meu Espaço

Efficient Core Computation in Data Exchange

GOTTLOB, Georg ; NASH, Alan

Journal of the ACM, 2008-05, Vol.55 (2), p.1-49 [Periódico revisado por pares]

New York, NY: Association for Computing Machinery

Texto completo disponível

Citações Citado por
6
A Graph-Theoretic Approach to Map Conceptual Designs to XML Schemas
A Graph-Theoretic Approach to Map Conceptual Designs to XML Schemas
Material Type:
Artigo 		Adicionar ao Meu Espaço

A Graph-Theoretic Approach to Map Conceptual Designs to XML Schemas

FRANCESCHET, Massimo ; GUBIANI, Donatella ; MONTANARI, Angelo ; PIAZZA, Carla

ACM transactions on database systems, 2013-04, Vol.38 (1), p.1-44 [Periódico revisado por pares]

New York, NY: Association for Computing Machinery

Texto completo disponível

Citações Citado por
7
Trade-offs for fully dynamic transitive closure on DAGs: Breaking through the O(n2) barrier
Trade-offs for fully dynamic transitive closure on DAGs: Breaking through the O(n2) barrier
Material Type:
Artigo 		Adicionar ao Meu Espaço

Trade-offs for fully dynamic transitive closure on DAGs: Breaking through the O(n2) barrier

DEMETRESCU, Camil ; ITALIANO, Giuseppe F

Journal of the ACM, 2005-03, Vol.52 (2), p.147-156 [Periódico revisado por pares]

New York, NY: Association for Computing Machinery

Texto completo disponível

Citações Citado por
8
Spectral Sparsification of Graphs: Theory and Algorithms
Spectral Sparsification of Graphs: Theory and Algorithms
Material Type:
magazinearticle 		Adicionar ao Meu Espaço

Spectral Sparsification of Graphs: Theory and Algorithms

BATSON, Joshua ; SPIELMAN, Daniel A ; SRIVASTAVA, Nikhil ; TENG, Shang-Hua

Communications of the ACM, 2013-08, Vol.56 (8), p.87-94

New York, NY: Association for Computing Machinery

Texto completo disponível

Citações Citado por
9
From Polynomial Time Queries to Graph Structure Theory
From Polynomial Time Queries to Graph Structure Theory
Material Type:
magazinearticle 		Adicionar ao Meu Espaço

From Polynomial Time Queries to Graph Structure Theory

GROHE, Martin

Communications of the ACM, 2011-06, Vol.54 (6), p.104-112

New York, NY: Association for Computing Machinery

Texto completo disponível

Citações Citado por

Personalize Seus Resultados

  1. Editar

Refine Search Results

Expandir Meus Resultados

  1.   

Mostrar Somente

  1. Revistas revisadas por pares (7)

  • Realização: ABCD-USP USP   Logos de Redes Sociais: Freepik

Buscando em bases de dados remotas. Favor aguardar.