Skip to search formSkip to main contentSkip to account menu

Pebble game

In mathematics and computer science, a pebble game is a type of mathematical game played by moving "pebbles" or "markers" on a directed graph. A… 
Wikipedia (opens in a new tab)

Related topics

Related topics

11 relations
Computational complexity theoryComputer scienceDSPACEDTIME

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Catena: A Memory-Consuming Password Scrambler
It is a common wisdom that servers should better store the one-way hash of their clients’ passwords, rather than storing the… 
Highly Cited
2012
Highly Cited
2012
On the virtue of succinct proofs: amplifying communication complexity hardness to time-space trade-offs in proof complexity
An active line of research in proof complexity over the last decade has been the study of proof space and trade-offs between size… 
Highly Cited
2012
Highly Cited
2012
PEBBLE GAMES AND LINEAR EQUATIONS
Abstract We give a new, simplified and detailed account of the correspondence between levels of the Sherali–Adams relaxation of… 
Review
2006
Review
2006
A Pebble Game for Internet-Based Computing
Advances in technology have rendered the Internet a viable medium for employing multiple independent computers collaboratively in… 
Highly Cited
2006
Highly Cited
2006
Datalog and constraint satisfaction with infinite templates
Highly Cited
1999
Highly Cited
1999
Investigating a general hierarchy of polynomially decidable classes of CNF's based on short tree-like resolution proofs
  • O. Kullmann
  • Electron. Colloquium Comput. Complex.
  • 1999
  • Corpus ID: 38047896
We investigate a hierarchy Gk (U; S) of classes of conjunctive normal forms, recognizable and SAT-decidable in polynomial time… 
Highly Cited
1992
Highly Cited
1992
Generalized quantifiers and pebble games on finite structures
Generalized quantifiers in the realm of finite structures are studied and combined with an infinitary logic L/sub infinity omega… 
1986
1986
A new pebble game that characterizes parallel complexity classes
A new two-person pebble game that models parallel computations is defined. This game extends the two-person pebble game defined… 
1978
1978
Improved bounds on the problem of time-space trade-off in the pebble game
  • R. Reischuk
  • 19th Annual Symposium on Foundations of Computer…
  • 1978
  • Corpus ID: 8673404
Every family of graphs Gn with n nodes and bounded in-degree can be pebbled with o(n) pebbles in time o(n 1+c) for all c≫0. There… 
Highly Cited
1977
Highly Cited
1977
Time-space trade-offs in a pebble game
SummaryA certain pebble game on graphs has been studied in various contexts as a model for the time and space requirements of… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)