Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
646
search results - page 130 / 130
»
Generalized connected domination in graphs
Sort
relevance
views
votes
recent
update
View
thumb
title
56
click to vote
DIMACS
1996
173
views
Theoretical Computer Science
»
more
DIMACS 1996
»
Easier Ways to Win Logical Games
13 years 10 months ago
Download
homepages.inf.ed.ac.uk
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
claim paper
Read More »
« Prev
« First
page 130 / 130
Last »
Next »